Capacity-Achieving Iterative LMMSE Detection for MIMO-NOMA Systems
Lei Liu, Chau Yuen, Yong Liang Guan, and Ying Li

TL;DR
This paper demonstrates that properly designed iterative LMMSE detection can achieve the full capacity region of MIMO-NOMA systems, offering a low-complexity alternative to optimal detection methods.
Contribution
It introduces matching conditions and area theorems for iterative detection, proving capacity-achieving performance in symmetric and asymmetric MIMO-NOMA systems.
Findings
Achieves the optimal capacity of symmetric MIMO-NOMA systems.
Achieves the optimal sum capacity of asymmetric MIMO-NOMA systems.
Designs practical iterative LMMSE detection for general asymmetric systems.
Abstract
This paper considers a Iterative Linear Minimum Mean Square Error (LMMSE) detection for the uplink Multiuser Multiple-Input and Multiple-Output (MU-MIMO) systems with Non-Orthogonal Multiple Access (NOMA), in which all the users interfere with each other both in the time domain and frequency domain. It is well known that the Iterative LMMSE detection greatly reduces the system computational complexity by departing the overall processing into many low-complexity distributed calculations that can be executed in parallel. However, it is generally considered to be suboptimal and achieves relatively poor performance due to its sub-optimal detector. In this paper, we firstly present the matching conditions and area theorems for the iterative detection of the MIMO-NOMA systems. Based on the matching conditions and area theorems, the achievable rate region of the Iterative LMMSE detection is…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
