Improving the Performance of M-BCJR Algorithm by Merging Multiple Trellis Sections 


Vol. 44,  No. 1, pp. 175-179, Jan.  2019
10.7840/kics.2019.44.1.175


PDF
  Abstract

BCJR (Bahl, Cocke, Jelinek and Raviv) algorithm is a maximum a posteriori (MAP) decoding algorithm for error correcting codes defined on trellises and it can be used not only in channel decoders but also in channel equalizers. Unfortunately, the required complexity of the BCJR algorithm increases exponentially as the number of states in a trellis increases. To reduced the required complexity for the BCJR algorithm, M-BCJR algorithm was proposed but its performance degradation is significant. In this paper, we propose a scheme to improve the performance of M-BCJR algorithm by merging multiple trellis sections. The proposed scheme offers better performances with virtually identical complexity compared to conventional M-BCJR 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]

D. Kang, A. Lee, W. Oh, "Improving the Performance of M-BCJR Algorithm by Merging Multiple Trellis Sections," The Journal of Korean Institute of Communications and Information Sciences, vol. 44, no. 1, pp. 175-179, 2019. DOI: 10.7840/kics.2019.44.1.175.

[ACM Style]

Donghoon Kang, Arim Lee, and Wangrok Oh. 2019. Improving the Performance of M-BCJR Algorithm by Merging Multiple Trellis Sections. The Journal of Korean Institute of Communications and Information Sciences, 44, 1, (2019), 175-179. DOI: 10.7840/kics.2019.44.1.175.

[KICS Style]

Donghoon Kang, Arim Lee, Wangrok Oh, "Improving the Performance of M-BCJR Algorithm by Merging Multiple Trellis Sections," The Journal of Korean Institute of Communications and Information Sciences, vol. 44, no. 1, pp. 175-179, 1. 2019. (https://doi.org/10.7840/kics.2019.44.1.175)

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880