Decoding low density parity check codes with finite quantization bits

IEEE Communications Letters

Volumn 4, Issue 2, 2000, Pages 62-64

  Ping, Li ^a   Leung, W K ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVOLUTIONAL CODES; ERROR CORRECTION; SIGNAL ENCODING;

FINITE QUANTIZATION BITS; PARITY CHECK CODES; SUM-PRODUCT ALGORITHM (SPA);

MOBILE RADIO SYSTEMS;

EID: 0033882386     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/4234.824757     Document Type: Article

References (7)

1. R. G. Gallager, "Low density parity check codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, 1962.
2. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 33, no. 6, pp. 457-458, 1997.
3. D. J. C. MacKay. Good error-correcting codes based on very sparse matrices. [Online] Available: ftp://wol.ra.phy.cam.ac.uk/pub/www/ mackay/mncN.ps.gz
4. L. Ping, "Modified turbo codes with low decoding complexity," Electron. Lett., vol. 34, no. 23, pp. 2228-2229, 1998.
5. B. Sklar, Digital Communications Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall.
6. T. Richardson and R. Urbanke. The capacity of low-density parity check codes under message-passing decoding. [Online] Available: http://cm.bell-labs.com/cm/ms/who/tjr/pub.html
7. D. Divalar and F. Pollara, "Multiple turbo codes," in Proc. IEEE Milcom'95, 1995, pp. 279-285.