WE2.R9.3

Multi-User SR-LDPC Codes via Coded Demixing with Applications to Cell-Free Systems

Jamison Ebert, Jean-Francois Chamberland, Krishna Narayanan, Texas A&M University, United States

Session:
Wireless 2

Track:
20: Wireless Communications and Networks

Location:
Lamda

Presentation Time:
Wed, 10 Jul, 12:10 - 12:30

Session Chair:
Tara Javidi, University of California San Diego
Abstract
Novel sparse regression LDPC (SR-LDPC) codes exhibit excellent performance over additive white Gaussian noise (AWGN) channels in part due to their natural provision of shaping gains. Though SR-LDPC-like codes have been considered within the context of single-user error correction and massive random access, they are yet to be examined as candidates for coordinated multi-user communication scenarios. This article explores this gap in the literature and demonstrates that SR-LDPC codes, when combined with coded demixing techniques, offer a new framework for efficient non-orthogonal multiple access (NOMA) in the context of coordinated multi-user communication channels. The ensuing communication scheme is referred to as MU-SR-LDPC coding. Empirical evidence suggests that MU-SR-LDPC coding can increase the sum-rate for a fixed Eb/N0 when compared to orthogonal multiple access (OMA) techniques such as time division multiple access (TDMA) or frequency division multiple access (FDMA). Importantly, MU-SR-LDPC coding enables a pragmatic solution path for user-centric cell-free communication systems with (local) joint decoding. Results are supported by numerical simulations
Resources