Hybrid hard-decision iterative decoding of irregular low-density parity-check codes

IEEE Transactions on Communications

Volumn 55, Issue 2, 2007, Pages 292-302

  Zarrinkhat, Pirouz ^a,b   Banihashemi, Amir H ^a  

^a CARLETON UNIVERSITY   (Canada)

^b Airvana Inc   (United States)

Author keywords

Density evolution (DE); Hybrid decoding; Irregular low density parity check (LDPC) codes; Iterative coding schemes; Message passing decoding algorithms

Indexed keywords

ALGORITHMS; ASYMPTOTIC ANALYSIS; BINARY CODES; ERRORS; MESSAGE PASSING; PROBABILITY;

DENSITY EVOLUTION (DE); HYBRID DECODING; IRREGULAR LOW-DENSITY PARITY-CHECK (LDPC) CODES; MESSAGE-PASSING DECODING ALGORITHMS;

ITERATIVE DECODING;

EID: 33947610408     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2006.888584     Document Type: Article

References (15)

1. M. Ardakani and F. R. Kschischang, "Gear-shift decoding for algorithms with varying complexity," in Proc. IEEE Int. Conf. Commun., Seoul, South Korea, May 2005, vol. 1, pp. 500-504.
2. M. Ardakani and F. R. Kschischang, "Properties of optimum binary message-passing decoders," IEEE Trans. Inf. Theory, vol. 51, no. 10, pp. 3658-3665, Oct. 2005.
3. L. Bazzi, T. J. Richardson, and R. L. Urbanke, "Exact thresholds and optimal codes for the binary-symmetric channel and Gallager's decoding algorithm A," IEEE Trans. Inf. Theory, vol. 50, no. 9, pp. 2010-2021, Sep. 2004.
4. S.-Y. Chung, "On the construction of some capacity-approaching coding schemes," Ph.D. dissertation, Mass. Inst. Technol., Cambridge, 2000.
5. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
6. Y. Kou, S. Lin, and M. P. C. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inf. Theory, vol. 47, no. 11, pp. 2711-2736, Nov. 2001.
7. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
8. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
9. T. J. Richardson and R. L. 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.
10. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
11. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
12. S. ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Commun., vol. 49, no. 10, pp. 1727-1737, Oct. 2001.
13. P. Zarrinkhat and A. H. Banihashemi, "Hybrid hard-decision iterative decoding of regular low-density parity-check codes," IEEE Commun. Lett., vol. 8, no. 4, pp. 250-252, Apr. 2004.
14. P. Zarrinkhat, A. H. Banihashemi, and H. Xiao, "Time-invariant and switch-type hybrid iterative decoding of low-density parity-check codes," Ann. Télécommun./Ann. Telecommun., vol. 60, no. 1-2, pp. 103-131, Jan.-Feb. 2005.
15. P. Zarrinkhat and A. H. Banihashemi, "Threshold values and convergence properties of majority-based algorithms for decoding regular low-density parity-check codes," IEEE Trans. Commun., vol. 52, no. 12, pp. 2087-2097, Dec. 2004.