A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution

Conference Record / IEEE Global Telecommunications Conference

Volumn 2, Issue , 2001, Pages 1021-1025

  Anastasopoulos, Achilleas ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; DECODING; ITERATIVE METHODS; SIGNAL TO NOISE RATIO;

ITERATIVE DECODERS; LOW-DENSITY PARITY-CHECK (LDPC) CODES;

BINARY CODES;

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

References (10)

1. Near Shannon limit error-correcting coding and decoding: Turbo-codes
2. Low density parity check codes
3. Coding theorems for turbo-like codes
4. The capacity of low-density parity-check codes under message-passing decoding
5. Soft-output decoding algorithms for continuous decoding of parallel concatenated convolutional codes
6. Factor graphs and the sum-product algorithm
7. Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
8. On the design of of low-density parity-check codes within 0.0045 dB of the Shannon limit
9. Design of capacity-approaching irregular low-density parity, check codes