A Coupled Compressive Sensing Scheme for Unsourced Multiple Access
- 1 April 2018
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 6628-6632
Abstract
This article introduces a novel paradigm for the unsourced multiple-access communication problem. This divide-and-conquer approach leverages recent advances in compressive sensing and forward error correction to produce a computationally efficient algorithm. Within the proposed framework, every active device first partitions its data into several subblocks, and subsequently adds redundancy using a systematic linear block code. Compressive sensing techniques are then employed to recover sub-blocks, and the original messages are obtained by connecting pieces together using a low-complexity tree-based algorithm. Numerical results suggest that the proposed scheme outperforms other existing practical coding schemes. Measured performance lies approximately 4.3 dB away from the Polyanskiy achievability limit, which is obtained in the absence of complexity constraints.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- A user-independent serial interference cancellation based coding scheme for the unsourced random access Gaussian channel2017
- Low complexity schemes for the random access Gaussian channel2017
- Capacity of Gaussian Many-Access ChannelsIEEE Transactions on Information Theory, 2017
- Coded random access: applying codes on graphs to design random access protocolsIEEE Communications Magazine, 2015
- Convex Optimization2004