Improved bit-flipping decoding of low-density parity-check codes

IEEE Transactions on Information Theory

Volumn 51, Issue 4, 2005, Pages 1594-1606

  Miladinovic, Nenad ^a   Fossorier, Marc P C ^a  

^a University of Hawaii at Manoa   (United States)

Author keywords

Bit flipping; Iterative decoding; Low density parity check (LDPC) codes

Indexed keywords

ALGORITHMS; BIT ERROR RATE; COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; DECODING; ITERATIVE METHODS; PROBABILITY; SIGNAL TO NOISE RATIO;

BIT ERROR PROBABILITY; BIT FLIPPING; ITERATIVE DECODING; LOW DENSITY PARITY CHECK (LDPC) CODES;

CODES (SYMBOLS);

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

References (18)

1. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
2. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inf. Theory, vol. IT-8, no. 1, pp. 21-28, Jan. 1962.
3. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 32, no. 18, pp. 1645-1646, 1996.
4. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
5. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching low-density parity check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
6. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and R. D. Spielman, "Impeoved low-density parity-check codes using irregular graphs and belief propagation," in Proc. 1998 IEEE Int. Symp. Information Theory, Cambridge, MA, Aug. 1998, p. 171.
7. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 6, pp. 533-547, Sep. 1981.
8. R. Lucas, M. P. C. Fossorier, Y. Kou, and S. Lin, "Iterative decoding of one-step majority logic decodable codes based on belief propagation," IEEE Trans. Commun., vol. 48, no. 6, pp. 931-937, Jun. 2000.
9. Y. Kou, S. Lin, and M. Fossorier, "Low density parity check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
10. A. M. Chan and F. R. Kschischang, "A simple taboo-based soft-decision decoding algorithm for expander codes," IEEE Commun. Lett., vol. 2, no. 7, pp. 183-185, Jul. 1998.
11. J. Zhang and M. P. C. Fossorier, "A modified weighted bit-flipping decoding of low-density parity check codes," IEEE Commun. Lett., vol. 8, no. 3, pp. 165-167, Mar. 2004.
12. A. Nouh and A. Banihashemi, "Bootstrap decoding of low-density parity check codes," IEEE Commun. Lett., vol. 6, no. 9, pp. 391-393, Sep. 2002.
13. Z. Liu and D. Pados, "Low complexity decoding of finite geometry LDPC codes," IEEE Trans. Commun., to be published.
14. Y. Mao and A. Banihashemi, "Decoding low density parity check codes with probabilistic scheduling," IEEE Commun. Lett., vol. 5, no. 10, pp. 414-416, Oct. 2001.
15. M. Mihaljevic and J. Golic, "A method for convergence analysis of iterative probabilistic decoding," IEEE Trans. Inf. Theory, vol. 46, no. 6, pp. 2206-2211, Sep. 2000.
16. N. Miladinovic, "Iterative decoding of LDPC and GLDPC codes on BSC," Ph.D. dissertation, Dept. Elec. Eng., Univ. Hawaii at Manoa,, 2005, to be published.
17. X. Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth tanner graphs," in Proc. 2001 Global. Telecommun. Conf., vol. 2, San Antonio, TX, Nov. 2001, pp. 995-1001.
18. R. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.