The search functionality is under construction.

The search functionality is under construction.

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.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E84-A No.10 pp.2389-2396

- Publication Date
- 2001/10/01

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)

- Category
- Coding Theory

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Ryujiro SHIBUYA, Yuichi KAJI, "An Efficient MAP Decoding Algorithm which Uses the BCJR and the Recursive Techniques" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 10, pp. 2389-2396, October 2001, doi: .

Abstract: 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.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_10_2389/_p

Copy

@ARTICLE{e84-a_10_2389,

author={Ryujiro SHIBUYA, Yuichi KAJI, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={An Efficient MAP Decoding Algorithm which Uses the BCJR and the Recursive Techniques},

year={2001},

volume={E84-A},

number={10},

pages={2389-2396},

abstract={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.},

keywords={},

doi={},

ISSN={},

month={October},}

Copy

TY - JOUR

TI - An Efficient MAP Decoding Algorithm which Uses the BCJR and the Recursive Techniques

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 2389

EP - 2396

AU - Ryujiro SHIBUYA

AU - Yuichi KAJI

PY - 2001

DO -

JO - IEICE TRANSACTIONS on Fundamentals

SN -

VL - E84-A

IS - 10

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - October 2001

AB - 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.

ER -