Multiple Access Demodulation in the Lifted Signal Graph With Spatial Coupling
From MaRDI portal
Publication:2989331
DOI10.1109/TIT.2012.2232965zbMATH Open1364.94201arXiv1107.4797MaRDI QIDQ2989331FDOQ2989331
Authors: Christian B. Schlegel, Dmitri V. Truhachev 
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: Demodulation in a random multiple access channel is considered where the signals are chosen uniformly randomly with unit energy, a model applicable to several modern transmission systems. It is shown that by lifting (replicating) the graph of this system and randomizing the graph connections, a simple iterative cancellation demodulator can be constructed which achieves the same performance as an optimal symbol-by-symbol detector of the original system. The iterative detector has a complexity that is linear in the number of users, while the direct optimal approach is known to be NP-hard. However, the maximal system load of this lifted graph is limited to alpha<2.07, even for signal-to-noise ratios going to infinity - the system is interference limited. We then show that by introducing spatial coupling between subsequent lifted graphs, and anchoring the initial graphs, this limitation can be avoided and arbitrary system loads are achievable. Our results apply to several well-documented system proposals, such as IDMA, partitioned spreading, and certain forms of MIMO communications.
Full work available at URL: https://arxiv.org/abs/1107.4797
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Modulation and demodulation in information and communication theory (94A14)
This page was built for publication: Multiple Access Demodulation in the Lifted Signal Graph With Spatial Coupling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989331)
