Efficient Algorithm for Decoding Concatenated Codes(Fundamental Theories for Communications)

スポンサーリンク

概要

• 論文の詳細を見る

• The maximum a posteriori (MAP) algorithm is the optimum solution for decoding concatenated codes, such as turbo codes. Since the MAP algorithm is computationally complex, more efficient algorithms, such as the Max-Log-MAP algorithm and the soft-output Viterbi algorithm (SOVA), can be used as suboptimum solutions. Especially, the Max-Log-MAP algorithm is widely used, due to its near-optimum performance and lower complexity compared with the MAP algorithm. In this paper, we propose an efficient algorithm for decoding concatenated codes by modifying the Max-Log-MAP algorithm. The efficient implementation of the backward recursion and the log-likelihood ratio (LLR) update in the proposed algorithm improves its computational efficiency. Memory is utilized more efficiently if the sliding window algorithm is adopted. Computer simulations and analysis show that the proposed algorithm requires a considerably lower number of computations compared with the Max-Log-MAP algorithm, while providing the same overall performance.

• 社団法人電子情報通信学会の論文
• 2004-11-01

著者

• Lee C‐w

  Institute Of Multidisciplinary Research For Advanced Materials Tohoku University

• Lee C‐w

  The School Of Information Communications And Electronics Engineering The Catholic University Of Kore

• LEE Chang-Woo

  the School of Information, Communications and Electronics Engineering, The Catholic University of Ko

関連論文

• Efficient Algorithm for Decoding Concatenated Codes(Fundamental Theories for Communications)
• Measurement of mean free paths for inelastic electron scattering of Si and SiO_2
• Energy-filtered electron diffraction and high-resolution electron microscopy on short-range ordered structure in GaAs_Sb_
• Thickness Measurement of Amorphous SiO_2 by EELS and Electron Holography

スポンサーリンク