Low Complexity Decoder for Space-Time Turbo Codes 


Vol. 31,  No. 4, pp. 303-309, Apr.  2006


PDF
  Abstract

By combining the space-time diversity technique and iterative turbo codes, space-time turbo codes(STTCs) are able to provide powerful error correction capability. However, the multi-path transmission and iterative decoding structure of STTCs make the decoder very complex. In this paper, we propose a low complexity decoder, which can be used to decode STTCs as well as general iterative codes such as turbo codes. The efficient implementation of the backward recursion and the log-likelihood ratio(LLR) update in the proposed algorithm improves the computational efficiency. In addition, if we approximate the calculation of the joint LLR by using the approximate ratio(AR) algorithm, the computational complexity can be reduced even further. A complexity analysis and computer simulations over the Rayleigh fading channel show that the proposed algorithm necessitates less than 40% of the additions required by the conventional Max-Log-MAP algorithm, while providing the same overall performance.

  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]

C. Lee, "Low Complexity Decoder for Space-Time Turbo Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 4, pp. 303-309, 2006. DOI: .

[ACM Style]

Chang-Woo Lee. 2006. Low Complexity Decoder for Space-Time Turbo Codes. The Journal of Korean Institute of Communications and Information Sciences, 31, 4, (2006), 303-309. DOI: .

[KICS Style]

Chang-Woo Lee, "Low Complexity Decoder for Space-Time Turbo Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 4, pp. 303-309, 4. 2006.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880