Time-invariant and switch-type hybrid iterative decoding of low-density parity-check codes

Annales des Telecommunications/Annals of Telecommunications

Volumn 60, Issue 1-2, 2005, Pages 103-131

  Zarrinkhat, Pirouz ^a   Banihashemi, Amir H ^a   Xiao, Hua ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Algorithm convergence; Decoding; Error correcting code; Invariance; Iteration; Mixed method; Parity check; Sparse matrix; Switched mode; Turbo code

Indexed keywords

ALGORITHM CONVERGENCE; ERROR CORRECTION CODE; ITERATION; MIXED METHOD; PARITY CHECK; SPARSE MATRIX; SWITCHED MODE;

ALGORITHMS; ASYMPTOTIC STABILITY; COMPUTER SIMULATION; DECODING; ERROR CORRECTION; INVARIANCE; ITERATIVE METHODS;

TURBO CODES;

EID: 17444369055     PISSN: 00034347     EISSN: 19589395     Source Type: Journal    
DOI: None     Document Type: Article

References (28)

1. st Biennial Symp. Commun. (June 2002), Kingston, ON, Canada, pp. 86-90.
2. th Allerton Conf. Commun., Control, and Computing, Allerton, IL, USA, pp. 1437-1438, October 2002.
3. BERROU (C.), GLAVIEUX (A.), THITIMAJSHIMA (P.), Near Shannon limit error-correcting coding and decoding: Turbo-codes (I). Conf. Rec. Int'l Conf. Commun., pp. 1064-1070, May 1993.
4. "Codes on graphs and iterative algorithms", IEEE Trans. Inform. Theory, 47, n° 2, February 2001.
5. nd Int'l Symp. Turbo Codes & Related Topics, Brest, France, pp. 73-80, September 2000.
6. EL GAMAL (H.), On the theory and applications of space-time and graph based codes. Ph.D. dissertation, Univ. Maryland, College Park, May 2000.
7. GALLAGER (R. G.), Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
8. http://www.eetimes.com/semi/news/OEG20030505S0074
9. LUBY (M. G.), MITZENMACHER (M.), SHOKROLLAHI (M. A.), SPIELMAN (D. A.), Efficient erasure correcting codes, IEEE Trans. Inform. Theory, 47, n° 2, pp. 569-584, February 2001.
10. LUBY (M. G.), MITZENMACHER (M.), SHOKROLLAHI (M. A.), SPIELMAN (D. A.), Improved low-density parity-check codes using irregular graphs. IEEE Trans. Inform. Theory, 47, n° 2, pp. 585-598, February 2001.
11. th IMA Conf. Crypto. Coding, pp. 100-111, December 1995.
12. MARGULIS (G. A.), Explicit constructions of graphs without short cycles and low density codes, Combinatorica, 2, n°1, pp. 71-78, 1982.
13. MASSEY (J. L.), Threshold Decoding. Cambridge, MA: MIT Press, 1963.
14. RICHARDSON (T. J.), SHOKROLLAHI (M. A.), URBANKE (R. L.), Design of capacity-approaching irregular low-density parity-check codes, IEEE Trans. Inform. Theory, 47, n° 2, pp. 619-637, February 2001.
15. RICHARDSON (T. J.), URBANKE (R. L.), The capacity of low-density parity-check codes under message-passing decoding, IEEE Trans. Inform. Theory, 47, n° 2, pp. 599-618, February 2001.
16. th IEEE Symp. Found. Comp. Sci., pp. 566-576, November 1994.
17. TANNER (R. M.), A recursive approach to low complexity codes, IEEE Trans. Inform. Theory, 27, n° 5, pp. 533-547, September 1981.
18. rd IEEE/ITG Conf. Source and Channel Coding, Munich, Germany, pp. 75-80, January 2000.
19. TEN BRINK (S.), Convergence behavior of iteratively decoded parallel concatenated codes, IEEE Trans. Commun., 49, pp.1727-1737, October 2001.
20. "The turbo principle: from theory to practice"; IEEE J. Select. Areas Commun., 19, n° 5, May 2001.
21. "The turbo principle: from theory to practice", IEEE J. Select. Areas Commun., 19, n° 9, September 2001.
22. WIBERG (N.), LOELIGER (H. A.), KOTTER (R.), Codes and iterative decoding on general graphs. Euro. Trans. Telecomm., 6, n° 5, pp. 513-526, September 1995.
23. th Allerton Conf. Commun., Control, and Computing, Allerton, IL, USA, pp. 1425-1434, October 2002.
24. rd Int'l Symp. Turbo Codes & Related Topics, Brest, France, pp. 503-506, September 2003.
25. ZARRINKHAT (P.), BANIHASHEMI (A. H.), Hybrid hard-decision iterative decoding of regular low-density parity-check codes, IEEE Commun. Lett., 8, pp. 250-252, April 2004.
26. ZARRINKHAT (P.), BANIHASHEMI (A. H.), Threshold values and convergence properties of majority-based algorithms for decoding regular low-density parity-check codes, IEEE Trans. Commun., 52, pp. 2087-2097, December 2004.
27. ndlnt'l Symp. Turbo Codes & Related Topics, Brest, France, pp. 39-42, September 2000.
28. ZYABLOV (V. V.), PINSKER (M. S.), Estimation of the error-correction complexity for Gallager low-density codes. Probl. Peredach. Inform., 11, n° 1, pp. 23-26, January-March 1975.