Improved weighted bit-flipping algorithm for decoding LDPC codes

IEE Proceedings: Communications

Volumn 152, Issue 6, 2005, Pages 919-922

  Shan, M ^a   Zhao, C M ^a   Jiang, M ^a  

^a SOUTHEAST UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER SIMULATION; ENCODING (SYMBOLS); MATRIX ALGEBRA;

BIT-FLAPPING ALGORITHMS; LDPC CODES; WEIGHTED BIT-FLIPPING (WBF);

DECODING;

EID: 29144494129     PISSN: 13502425     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1049/ip-com:20045118     Document Type: Conference Paper

References (7)

1. Gallager, R.G.: 'Low density parity check codes', IRE Trans. Inf. Theory. 1962, 8, pp. 21-28
2. MacKay, D.J.C., and Neal, R.M.: 'Near Shannon limit performance of low density parity check codes', Electron, Lett., 1996, 32, pp. 1645-1646
3. MacKay, D.J.C.: 'Good error-correcting codes based on very sparse matrices', IEEE Trans. Inf. Theory, 1999, 45, pp. 399-432
4. Richardson, T., Shokrollahi, A., and Urbanke, R.: 'Design of capacity-approaching low density parity check codes'. IEEE Trans. Inf. Theory, 2001, 47, pp. 619-637
5. Richardson, T., and Urbanke, R.: "The capacity of low-density parity-check codes under messagepassing decoding', IEEE Trans. Inf. Theory, 2001, 47, pp. 599-618
6. Kou, Y., Lin, S., and Fossorier, M.: 'Low density parity check codes based on finite geometries: a rediscovery and more", IEEE Trans. Inf. Theory, 2001, 47, pp. 2711-2736
7. Liu, Z., and Pados, D.A.: 'Low complexity decoding of finite geometry LDPC codes', Communications, 2003, 4, pp. 2713-2717