Two-Layer Coded Channel Access With Collision Resolution: Design and Analysis
- 28 August 2020
- journal article
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 19 (12) , 7986-7997
Abstract
We propose a two-layer coding architecture for communication of multiple users over a shared slotted medium enabling joint collision resolution and decoding. Each user first encodes its information bits with an outer code for reliability, and then transmits these coded bits with possible repetitions over transmission time slots of the access channel. The transmission patterns are dictated by the inner collision-resolution code and collisions with other users’ transmissions may occur. We analyze two types of codes for the outer layer: long-blocklength LDPC codes, and short-blocklength algebraic codes. With LDPC codes, a density evolution analysis enables joint optimization of both outer and inner code parameters for maximum throughput. With algebraic codes, we invoke a similar analysis by approximating their average erasure correcting capability while assuming a large number of active transmitters. The proposed low-complexity schemes operate at a significantly smaller gap to capacity than the state of the art. Our schemes apply both to a multiple access scenario where number of users within a frame is known a priori, and to a random access scenario where that number is known only to the decoder. In the latter case, we optimize an outage probability due to the variability in user activity. Index Terms: Random access channel, multiple access channel, LDPC code design, density evolution, adder MAC, erasure, algebraic codes.Keywords
All Related Versions
Funding Information
- National Science Foundation (CCF-1817241)
This publication has 28 references indexed in Scilit:
- Probabilistic Rateless Multiple Access for Machine-to-Machine CommunicationIEEE Transactions on Wireless Communications, 2015
- Coded random access: applying codes on graphs to design random access protocolsIEEE Communications Magazine, 2015
- SCMA for downlink multiple access of 5G wireless networks2014
- Sparse code multiple access2013
- High Throughput Random Access via Codes on Graphs: Coded Slotted ALOHA2011
- Characterization and Optimization of LDPC Codes for the 2-User Gaussian Multiple Access ChannelEURASIP Journal on Wireless Communications and Networking, 2007
- Constraining LDPC degree distributions for improved error floor performanceIEEE Communications Letters, 2006
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- Coding for T-user multiple-access channelsIEEE Transactions on Information Theory, 1979