Back to Search
Start Over
Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access.
- Source :
-
IEEE Transactions on Information Theory . Dec2015, Vol. 61 Issue 12, p6815-6832. 18p. - Publication Year :
- 2015
-
Abstract
- In this paper, a random access scheme is introduced, which relies on the combination of packet erasure correcting codes and successive interference cancellation (SIC). The scheme is named coded slotted ALOHA. A bipartite graph representation of the SIC process, resembling iterative decoding of generalized low-density parity-check codes over the erasure channel, is exploited to optimize the selection probabilities of the component erasure correcting codes through a density evolution analysis. The capacity (in packets per slot) of the scheme is then analyzed in the context of the collision channel without feedback. Moreover, a capacity bound is developed, and component code distributions tightly approaching the bound are derived. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 61
- Issue :
- 12
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 111152681
- Full Text :
- https://doi.org/10.1109/TIT.2015.2492579