Capacity-Region-Achieving Sparse Regression Codes for MIMO Multiple-Access Channels

April 13, 2026 ยท Grace Period ยท + Add venue

โณ Grace Period
This paper is less than 90 days old. We give authors time to release their code before passing judgment.
Authors Hao Yan, Lei Liu, Yuhao Liu, Burak ร‡akmak, Giuseppe Caire arXiv ID 2604.11062 Category cs.IT: Information Theory Citations 0
Abstract
This paper proposes a coding framework for capacity-region-achieving sparse regression (SR) codes over MIMO multiple-access channels (MIMO-MAC), where a single SR code is used for each user at the transmitter. With random semi-unitary dictionary matrices applied for encoding, multiple-access OAMP (MA-OAMP) enables reliable parallel interference cancellation (PIC) at the receiver. Theoretically, an optimal coding principle with the MA-OAMP receiver, which achieves the sum capacity and, in combination with time sharing, achieves the entire capacity region, is established as the guiding principle for designing capacity-region-achieving codes. Accordingly, a coding scheme for capacity-region-achieving SR codes is proposed via proper power allocation over the position-modulated signals.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Information Theory