Low complexity schemes for the random access Gaussian channel
Authors:
Top Cited Papers
- 1 June 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2528-2532
Abstract
We consider an uncoordinated Gaussian multiple access channel with a relatively large number of active users within each block. A low complexity coding scheme is proposed, which is based on a combination of compute-and-forward and coding for a binary adder channel. For a wide regime of parameters of practical interest, the energy-per-bit required by each user in the proposed scheme is significantly smaller than that required by popular solutions such as slotted-ALOHA and treating interference as noise.Keywords
This publication has 12 references indexed in Scilit:
- Low complexity schemes for the random access Gaussian channel2017
- A perspective on massive random-access2017
- Coded compressive sensing: A compute-and-recover approach2016
- Sign-compute-resolve for random access2014
- Compute-and-Forward: Harnessing Interference Through Structured CodesIEEE Transactions on Information Theory, 2011
- Graph-Based Analysis and Optimization of Contention Resolution Diversity Slotted ALOHAIEEE Transactions on Communications, 2010
- Channel Coding Rate in the Finite Blocklength RegimeIEEE Transactions on Information Theory, 2010
- Superimposed codes in the Hamming spaceIEEE Transactions on Information Theory, 1994
- Forward collision resolution-a technique for random multiple-access to the adder channelIEEE Transactions on Information Theory, 1993
- How to encode the modulo-two sum of binary sources (Corresp.)IEEE Transactions on Information Theory, 1979