Performance Analysis and Efficient Decoding Algorithm for Space-Time Turbo codes 


Vol. 30,  No. 4, pp. 191-199, Apr.  2005


PDF
  Abstract

Space-time turbo codes have been studied extensively as a powerful and bandwidth efficient error correction code over the wireless communication environment. In this paper, the efficient algorithm for decoding space-time turbo codes is proposed. The proposed method reduces the computational complexity by approximating a prior information for a iterative decoder. The performance of space-time turbo codes is also analyzed by using the fixed point implementation and the efficient method for approximating the Log-MAP algorithm is proposed. It is shown that the BER performance of the proposed method is close to that of the Log-MAP algorithm.

  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]

N. n. Shin and C. w. Lee, "Performance Analysis and Efficient Decoding Algorithm for Space-Time Turbo codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 4, pp. 191-199, 2005. DOI: .

[ACM Style]

Na na Shin and Chang woo Lee. 2005. Performance Analysis and Efficient Decoding Algorithm for Space-Time Turbo codes. The Journal of Korean Institute of Communications and Information Sciences, 30, 4, (2005), 191-199. DOI: .

[KICS Style]

Na na Shin and Chang woo Lee, "Performance Analysis and Efficient Decoding Algorithm for Space-Time Turbo codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 4, pp. 191-199, 4. 2005.