Browse > Article

Performance Analysis on Various Design Issues of Turbo Decoder  

Park Taegeun (가톨릭대학교 정보통신전자공학부)
Kim Kiwhan (가톨릭대학교 컴퓨터공학과)
Abstract
Turbo decoder inherently requires large memory and intensive hardware complexity due to iterative decoding, despite of excellent decoding efficiency. To decrease the memory space and reduce hardware complexity, various design issues have to be discussed. In this paper, various design issues on Turbo decoder are investigated and the tradeoffs between the hardware complexity and the performance are analyzed. Through the various simulations on the fixed-length analysis, we decided 5-bits for the received data, 6-bits for a priori information, and 7-bits for the quantization state metric, so the performance gets close to that of infinite precision. The MAX operation which is the main function of Log-MAP decoding algorithm is analyzed and the error correction term for MAX* operation can be efficiently implemented with very small hardware overhead. The size of the sliding window was decided as 32 to reduce the state metric memory space and to achieve an acceptable BER.
Keywords
Turbo Codes; Turbo Decoder; 3epp; Log-MAP;
Citations & Related Records
연도 인용수 순위
  • Reference
1 김수영, 이수인, '터보코드(Turbo Codes) 개발 동향,' 주간 기술 동향, 한국전자통신연구원, 888호, pp. 1-12, 1999년
2 3GPP TS 25.212, 3GPP technical specification group radio access network, multiplexing and channel coding(FDD), (Release 4)
3 김기환, 박태근, '터보 디코더 비트할당에 대한 성능 분석,' SoC 설계 연구회 학술발표 논문집, p. 35-39, May 2004
4 M. M. Mansour and N. R. Shanbhag, 'VLSI architectures for SISO-APP decoders,' IEEE Trans. VLSI Systems, vol. 11, no. 4, Aug. 2003
5 A. Viterbi, 'An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes,' IEEE Journal on Selected Areas in Communications, vol. 16, no. 2, pp. 260-264, Feb. 1998   DOI   ScienceOn
6 G. Masera, G. Piccinini, M. Rock, and M. Zamboni, 'VLSI architectures for Turbo codes,' IEEE Trans. VLSI Systems, vol. 7, pp. 369-79, Sept. 1999   DOI   ScienceOn
7 H. Dawid and H. Meyr, 'Real-time algorithms and VLSI architectures for soft output MAP convolutional decoding,' in Proc. Personal, Indoor, and Mobile Radio Communications, PIMRC'95. Wireless:Merging onto the Information Superhighway, vol. 1, pp. 193-197, 1995
8 S. Benedetto et al., 'Soft-output decoding algorithms in iterative decoding of Turbo codes,' JPL, TDA Progress Report 42-124, Feb. 1996
9 P. Robertson, E.Villebrun and P.Hoeher, 'A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain,' in Proc. Int. Conf. Communications, pp. 1009-1013, June 1995
10 C. Berrou, A. Glavieux, and P. Thitimajshima, 'Near Shannon limit error correcting coding and decoding: Turbo-codes(I),' in Proc. IEEE ICC '93, pp. 1064-1070, May 1993
11 F. Huang, 'Evaluation of soft output decoding for Turbo codes,' Virginia Tech, 1997
12 Z. Wang, Z. Chi and K. K. Parhi, 'Area-efficient high-speed decoding schemes for Turbo decoders,' IEEE Trans. VLSI Systems, vol. 10, no. 6, Dec. 2002
13 L. Bahl, J. Cocke, F. Jelinek and J. Raviv, 'Optimal decoding of linear codes for minimizing symbol error rate,' IEEE Trans. Information Theory, vol. IT-20, pp. 248-287, Mar. 1974
14 S. Barbulescu and S. Piebrobon, 'Turbo codes: A tutorial on a new class of powerful error correcting coding schemes, part 2: Decoder design and performance,' IEEE Journal of Electrical and Electronics Engineering, Australia, vol. 19, no. 3, pp. 143-152, Sept. 1999
15 Z. Wang, H. Suzuki and K. K. Parhi, 'VLSI implementation issues of Turbo decoder design for wireless applications,' IEEE Workshop on Signal Processing Systems, pp. 503-512, Oct. 1999
16 S. Dolinar and D. Divsalar, 'Weight distributions for Turbo codes using random and nonrandom permutations,' TDA Progress report 42-122, pp. 56-65, Aug. 1995