Constant Weight Codes With Gabor Dictionaries and Bayesian Decoding for Massive Random Access
- 7 November 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 22 (5) , 2917-2931
Abstract
This paper considers a general framework for massive random access based on sparse superposition coding. We provide guidelines for the code design and propose the use of constant-weight codes in combination with a dictionary design based on Gabor frames. The decoder applies an extension of approximate message passing (AMP) by iteratively exchanging soft information between an AMP module that accounts for the dictionary structure, and a second inference module that utilizes the structure of the involved constant-weight code. We apply the encoding structure to (i) the unsourced random access setting, where all users employ a common dictionary, and (ii) to the “sourced” random access setting with user-specific dictionaries. When applied to a fading scenario, the communication scheme essentially operates non-coherently, as channel state information is required neither at the transmitter nor at the receiver. We observe that in regimes of practical interest, the proposed scheme compares favorably with state-of-the art schemes, in terms of the (per-user) energy-per-bit requirement, as well as the number of active users that can be simultaneously accommodated in the system. Importantly, this is achieved with a considerably smaller size of the transmitted codewords, potentially yielding lower latency and bandwidth occupancy, as well as lower implementation complexity.Keywords
All Related Versions
Funding Information
- Fraunhofer e.V.
- Federal Ministry of Education and Research of Germany in the Program of “Souverän. Digital. Vernetzt” joint Project 6G-RIC (BMBF-16KISK020K)
This publication has 29 references indexed in Scilit:
- Finite-SNR Bounds on the Sum-Rate Capacity of Rayleigh Block-Fading Multiple-Access Channels With No A Priori CSIIEEE Transactions on Communications, 2015
- Many-access channels: The Gaussian case with random user activities2014
- On the convergence of approximate message passing with arbitrary matrices2014
- Fast Sparse Superposition Codes Have Near Exponential Error Probability for $R<{\cal C}$IEEE Transactions on Information Theory, 2013
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matricesProceedings of the National Academy of Sciences, 2012
- Grassmannian frames with applications to coding and communicationApplied and Computational Harmonic Analysis, 2003
- Constant weight codes for multiaccess channels without feedback2003
- Forward collision resolution-a technique for random multiple-access to the adder channelIEEE Transactions on Information Theory, 1993
- A class of codes for a T active users out of N multiple-access communication systemIEEE Transactions on Information Theory, 1990
- Nonrandom binary superimposed codesIEEE Transactions on Information Theory, 1964