An efficient MAP decoding algorithm using a section trellis diagram

An efficient algorithm for the MAP decoding is presented. The proposed algorithm is a hybrid of the conventional BCJR algorithm and the recursive-MAP (r-MAP) algorithm which has been proposed by the authors. The r-MAP algorithm uses structural properties of linear codes to reduce the decoding complexity, but does not work well for high-rate codes. The proposed algorithm overcomes this defect, and achieves smaller decoding complexity than BCJR and r-MAP algorithms for any code.