CRIS Current Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishThis 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.
| Titolo: | Random Access on Graphs: A Survey and New Results |
| Autore/i: | PAOLINI, ENRICO; G. Liva; CHIANI, MARCO |
| Autore/i Unibo: | |
| Anno: | 2012 |
| Titolo del libro: | Proceedings of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR 2012) |
| Pagina iniziale: | 1743 |
| Pagina finale: | 1747 |
| Digital Object Identifier (DOI): | http://dx.doi.org/10.1109/ACSSC.2012.6489332 |
| 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. |
| Data prodotto definitivo in UGOV: | 26-giu-2013 |
| Appare nelle tipologie: | 4.01 Contributo in Atti di convegno |
File in questo prodotto:
http://hdl.handle.net/11585/130288
Copyright © 2021