An Efficient MAP Decoding Algorithm which Uses the BCJR and the Recursive Techniques(Special Section on Information Theory and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• A new algorithm for the maximum a posteriori (MAP) decoding of linear block codes is presented. The proposed algorithm can be regarded as a conventional BCJR algorithm for a section trellis diagram, where branch metrics of the trellis are computed by the recursive MAP algorithm proposed by the authors. The decoding complexity of the proposed algorithm depends on the sectionalization of the trellis. A systematic way to find the optimum sectionalization which minimizes the complexity is also presented. Since the algorithm can be regarded as a generalization of both of the BCJR and the recursive MAP algorithms, the complexity of the proposed algorithm cannot be larger than those algorithms, as far as the sectionalization is chosen appropriately.

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

著者

• Kaji Yuichi

  Openwave Systems Japan K.k.

• SHIBUYA Ryujiro

  the Graduate School of Information Science, Nara Institute of Science and Technology

• Shibuya Ryujiro

  The Graduate School Of Information Science Nara Institute Of Science And Technology

関連論文

• An Efficient MAP Decoding Algorithm which Uses the BCJR and the Recursive Techniques(Special Section on Information Theory and Its Applications)

スポンサーリンク