A trellis-based method for removing cycles from bipartite graphs and construction of low density parity check codes

IEEE Communications Letters

Volumn 8, Issue 7, 2004, Pages 443-445

  Lan, L ^a   Tai, Y Y ^a   Chen, L ^a   Lin, S ^a   Abdel Ghaffar, K ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIT ERROR RATE; COMMUNICATION CHANNELS (INFORMATION THEORY); DATA COMMUNICATION SYSTEMS; DECODING; ERROR CORRECTION; GRAPH THEORY; ITERATIVE METHODS; PHASE SHIFT KEYING; SET THEORY; SIGNAL ENCODING; WHITE NOISE;

BIPARTITE GRAPHS; LOW DENSITY PARITY CHECK CODES; TANNER GRAPH;

TRELLIS CODES;

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

References (9)

1. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
2. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. 27, pp. 533-547, Sept 1981.
3. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-432, Mar. 1999.
4. T. J. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
5. D. B. West, Introduction to Graph Theory, 2nd ed. Upper Saddle River, NJ: Prentice Hall, 1996.
6. S. Lin, T. Kasami, T. Fujiwara, and M. Fossorier, Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes. Boston, MA: Kluwer Academic, 1998.
7. S. Lin and D. J. Costello Jr., Error Control Coding: Fundamentals and Applications, 2nd ed. Upper Saddle River, NJ: Prentice Hall, 2004.
8. L. Chen, J. Xu, I. Djurdjevic, and S. Lin, "Near Shannon limit quasicyclic low-density parity-check codes," IEEE Trans. Commun., vol. 52, July 2004, to be published.
9. X.-Y. Hu, E. Eleftheriou, and D.-M. Arnold, "Progressive edge-growth tanner graphs," in Proc. IEEE GLOBECOM, San Antonio, TX, Nov. 2001.