Spatially-coupled random access on graphs

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 478-482

  Liva, Gianluigi ^a   Paolini, Enrico ^b   Lentmaier, Michael ^c   Chiani, Marco ^b  

^a GERMAN AEROSPACE CENTER DLR   (Germany)

^b UNIVERSITY OF BOLOGNA   (Italy)

^c DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS PROTOCOLS; ASYMPTOTIC SETTING; BINARY ERASURE CHANNEL; CONVOLUTIONAL LDPC CODES; DECODING THRESHOLDS; GRAPHICAL MODEL; ITERATIVE INTERFERENCE; LDPC CODES; LOW-DENSITY PARITY-CHECK (LDPC) CODES; MAXIMUM A POSTERIORI; RANDOM ACCESS; RANDOM ACCESS PROTOCOL; RECOVERY PROCESS; SATURATION EFFECTS; SLOTTED ALOHA; SPATIAL COUPLINGS; THEORETICAL LIMITS;

CONVOLUTION; GRAPHIC METHODS; INFORMATION THEORY; ITERATIVE DECODING;

FORWARD ERROR CORRECTION;

EID: 84867544428     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6284235     Document Type: Conference Paper

References (23)

1. N. Abramson, "The ALOHA system - another alternative for computer communications," in Proc. 1970 Fall Joint Computer Conference, vol. 37. AFIPS Press, 1970, pp. 281-285.
2. J. L. Massey and P. Mathys, "The collision channel without feedback," IEEE Trans. Inf. Theory, vol. IT-31, no. 2, pp. 192-204, Mar. 1985.
3. J. Y. N. Hui, "Multiple accessing for the collision channel without feedback," IEEE Trans. Veh. Technol., vol. VT-33, no. 3, pp. 191-198, Aug. 1984.
4. G. Thomas, "Capacity of the wireless packet collision channel without feedback," IEEE Trans. Inf. Theory, vol. 46, no. 3, pp. 1141-1144, May 2000.
5. K. W. Shum, C. S. Chen, C. W. Sung, and W. S. Wong, "Shift-invariant protocol sequences for the collision channel without feedback," IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3312-3322, Jul. 2009.
6. E. Casini, R. D. Gaudenzi, and O. del Rio Herrero, "Contention resolution diversity slotted ALOHA (CRDSA): An enhanced random access scheme for satellite access packet networks." IEEE Trans. Wireless Commun., vol. 6, pp. 1408-1419, Apr. 2007.
7. Y. Yu and G. B. Giannakis, "High-throughput random access using successive interference cancellation in a tree algorithm," IEEE Trans. Inf. Theory, vol. 53, no. 12, pp. 4628-4639, Dec. 2007.
8. G. Liva, "Graph-based analysis and optimization of contention resolution diversity slotted ALOHA," IEEE Trans. Commun., vol. 59, no. 2, pp. 477-487, Feb. 2011.
9. E. Paolini, G. Liva, and M. Chiani, "High throughput random access via codes on graphs: Coded slotted ALOHA," in Proc. 2011 IEEE Int. Conf. Commun., Kyoto, Japan, Jun. 2011.
10. R. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: M.I.T. Press, 1963.
11. T. Richardson and R. Urbanke, "The capacity of low-density paritycheck codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, 2001.
12. E. Paolini, M. Fossorier, and M. Chiani, "Generalized and doubly-generalized LDPC codes with random component codes for the binary erasure channel," IEEE Trans. Inf. Theory, vol. 56, no. 4, pp. 1651-1672, Apr. 2010.
13. E. Paolini, G. Liva, and M. Chiani, "Graph-based random access for the collision channel without feed-back: Capacity bound," in Proc. 2011 IEEE Global Telecommun. Conf., Houston, Texas, Dec. 2011.
14. A. Jimenez Felström and K. Zigangirov, "Time-varying periodic convolutional codes with low-density parity-check matrix," IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 2181 -2191, Sep. 1999.
15. A. Sridharan, M. Lentmaier, D. J. Costello, Jr., and K. S. Zigangirov, "Convergence analysis of a class of LDPC convolutional codes for the erasure channel," in Proc. 42nd Allerton Conf. Commun., Control, and Computing, Monticello, IL, Oct. 2004, pp. 953-962.
16. S. Kudekar, T. Richardson, and R. Urbanke, "Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC," IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 803-834, Feb. 2011.
17. M. Lentmaier and G. P. Fettweis, "On the thresholds of generalized LDPC convolutional codes based on protographs," in Proc. 2010 IEEE Int. Symp. Inf. Theory, Austin, TX, Jun. 2010, pp. 709-713.
18. M. Lentmaier, A. Sridharan, D. Costello, and K. Zigangirov, "Iterative decoding threshold analysis for LDPC convolutional codes," IEEE Trans. Inf. Theory, vol. 56, no. 10, pp. 5274-5289, Oct. 2010.
19. S. Kudekar and H. Pfister, "The effect of spatial coupling on compressive sensing," in Proc. 48th Allerton Conf. Commun., Control, and Computing, Monticello, IL, Oct. 2010, pp. 347-353.
20. S. H. Hassani, N. Macris, and R. Urbanke, "Coupled graphical models and their thresholds," in Proc. 2011 IEEE Information Theory Workshop, Dublin, Ireland, Sep. 2010.
21. D. Truhachev, "Achieving AWGN channel capacity with sparse graph modulation and "in the air" coupling," in Proc. 2012 Inf. Theory Appl. Workshop, San Diego, CA, Feb. 2012.
22. A. Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic information transfer functions: Model and erasure channel properties," IEEE Trans. Inf. Theory, vol. 50, no. 11, pp. 2657-2673, Nov. 2004.
23. C. Measson, A. Montanari, and R. Urbanke, "Maxwell construction: The hidden bridge between iterative and maximum a posteriori decoding," IEEE Trans. Inf. Theory, vol. 54, no. 12, pp. 5277-5307, Dec. 2008.