Nonuniform error correction using low-density parity-check codes

IEEE Transactions on Information Theory

Volumn 51, Issue 7, 2005, Pages 2702-2714

  Pishro Nik, Hossein ^a   Rahnavard, Nazanin ^a   Fekri, Faramarz ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Bipartite graphs; Error floor; Iterative decoding; Low density parity check (LDPC) codes; Nonuniform channels; Punctured codes; Unequal error protection

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; DECODING; ENCODING (SYMBOLS); ERROR CORRECTION; GRAPH THEORY; ITERATIVE METHODS; PROBABILITY DENSITY FUNCTION; SPURIOUS SIGNAL NOISE; THEOREM PROVING;

BIPARTITE GRAPHS; ERROR FLOOR; ITERATIVE DECODING; LOW DENSITY PARITY CHECK (LDPC) CODES; NONUNIFORM CHANNELS; PUNCTURED CODES; UNEQUAL ERROR PROTECTION; VOLUME HOLOGRAPHIC MEMORY;

CODES (SYMBOLS);

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

References (28)

1. H. Pishro-Nik, N. Rahnavard, and F. Fekri, "Nonuniform error correction using low-density parity check codes," in Proc. 40th Annu. Allerton Conf., Monticello, IL, Oct. 2002.
2. H. Pishro-Nik, N. Rahnavard, J. Ha, F. Fekri, and A. Adibi, "Low-density parity-check codes for volume holographic memory systems," Appl. Opt., vol. 42, pp. 861-870, 2003.
3. 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.
4. 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.
5. K. Nakamura, Y. Kabashima, D. Saad, and R. M. Zaragoza, "Statistical mechanics of broadcast channels using low-density parity-check codes," in Proc. 2003 IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 294.
6. J. Hagenauer, "Rate-compatible punctured convolutional codes (rcpc codes) and their applications," IEEE Trans. Commun., vol. 36, no. 4, pp. 389-400, Apr. 1988.
7. J. Hagenauer, "Rate-compatible punctured turbo (rcpt) codes in a hybrid fec/arq system," in Proc. Communications Theory Mini-Conf. of IEEE GLOBECOM '97, Phoenix, AZ, Nov. 1997, pp. 55-59.
8. P. Jung and J. Plechinger, "Performance of rate-compatible punctured turbob codes for mobile radio applications," IEE Electron. Lett., vol. 33, pp. 389-400, 1997.
9. 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.
10. S. Y. Chung, "On the construction of some capacity-approaching coding schemes," Ph.D. dissertation, MIT, Cambridge, MA, 2000.
11. J. Ha and S. McLaughlin, "Rate-compatible puncturing of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 50, no. 11, pp. 2824-2836, Nov. 2004.
12. B. Masnick and J. Wolf, "On linear unequal error protection codes," IEEE Trans. Inf. Theory, vol. IT-13, no. 4, pp. 600-607, Oct. 1967.
13. D. Mandelbaum, "Unequal-error-protection codes dervied from difference sets," IEEE Trans. Inf. Theory, vol. IT-18, pp. 686-687, Sep. 1972.
14. C. C. Kilgus and W. C. Gore, "A class of cyclic unequal error protection codes," IEEE Trans. Inf. Theory, vol. IT-18, no. 5, pp. 687-690, Sep. 1972.
15. I. Boyarinov and G. Katsman, "Linear unequal error protection code," IEEE Trans. Inf. Theory, vol. IT-27, no. 1, pp. 168-175, Jan. 1981.
16. W. Chou and M. A. Neifeld, "Interleaving and error correction in volume holographic memory systems," Appl. Opt., vol. 37, pp. 6951-6968, 1998.
17. S. Y. Chung, T. J. Richardson, and R. L. Urbanke, "Analysis of sumproduct decoding of low-density parity-check codes using a Gaussian approximation," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 657-670, Feb. 2001.
18. H. Pishro-Nik and F. Fekri, "On decoding of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol. 50, no. 3, pp. 439-454, Mar. 2004.
19. M. A. Shokrollahi, Codes, Systems, and Graphical Models. New York: Springer-Verlag, 2001, ch. Capacity-achieving sequences, pp. 153-166.
20. J. Justesen, "Coding for frames," in Proc. 40th Annual Allerton Conference, Monticello, IL, Oct. 2002.
21. M. Luby, M. Mitzenmacher, M. Shokrollahi, and D. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
22. M. Luby, M. Mitzenmacher, M. Shokrollahi, and D. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
23. C. Di, D. Proietti, I. E. Telatar, T. Richardson, and R. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1570-1579, Jun. 2002.
24. C. Di, T. Richardson, and R. Urbanke, "Weight distributions: How deviant can you be?," in Proc. 2001 IEEE Int. Symp. Information Theory, Washington, DC, 2001, p. 50.
25. T. Richardson, A. Shokrollahi, and R. Urbanke, "Finite-length analysis of low-density parity-check ensembles for the binary erasure channel," in Proc. 2002 IEEE Int. Symp. Information Theory, Lausanne, Switzerland, 2002, p. l.
26. P. Oswald and M. A. Shokrollahi, "Capacity-achieving sequences for the erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 12, pp. 3017-3028, Dec. 2002.
27. R. Urbanke. Report. [Online]. Available: http://lthcwww.epfl.ch/ research/ldpcopt/
28. T. H. Cormen, C. E. Leiserson, and C. S. R. L. Rivest, Introduction to Algorithms, 2nd ed. Cambridge, MA: MIT Press, 2001.