Methodologies for designing LDPC codes using protographs and circulants

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 238-

  Thorpe, Jeremy ^a   Andrews, Kenneth ^a   Dolinar, Sam ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DENSITY EVOLUTION; PROGRESSIVE EDGE GROWTH (PEG); PROTOGRAPHS; VARIABLE NODES;

ALGORITHMS; APPROXIMATION THEORY; DECODING; ENCODING (SYMBOLS); MATRIX ALGEBRA; SIMULATED ANNEALING;

CODES (SYMBOLS);

EID: 5044252858     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. J. Thorpe, "Low-Density Parity-Check Codes Constructed from Protographs", IPN Progress Report 42-154, JPL, Aug. 2003.
2. T. Richardson and V. Novichkov, Methods and apparatus for decoding LDPC codes, United States Patent 6,633,856.
3. S. Y. Chung, On the Construction of Some Capacity-Approaching Coding Schemes, PhD thesis, MIT, Sept. 2000.
4. A. Abbasfar, D. Divsalar, and K. Yao, Accumulate Repeat Accumulate Codes, ISIT 2004.
5. Hu, Eleftheriou, and Arnold, "Progressive Edge-Growth Tanner Graphs", IEEE Globecom 3001, pp. 995-1001, Nov. 2001.
6. J. Lee et al, A Scalable Architecture of a Structured LDPC Decoder, ISIT 2004.