TL;DR
CMDNet introduces a probabilistic relaxation approach for low-complexity soft detection in large inverse linear problems like MIMO systems, combining iterative algorithms with deep unfolding for improved accuracy and reliability.
Contribution
It proposes CMD, a continuous relaxation-based MAP detection algorithm, and extends it into CMDNet with deep unfolding for online parameter optimization, enhancing soft detection in communication systems.
Findings
CMDNet achieves a favorable accuracy-complexity trade-off.
Soft outputs from CMDNet are reliable for decoding.
Numerical results outperform state-of-the-art methods.
Abstract
Following the great success of Machine Learning (ML), especially Deep Neural Networks (DNNs), in many research domains in 2010s, several ML-based approaches were proposed for detection in large inverse linear problems, e.g., massive MIMO systems. The main motivation behind is that the complexity of Maximum A-Posteriori (MAP) detection grows exponentially with system dimensions. Instead of using DNNs, essentially being a black-box, we take a slightly different approach and introduce a probabilistic Continuous relaxation of disCrete variables to MAP detection. Enabling close approximation and continuous optimization, we derive an iterative detection algorithm: Concrete MAP Detection (CMD). Furthermore, extending CMD by the idea of deep unfolding into CMDNet, we allow for (online) optimization of a small number of parameters to different working points while limiting complexity. In…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
