Abstract

Next generation mobile communication system, such as IMT-2000, adopts Turbo codes due to their powerful error correction capability. This paper presents a block-wise maximum a posteriori (MAP) Turbo decoding structure with a low memory requirement. During this research, it has been observed that the training size and block size determine the amount of required memory and bit-error rate (BER) performance of the block-wise MAP decoder, and that comparable BER performance can be obtained with much shorter blocks when the training size is sufficient. Based on this observation, a new decoding structure is proposed and presented in this paper. The proposed block-wise decoder employs a decoding scheme for reducing the memory requirement by setting the training size to be N times the block size. The memory requirement for storing the branch and state metrics can be reduced 30% to 45%, and synthesis results show that the overall memory area can be reduced by 5.27% to 7.29%, when compared to previous MAP decoders. The decoder throughput can be maintained in the proposed scheme without degrading the BER performance.

주제어

#MAP decoder   #training length   #memory requirement  

저자의 다른 논문

참고문헌 (10)

1. A Comparison of Optimal and Sub-optimal MAP Decoding Algorithms Operating in the Log Domain , Robertson, P.;Villebrun, E.;Hoeher, P. , Proc. ICC’95 / v.,pp.1009-1013, 1995
   
2. VLSI Implementation Issues of Turbo Decoder Design for Wireless Applications , Wang, Z.;Suzuki, H.;Parhi, K. , Proc. IEEE Workshop on Signal Processing Systems / v.,pp.503-512, 1999
   
3. An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes , Viterbi, A. , IEEE J. on Selected Areas in Comm. / v.16,pp.260-264, 1998
   
4. A Block-wise MAP Decoder Using a Probability Ratio for Branch Metric , Park, G.;Yoon, S.;Jin, I.;Kang, C. , Proc. VTC’99 / v.,pp.1610-1614, 1999
   
5. Weight Distributions for Turbo Codes Using Random and Non-Random Interleaving, JPL TDA Progress Report, 42-122 , Donilar, S.;Divsalar, D. , / v.,pp.56-65, 1995
   
6. Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate , Bahl, L.;Cocke, J.;Jelinek, F.;Raviv, J. , Proc. IEEE Int. Symp. Inform. Theory / v.,pp.90, 1972
   
7. Near Shannon Limit Error-Correcting Coding and Decoding: Turbo-Codes(1) , Berrou, C.;Glavieux, A.;Thitimajshima, P. , Proc. ICC’93 / v.,pp.1064-1070, 1993
   
8. Comparative Study of Turbo Decoding Techniques: An Overview , Woodard, J.P.;Hanzo, L. , IEEE Trans. on Vehicular Technology / v.49,pp.2208-2238, 2000
   
9. Turbo Codes: A Tutorial on a New Class of Powerful Error Correcting Coding Schemes, Part2:Decoder Design and Performance , Barbulescu, S.;Pietrobon, S. , IEEE J. of Electrical and Electronics Eng. / v.19,pp.143-152, 1999
   
10. A Mathematical Theory of Information , Shannon, C. , Bell System Technical J. / v.27,pp.379-423, 1948
    

이 논문을 인용한 문헌 (0)

1. 이 논문을 인용한 문헌 없음