Combined Max-Log-MAP and Log-MAP of turbo codes

Electronics Letters

Volumn 40, Issue 4, 2004, Pages 251-252

  Park, S J ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BIT ERROR RATE; COMPUTATIONAL COMPLEXITY; DECODING; ITERATIVE METHODS; PROBABILITY;

DECODING ALGORITHMS; ITERATIVE DECODING;

TURBO CODES;

EID: 1542791465     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:20040181     Document Type: Article

References (5)

1. Berrou, C., Glavieux, A., and Thitimajshima, P.: 'Near Shannon limit error-correction coding and decoding: turbo-codes'. Proc. IEEE Int. Conf. on Communications, Geneva, Switzerland, May 1993, pp. 1064-1070
2. Koch, W., and Baier, A.: 'Optimum and sub-optimum detection of coded data disturbed by time-varying inter-symbol interference'. Proc. IEEE Global Telecommunications Conf, (GLOBECOM'90), San Diego, CA, USA, December 1990, pp. 1679-1684
3. Robertson, P., Villebrun, E., and Hoeher, P.: 'A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain'. Proc. IEEE Int. Conf. on Communications, (ICC'95), Seattle, WA, USA, June 1995, pp. 1009-1013
4. 'Multiplexing and channel coding (FDD)', September 2002, (3GPP TS 25.212 V5.2.0, Release 5)
5. Wu, Y., Woerner, B.D., and Ebel, W.J.: 'A simple stopping criterion for turbo decoding', IEEE Commun. Lett., 2000, 4, pp. 258-260