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


Vol. 32,  No. 5, pp. 426-432, May  2007


PDF
  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.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

G. Choi, "A Study of MAP Architecture Adopting the Sliding Window Method for Turbo Decoding," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 5, pp. 426-432, 2007. DOI: .

[ACM Style]

Goang-seog Choi. 2007. A Study of MAP Architecture Adopting the Sliding Window Method for Turbo Decoding. The Journal of Korean Institute of Communications and Information Sciences, 32, 5, (2007), 426-432. DOI: .

[KICS Style]

Goang-seog Choi, "A Study of MAP Architecture Adopting the Sliding Window Method for Turbo Decoding," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 5, pp. 426-432, 5. 2007.