Spatially coupled sparse codes on graphs: Theory and practice

IEEE Communications Magazine

Volumn 52, Issue 7, 2014, Pages 168-176

  Costello Jr , Daniel J ^a   Dolecek, Lara ^b   Fuja, Thomas E ^a   Kliewer, Jörg ^c   Mitchell, David G M ^a   Smarandache, Roxana ^a  

^a UNIVERSITY OF NOTRE DAME   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TELEVISION BROADCASTING;

CHANNEL CONDITIONS; CODING TECHNIQUES; DEEP SPACE COMMUNICATIONS; ENCODING AND DECODING; IMPLEMENTATION COMPLEXITY; LOW-DENSITY PARITY-CHECK CODES; MOBILE TRANSMISSION; THEORY AND PRACTICE;

CODES (SYMBOLS);

EID: 84904640976     PISSN: 01636804     EISSN: None     Source Type: Journal    
DOI: 10.1109/MCOM.2014.6852099     Document Type: Article

References (15)

1. C. E. Shannon, "A Mathematical Theory of Communication, " Bell Sys. Tech. J., vol. 27, Oct. 1948, pp. 379-423.
2. R. G. Gallager, "Low-Density Parity-Check Codes, " IRE Trans. Info. Theory, vol. 8, no. 1, Jan. 1962, pp. 21-28.
3. M. G. Luby et al., "Improved Low-Density Parity-Check Codes using Irregular Graphs, " IEEE Trans. Info. Theory, vol. 47, no. 2, Feb. 2001, pp. 585-98. (Pubitemid 32318091)
4. T. J. Richardson and R. L. Urbanke, Modern Coding Theory, Cambridge Univ. Press, 2008.
5. A. Jiménez Felström and K. Sh. Zigangirov, "Time-Varying Periodic Convolutional Codes with Low-Density Parity-Check Matrices, " IEEE Trans. Info. Theory, vol. 45, no. 6, Sept. 1999, pp. 2181-91.
6. A. E. Pusane et al., "Deriving Good LDPC Convolutional Codes from LDPC Block Codes, " IEEE Trans. Info. Theory, vol. 57, no. 2, Feb. 2011, pp. 835-57.
7. M. Lentmaier et al., "Iterative Decoding Threshold Analysis for LDPC Convolutional Codes, " IEEE Trans. Inf. Theory, vol. 56, no. 10, Oct. 2010, pp. 5274-89.
8. S. Kudekar, T. J. Richardson, and R. L. Urbanke, "Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well Over the BEC, " IEEE Trans. Info. Theory, vol. 57, no. 2, Feb. 2011, pp. 803-34.
9. D. Divsalar et al., "Capacity-Approaching Protograph Codes, " IEEE JSAC, vol. 27, no. 6, Aug. 2009, pp. 876-88.
10. M. Lentmaier et al., "Asymptotically Good LDPC Convolutional Codes with AWGN Channel Thresholds Close to the Shannon Limit, " Proc. 6th Int'l. Symp. Turbo Codes and Iterative Info. Processing, Brest, France, Sept. 2010, pp. 334-38.
11. J. Thorpe, "Low-Density Parity-Check (LDPC) Codes Constructed from Protographs, " Jet Propulsion Lab, Pasadena, CA, INP Progress Report 42-154, Aug. 2003.
12. A. R. Iyengar et al., "Windowed Decoding of Protograph-Based LDPC Convolutional Codes over Erasure Channels, " IEEE Trans. Info. Theory, vol. 58, no. 4, Apr. 2012, pp. 2303-20.
13. M. Lentmaier, M. M. Prenda, and G. Fettweis, "Efficient Message Passing Scheduling for Terminated LDPC Convolutional Codes, " Proc. IEEE Int'l. Symp. Info. Theory, St. Petersburg, Russia, Aug. 2011, pp. 1826-30.
14. S. Kudekar, T. Richardson, and R. Urbanke, "Spatially Coupled Ensembles Universally Achieve Capacity under Belief Propagation, " IEEE Trans. Info. Theory, vol. 59, no. 12, Dec. 2013, pp. 7761-7813.
15. S. Kumar et al., "A Proof of Threshold Saturation for Spatially-Coupled LDPC Codes on BMS Channels, " Proc. 50th Annual Allerton Conf., Monticello, IL, Oct. 2012, pp. 176-84.