The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

A Study of MAP Architecture Adopting the Sliding Window Method for Turbo Decoding

터보 복호를 위한 슬라이딩 윈도우 방식을 적용한 MAP 구조에 관한 연구

  • 최광석 (조선대학교 정보통신공학부)
  • Published : 2007.05.31
Download PDF
⟨ Previous Next ⟩

Abstract

The MAP algorithm is designed and implemented through the sliding window method for turbo decoding. First, the implementation issues, which are the length of the sliding window and the normalization method of state metrics are reviewed, and their optimal values are obtained by the simulation. All component schemes of the decoder including the branch metric evaluator are also presented. The proposed MAP architecture can be easily redesigned according to the size of sliding window, that is, sub-frame length because of its simplicity on buffer control.

터보 복호를 위한 MAP(Maximum A Posteriori) 알고리즘을 슬라이딩 윈도우 방식으로 설계하고 구현하였다. 먼저, 구현하는데 필요한 논쟁점들 즉, 슬라이딩 윈도우의 길이 및 상태 메트릭의 정규화 방식 등이 논의되고 그들의 최적 값을 모의실험을 통하여 얻었다. 또, 가지 메트릭 계산기를 포함한 복호기의 모든 구성요소의 회로가 제출되었다. 제안된 MAP구조는 버퍼 제어를 간단히 하여 슬라이딩 윈도우 크기 즉, 부-프레임 길이의 변경에 따라 쉽게 재설계 될 수 있다.

Keywords

References

  1. C. Berrou, A. Glavieux, P. Thitimajshima, 'Near Shannon limit error-correcting coding and decoding: Turbo-Codes(1)', Proc. of ICC, pp. 1064-1070, May 1993
  2. P. Robertson, E. Villebrrun and P. Hoeher, 'A Comparison of Optimal and Sub-Optimal MAP Decoding Algorithms Operating in the Log Domain', Proc. of ICC, pp1009-1013, 1995
  3. L.R. Bahl, J.Cocke, F.Jelinek, and J. Raviv, 'Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate', IEEE Trans. On Information Theory, pp.284-287, Mar. 1974
  4. S. Pietrobon and S. Barbulescu, 'A Simplification of the Modified Bahl Decoding Algorithm for Systematic Convolutional Codes', Int. Symp. On Inform. Theory, pp. 1073-1077, Nov. 1994
  5. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, 'Soft-Output Decoding Algorithms in Iterative Decoding of Turbo Codes', TDA Progress Report 42-124, pp.63-87, Feb. 1996
  6. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, 'A Soft-Input Soft-Output Maximum A Posteriori(MAP) Module to Decode Parallel and Serial Concatenated Code', TDA Progress Report 42-127, pp. 1-20, Nov. 1996
  7. S. Pietrobon, 'Implementation and performance of a turbo/MAP decoder', Int. Journal of Satellite Comm. vol. 16, pp.23-26, Jan. 1998 https://doi.org/10.1002/(SICI)1099-1247(199801/02)16:1<23::AID-SAT590>3.0.CO;2-W
  8. A.J. Viterbi, 'An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes', IEEE Journal on Sel. Areas in Comm., vol. 16, no.2, pp.260-264, Feb. 1998 https://doi.org/10.1109/49.661114
  9. Masera, G. Piccinini, M. R. Roch, and M. Zamboni, 'VLSI Architectures for Turbo Codes', IEEE Trans. On VLSI System, vol.7, no.3, pp.369-79, Sep. 1999 https://doi.org/10.1109/92.784098
  10. F. Acikel, 'Implementation Issues for High Turbo Codes on BPSK/QPSK Channels', IEEE Globecom, pp.148-152, 1999
  11. P. Hekstra, 'An alternative to metric rescaling in Viterbi decoder', IEEE Trans. Comm., vol.37, pp. 1220-1222, Nov. 1989 https://doi.org/10.1109/26.46516
  12. I. Onyszchuk, K. M. Cheung, and O. Collins, 'Quantization Loss in Convolutional Decoding', IEEE Trans. Comm., vol.41, pp.261-65, Feb. 1993 https://doi.org/10.1109/26.216495