Optimized low-density parity-check codes for partial response channels

IEEE Communications Letters

Volumn 7, Issue 4, 2003, Pages 168-170

  Varnica, Nedeljko ^a   Kavčić, Aleksandar ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Density evolution; Independent and uniformly distributed (i.u.d.) channel capacity; Low density parity check (LDPC) codes; Partial response channels

Indexed keywords

ALGORITHMS; BIT ERROR RATE; CHANNEL CAPACITY; COMPUTER SIMULATION; OPTIMIZATION; PROBABILITY DENSITY FUNCTION; SIGNAL TO NOISE RATIO;

DENSITY EVOLUTION; INDEPENDENT AND UNIFORMLY DISTRIBUTED CHANNEL CAPACITY; LOW-DENSITY PARITY-CHECK CODES; PARTIAL RESPONSE CHANNELS;

ERROR CORRECTION;

EID: 0038735564     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2003.810000     Document Type: Article

References (10)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes," in Proc. IEEE Int. Conf. on Communications, Geneva, Switzerland, May 1993, pp. 1064-1070.
2. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low-density parity-check codes," Electron. Lett., vol. 32, pp. 1645-1646, 1996.
3. M. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1962.
4. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Improved low density parity check codes using irregular graphs and belief propagation," in Proc. IEEE Int. Symp. Inform. Theory, Cambridge, MA, Aug. 1998, pp. 117.
5. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
6. S.-Y. Chung, G. D. Forney Jr., T. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEE Commun. Lett., vol. 47, pp. 58-60, Feb. 2001.
7. A. Kavčić, X. Ma, and M. Mitzenmacher, "Binary intersymbol interference channels: Gallager codes, density evolution and code performance bounds," IEEE Trans. Inform. Theory, to be published.
8. D. Arnold and H.-A. Loeliger, "On the information rate of binary-input channels with memory," in Proc. IEEE ICC 2001, Helsinki, Finland, June 2001, pp. 2692-2695.
9. H. D. Pfister, J. B. Soriaga, and P. H. Siegel, "On the achievable information rates of finite state ISI channels," in Proc. IEEE Global Communications Conf. 2001, San Antonio, TX, Nov. 2001, pp. 2992-2996.
10. X. Ma, N. Varnica, and A. Kavčić, "Matched information rate codes for binary ISI channels," in Proc. Int. Symp. on Information Theory, Laussane, Switzerland, July 2002, p. 269.