Efficient implementations of the sum-product algorithm for decoding LDPC codes

Conference Record / IEEE Global Telecommunications Conference

Volumn 2, Issue , 2001, Pages 1036-1036E

  Hu, Xiao Yu ^a   Eleftheriou, Evangelos ^a   Arnold, Dieter Michael ^a   Dholakia, Ajay ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; ERROR CORRECTION; TOPOLOGY; TREES (MATHEMATICS); TRELLIS CODES;

SUM PRODUCT ALGORITHMS (SPA);

DECODING;

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

References (11)

1. Low-density parity-check code
2. Good error-correcting codes based on very sparse matrices
3. On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
4. Decoding low density parity check codes with finite quantization bits
5. Reduced complexity iterative decoding of low density parity check codes based on belief propagation
6. Reduced-complexity decoding algorithm for low-density parity-check codes
7. Gallager codes for CDMA applications - Part II: Implementations, complexity, and system capacity
8. Iterative decoding of binary block and convolutional codes
9. An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes
10. A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain