Coded random access design for constrained outage
- Creators
- Ebrahimi, MohammadReza
Abstract
he emergence of networks of many devices in the context of cyber-physical systems motivates novel solutions for communication over random access channels. Currently deployed random access protocols attempt to avoid collisions, and target the performance of a scheduled multiple access system (a strategy known to be only suboptimal from the information-theoretic perspective). In contrast, in this paper, we allow collisions among the transmissions of different users. We consider code design for random access channels with erasures in which the number of users in each frame is unknown at the transmitters but known at the receiver, and we present a two-layer coding architecture for joint contention resolution and erasure correction. For random LDPC codes based on this scheme, the density evolution is asymptotically analyzed, which enables optimized code design for maximized throughput with constrained outage. The results demonstrate that the proposed low-complexity scheme approaches the outage capacity of the random access channel with erasures when the average number of active users is small.
Additional Information
© 2017 IEEE.Additional details
- Eprint ID
- 80538
- DOI
- 10.1109/ISIT.2017.8007026
- Resolver ID
- CaltechAUTHORS:20170816-171504161
- Created
-
2017-08-17Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field