Efficient Implementation of SOVA for Turbo Codes 


Vol. 28,  No. 11, pp. 1045-1051, Nov.  2003


PDF
  Abstract

The SOVA, which produces the soft decision value, can be used as a sub-optimum solution for concatenated codes such as turbo codes, since it is computationally efficient compared with the optimum MAP algorithm. In this paper, we propose an efficient implementation of the SOY A used for decoding turbo codes. by reducing the number of calculations for soft decision values and trace-back operations. In order to utilize the memory efficiently, tile whole block of turbo codes is divided into several sub-blocks in the proposed algorithm. It is demonstrated that the proposed algorithm requires less computation than the conventional 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, "Efficient Implementation of SOVA for Turbo Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 11, pp. 1045-1051, 2003. DOI: .

[ACM Style]

Chang-Woo Lee. 2003. Efficient Implementation of SOVA for Turbo Codes. The Journal of Korean Institute of Communications and Information Sciences, 28, 11, (2003), 1045-1051. DOI: .

[KICS Style]

Chang-Woo Lee, "Efficient Implementation of SOVA for Turbo Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 11, pp. 1045-1051, 11. 2003.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880