Windowed decoding of protograph-based LDPC convolutional codes over erasure channels

IEEE Transactions on Information Theory

Volumn 58, Issue 4, 2012, Pages 2303-2320

  Iyengar, Aravind R ^a   Papaleo, Marco ^b   Siegel, Paul H ^a   Wolf, Jack Keil ^a   Vanelli Coralli, Alessandro ^c   Corazza, Giovanni E ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b QUALCOMM INC   (United States)

^c UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Belief propagation; convolutional codes; decoding thresholds; erasure channels; iterative decoding; low density parity check codes; stopping sets; windowed decoding

Indexed keywords

BELIEF PROPAGATION; DECODING THRESHOLDS; ERASURE CHANNELS; LOW-DENSITY PARITY-CHECK (LDPC) CODES; STOPPING SET;

BACKPROPAGATION; ITERATIVE DECODING;

CONVOLUTIONAL CODES;

EID: 84858973474     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2177439     Document Type: Article

References (42)

1. M. Papaleo, A. R. Iyengar, P. H. Siegel, J. K. Wolf, and G. Corazza, "Windowed erasure decoding of LDPC convolutional codes," in Proc. IEEE Inf. Theory Workshop, Cairo, Egypt, Jan. 2010, pp. 78-82.
2. A. R. Iyengar, M. Papaleo, G. Liva, P. H. Siegel, J. K.Wolf, and G. E. Corazza, "Protograph-based LDPC convolutional codes for correlated erasure channels," in Proc. IEEE Int. Conf. Commun., Cape Town, South Africa, May 2010, pp. 1-6.
3. G. E. Corazza, A. R. Iyengar, M. Papaleo, P. H. Siegel, A. Vanelli- Coralli, and J. K.Wolf, "Latency constrained protograph-based LDPCCC," in Proc. 6th Int. Symp. Turbo Codes Iterative Inf. Process., Brest, France, Sep. 2010, pp. 6-10.
4. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
5. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Francisco, CA: Morgan Kaufmann, 1988.
6. N.Wiberg, "Codes and decoding on general graphs," Ph.D., Linkoping University, Linkoping, Sweden, 1996.
7. D.MacKay and R. Neal, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 33, no. 6, pp. 457-458, Mar. 1997. (Pubitemid 127587405)
8. A. J. Felstrom 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. (Pubitemid 32077655)
9. M. Lentmaier, G. P. Fettweis, K. S. Zigangirov, and D. J. Costello, "Approaching capacity with asymptotically regular LDPC codes," in Proc. Inf. Theory Appl., San Diego, CA, 2009.
10. S. Kudekar, T. Richardson, and R. L. Urbanke, "Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC," CoRR, vol. abs/1001.1826, 2010.
11. T. Richardson and R. Urbanke, Modern Coding Theory. NewYork: Cambridge Univ. Press, 2008.
12. G. Liva, private communication, 2008.
13. M. Lentmaier, A. Sridharan, K. S. Zigangirov, and D. J. Costello, "Terminated LDPC convolutional codes with thresholds close to capacity," in Proc. IEEE Int. Symp. Inf. Theory, Sep. 4-9, 2005, pp. 1372-1376. (Pubitemid 44508266)
14. M. Lentmaier, A. Sridharan, D. J. Costello, and K. S. Zigangirov, "Iterative decoding threshold analysis for LDPC convolutional codes," IEEE Trans. Inf. Theory, vol. 56, no. 10, pp. 5274-5289, Oct. 2010.
15. A. Pusane, A. J. Feltstrom, A. Sridharan, M. Lentmaier, K. Zigangirov, and D. J. Costello, "Implementation aspects of LDPC convolutional codes," IEEE Trans. Commun., vol. 56, no. 7, pp. 1060-1069, Jul. 2008.
16. A. Sridharan, "Design and analysis of LDPC convolutional codes," Ph.D. dissertation, Univ. Notre Dame, Notre Dame, IN, 2005.
17. J. Thorpe, "Low-density parity-check (LDPC) codes constructed from protographs," JPL INP, Tech. Rep., 2003.
18. A. Sridharan, D. V. Truhachev, M. Lentmaier, D. J. Costello, and K. S. Zigangirov, "Distance bounds for an ensemble of LDPC convolutional codes," IEEE Trans. Inf. Theory, vol. 53, no. 12, pp. 4537-4555, Dec. 2007.
19. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
20. M. Luby, M. Mitzenmacher, M. Shokrollahi, and D. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001. (Pubitemid 32318090)
21. M. Luby, M. Mitzenmacher, M. Shokrollahi, and D. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001. (Pubitemid 32318091)
22. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001. (Pubitemid 32318092)
23. T. Richardson and R. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001. (Pubitemid 32318094)
24. G. Liva and M. Chiani, "Protograph LDPC codes design based on EXIT analysis," in Proc. IEEE Globecom, Washington, DC, Nov. 27-30, 2007, pp. 3250-3254. (Pubitemid 351259601)
25. C. Di, D. Proietti, I. Telatar, T. Richardson, and R. Urbanke, "Finitelength analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1570-1579, Jun. 2002. (Pubitemid 34759861)
26. J. Han and P. H. Siegel, "Improved upper bounds on stopping redundancy," IEEE Trans. Inf. Theory, vol. 53, no. 1, pp. 90-104, Jan. 2007. (Pubitemid 46056065)
27. D. Divsalar, S. Dolinar, and C. Jones, "Protograph LDPC codes over burst erasure channels," JPL INP, Tech. Rep., 2006.
28. M. Lentmaier, D. G. M. Mitchell, G. P. Fettweis, and D. J. Costello, "Asymptotically regular LDPC codes with linear distance growth and thresholds close to capacity," in Proc. Inf. Theory Appl. 2010, San Diego, CA.
29. B. K. Butler and P. H. Siegel, "On distance properties of quasi-cyclic protograph-based LDPC codes," in Proc. IEEE Int. Symp. Inf. Theory, Austin, TX, Jun. 13-18, 2010, pp. 809-813.
30. X.-Y. Hu, E. Eleftheriou, and D. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386-398, Jan. 2005. (Pubitemid 40151893)
31. T. Tian, C. Jones, J. Villasenor, and R. Wesel, "Selective avoidance of cycles in irregular LDPC code construction," IEEE Trans. Commun., vol. 52, no. 8, pp. 1242-1247, Aug. 2004.
32. E. Gilbert, "Capacity of a burst-noise channel," Bell Syst. Tech. J., vol. 39, pp. 1253-1265, Sep. 1960.
33. E. Elliott, "Estimates of error rates for codes on burst-noise channels," Bell Syst. Tech. J., vol. 42, pp. 1977-1997, Sep. 1963.
34. L. Wilhelmsson and L. B. Milstein, "On the effect of imperfect interleaving for the Gilbert-Elliott channel," IEEE Trans. Commun., vol. 47, no. 5, pp. 681-688, May 1999.
35. M. Yang andW. E. Ryan, "Design of LDPC codes for two-state fading channel models," in Proc. 5th Int. Symp. Wireless Pers. Multimedia Commun., Oct. 2002, vol. 3, pp. 986-990.
36. S. J. Johnson and T. Pollock, "LDPC codes for the classic bursty channel," in Proc. IEEE Int. Symp. Inf. Theory, Aug. 2004, pp. 184-189.
37. E. Paolini and M. Chiani, "Improved low-density parity-check codes for burst erasure channels," in Proc. IEEE Int. Conf. Commun., Istanbul, Turkey, Jun. 2006, pp. 1183-1188. (Pubitemid 351575471)
38. G. Liva, B. Matuz, Z. Katona, E. Paolini, andM. Chiani, "On construction ofmoderate-length LDPC codes over correlated erasure channels," in Proc. IEEE Int. Conf. Commun., Dresden, Germany, Jun. 2009, pp. 1-5.
39. G. Sridharan, A. Kumarasubramanian, A. Thangaraj, and S. Bhashyam, "Optimizing burst erasure correction of LDPC codes by interleaving," in Proc. IEEE Int. Symp. Inf. Theory, Jul. 2008, pp. 1143-1147.
40. S. J. Johnson, "Burst erasure correcting LDPC codes," IEEE Trans. Commun., vol. 57, no. 3, pp. 641-652, Mar. 2009.
41. E. Paolini andM. Chiani, "Construction of near-optimum burst erasure correcting low-density parity-check codes," IEEE Trans. Commun., vol. 57, no. 5, pp. 1320-1328, May 2009.
42. T.Wadayama, "Ensemble analysis on minimum span of stopping sets," in Proc. Inf. Theory Appl. 2006, San Diego, CA.