Browse > Article

Design of an Area-Efficient Architecture for Block-wise MAP Turbo Decoder  

Kang, Moon-Jun (서강대학교 전자공학과 CAD & Computer Systems 연구실)
Kim, Sik (서강대학교 전자공학과 CAD & Computer Systems 연구실)
Hwang, Sun-Young (서강대학교 전자공학과 CAD & Computer Systems 연구실)
Abstract
Block-wise MAP (Maximum A posteriori) decoding algorithm for turbo-codes requires less memory than Log-MAP decoding algorithm. The ER (Bit Error Rate) performance of previous block-wise MAP decoding algorithm depend on the block length and training length. To maximize hardware utilization and perform successive decoding, the block length is set to be equal to the training length in previous MAP decoding algorithms. Simulation result on the BER performance shows that the EBR performance can be maintained with shorter blocks when training length is sufficient. This paper proposes an architecture for area efficient block-wise MAP decoder. The proposed architecture employs the decoding schema for reducing memory by using the training length, which in N times larger than block length. To efficiently handle the proposed schema, a pipelined architecture is proposed. Simulation results show that memory usage can be reduced by 30%~45% in the proposed architecture without degrading the BER performance.
Keywords
Citations & Related Records
연도 인용수 순위
  • Reference
1 P. Jason and H. Lajos, 'Comparative Study of Turbo Decoding Techniques: An Overview,' IEEE Trans. on Vehicular Technology, Vol. 49, No. 6, pp. 2208-2238, Nov. 2000   DOI   ScienceOn
2 G. Park, S. Yoon, I. Jin, and C. Kang, 'A Block-wise MAP Decoder Using a Probability Ratio for Branch Metric' in Proc. of VTC' 99, Amsterdam, Netherlands, pp. 1610-1614, Sept. 1999
3 S. Barbulescu and S. Piebiobon, '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, Vol. 19, No. 3, pp. 143-152, Sept. 1999
4 S. Donilar and D. Divsalar, 'Weight Distribu-tions for Turbo Codes Using Random and Non-random Interleaving,' JPL TDA Progress Report 42-122, pp. 56-65, 1995
5 L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, 'Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate,' in Proc. IEEE Int. Symp. Inform. Theory, Asilomar, CA, pp. 90, May 1972
6 Z. Wang, H. Suzuki, andK. K. Parhi, 'VLSIImplementation Issues of Turbo Decoder Designfor Wireless Applications,' in Proc. IEEE Workshop on Signal Processing Systems, Taipei,Taiwan, pp. 503-512, Oct. 1999
7 C. Shannon, 'A Mathematical Theory of Information,' Bell System Technical Journal, Vol. 27, pp. 379-423, July 1948
8 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
9 P. Robertson, E. Villebnm and P. Hoeher, 'A Comparison of Optimal and Sub-optimal MAP Decoding Algorithms Operating in the LogDomain,' in Proc. ICC' 95, pp. 1009-1013,Seattle, June 1995
10 C. Berrou, A. Glavieux, and P. Thitimajshima, 'Near Shannon Limit Error-correcting Coding and Decoding: Turbo-Codes(1),' in Proc. ICC'93, Geneva, Switzerland, pp. 1064-1070, May 1993
11 이문호, '비동기식 IMT-2000의 채널 부호화,' 한국통신학회 학회지, 제 14권, 9호, pp. 170-187, 1996년 9월