SPARCs and AMP for Unsourced Random Access
Authors:
- 1 July 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2843-2847
Abstract
This paper studies the optimal achievable performance of compressed sensing based unsourced random-access communication over the real AWGN channel. "Unsourced" means that every user employs the same codebook. This paradigm, recently introduced by Polyanskiy, is a natural consequence of a very large number of potential users of which only a finite number is active in each time slot. The resemblance of compressed sensing based communication and sparse regression codes (SPARCs), a novel type of point-to-point channel codes, allows us to design and analyse an efficient unsourced random-access code. Finite blocklength simulations show that the combination of AMP decoding, with suitable approximations, together with an outer code recently proposed by Amalladinne et. al. outperforms state of the art methods in terms of required energyper-bit at lower decoding complexity.Keywords
This publication has 11 references indexed in Scilit:
- Approximate Message-Passing Decoder and Capacity Achieving Sparse Superposition CodesIEEE Transactions on Information Theory, 2017
- A perspective on massive random-access2017
- Capacity of Gaussian Many-Access ChannelsIEEE Transactions on Information Theory, 2017
- Capacity-Achieving Sparse Superposition Codes via Approximate Message Passing DecodingIEEE Transactions on Information Theory, 2017
- Long-range communications in unlicensed bands: the rising stars in the IoT and smart city scenariosIEEE Wireless Communications, 2016
- Universality in polytope phase transitions and message passing algorithmsThe Annals of Applied Probability, 2015
- Non-negative least squares for high-dimensional linear models: Consistency and sparse recovery without regularizationElectronic Journal of Statistics, 2013
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed SensingIEEE Transactions on Information Theory, 2011
- Randomly Spread CDMA: Asymptotics Via Statistical PhysicsIEEE Transactions on Information Theory, 2005
- Multiple user information theoryProceedings of the IEEE, 1980