A Memory-Efficient Block-wise MAP Decoder Architecture

  • Received : 2003.08.11
  • Published : 2004.12.31

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.

Keywords

References

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