Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation

IEEE Transactions on Information Theory

Volumn 47, Issue 2, 2001, Pages 657-670

  Chung, Sae Young ^a,b,c   Richardson, Thomas J ^d,e   Urbanke, Rüdiger L ^d,f  

^a IEEE   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Airvana Inc   (United States)

^d LUCENT TECHNOLOGIES   (United States)

^e QUALCOMM INC   (United States)

^f EPFL   (Switzerland)

Author keywords

Density evolution; Fixed points; Gaussian approximation; Low density parity check (LDPC) codes; Stability; Sum product algorithm; Threshold

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMMUNICATION CHANNELS (INFORMATION THEORY); DATA COMMUNICATION SYSTEMS; DECODING; GAUSSIAN NOISE (ELECTRONIC); TURBO CODES; WHITE NOISE;

GAUSSIAN APPROXIMATION; LOW-DENSITY PARITY-CHECK (LDPC) CODES; SUM-PRODUCT DECODING;

ERROR CORRECTION;

EID: 0035246128     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.910580     Document Type: Article

References (31)

1. Low-density parity-check codes
2. Expander codes
3. Near Shannon limit performance of low-density parity-check codes
4. Good error-correcting codes based on very sparse matrices
5. Analysis of low density codes and improved designs using irregular graphs
6. The capacity of low-density parity-check codes under message-passing decoding
7. Near Shannon limit error-correcting coding and decoding: Turbo-codes
8. On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
9. Practical loss-resilient codes
10. Gaussian approximation for sum-product decoding of low-density parity-check codes
11. Design of capacity-approaching low-density parity-check codes
12. Iterative decoding trajectories of parallel concatenated codes
13. Rate one-half code for approaching the Shannon limit by 0.1 dB
14. Analyzing the turbo decoder using the Gaussian approximation
15. Analyzing the turbo decoder using the Gaussian approximation
16. Low complexity turbo-like codes
17. Turbo factor analysis
18. An analysis of turbo decoding with Gaussian priors
19. Correctness of belief propagation in Gaussian graphical models of arbitrary topology
20. Codes on graphs: Normal realizations
21. An optimum symbol-by-symbol decoding rule for linear codes
22. Replication decoding
23. Iterative decoding of binary block and convolutional codes
24. Irregular repeat-accumulate codes
25. An analysis of belief propagation on the turbo decoding graph with Gaussian densities