This paper overviews the recently proposed coded slotted ALOHA (CSA) random access scheme and presents some new results in this topic. In CSA, a linear block code is employed by each user to encode segments of his bursts prior to transmission, and the choice of the code is performed with no coordination with the other users. On the receiver side iterative interference cancellation combined with decoding of the local codes is performed to recover from collisions. This process may be represented as an iterative decoding algorithm over a sparse bipartite graph.
E. Paolini, G. Liva, M. Chiani (2012). Random Access on Graphs: A Survey and New Results. Monterey, CA : A TK Mission Research [10.1109/ACSSC.2012.6489332].
Random Access on Graphs: A Survey and New Results
PAOLINI, ENRICO;CHIANI, MARCO
2012
Abstract
This paper overviews the recently proposed coded slotted ALOHA (CSA) random access scheme and presents some new results in this topic. In CSA, a linear block code is employed by each user to encode segments of his bursts prior to transmission, and the choice of the code is performed with no coordination with the other users. On the receiver side iterative interference cancellation combined with decoding of the local codes is performed to recover from collisions. This process may be represented as an iterative decoding algorithm over a sparse bipartite graph.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
