Analysis of scaling soft information on low density parity check code

Electronics Letters

Volumn 39, Issue 2, 2003, Pages 219-221

  Heo, Jun ^a  

^a University of Southern California ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; DECODING; ITERATIVE METHODS; PROBABILITY DENSITY FUNCTION;

GAUSSIAN APPROXIMATION; ITERATIVE DECODING; LOG LIKELIHOOD RATIO; LOW DENSITY PARITY CHECK CODE; MIN-SUM DENSITY EVOLUTION; OPTIMAL SCALING FACTOR; SUM-PRODUCT ALGORITHM;

CODES (SYMBOLS);

EID: 0037461893     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:20030169     Document Type: Article

References (5)

1. Richardson, T.J., and Urbanke, R.L.: 'The capacity of low-density parity-check codes under message-passing decoding', IEEE Trans. Inf. Theory, 2001, 47, pp. 599-618
2. Chung, S.Y., Richardson, T.J., and Urbanke, R.L.: 'Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation', IEEE Trans. Inf. Theory, 2001, 47, pp. 657-670
3. Anastasopoulos, A.: 'A comparison between the sum-product the minsum iterative detection algorithms based on density evolution'. GLOBECOM, San Antonio, TX, USA, November 2001
4. Wei, X., and Akansu, A.N.: 'Density evolution for low-density parity-check codes under max-log-MAP decoding', Electron. Lett., 2001, 37, pp. 1125-1126
5. Colavolpe, G., Ferrari, G., and Raheli, R.: 'Extrinsic information in iterative decoding: a unified view', IEEE Trans. Commun., 2001, 49, (12), pp. 2088-2094