Coupling Data Transmission for Multiple-Access Communications

From MaRDI portal
Publication:5224092

DOI10.1109/TIT.2019.2898224zbMATH Open1432.94009arXiv1209.5785OpenAlexW2963271920WikidataQ128490253 ScholiaQ128490253MaRDI QIDQ5224092FDOQ5224092


Authors: Dmitri V. Truhachev, Christian B. Schlegel Edit this on Wikidata


Publication date: 19 July 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We consider a signaling format where the information to be communicated from one or multiple transmitters to a receiver is modulated via a superposition of independent data streams. Each data stream is formed by error-correction encoding, constellation mapping, replication and permutation of symbols, and application of signature sequences. The relations between the data bits and modulation symbols transmitted over the channel can be represented by a sparse graph. In the case where the modulated data streams are transmitted with time offsets the receiver observes spatial coupling of the individual graphs into a graph chain enabling efficient demodulation/decoding. We prove that a two-stage demodulation/decoding method, in which iterative demodulation based on symbol estimation and interference cancellation is followed by parallel error correction decoding, achieves capacity on the additive white Gaussian noise (AWGN) channel asymptotically. We compare the performance of the two-stage receiver to the receiver which utilizes hard feedback between the error-correction encoders and the iterative demodulator.


Full work available at URL: https://arxiv.org/abs/1209.5785




Recommendations




Cited In (3)





This page was built for publication: Coupling Data Transmission for Multiple-Access Communications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224092)