00000cab a22000003a 4500 UP-99796217609500248 Buklod 20231007234335.0 m |o d | ta 101008s xx d | ||r ||||| || DENGII eng Ye Liu MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams. pp. 577-587 The maximum a posterioriprobability (MAP) algorithm is a trellis-based MAP decoding algorithm. It is the heart of turbo (or iterative) decoding that achieves an error performance near the Shannon limit. Unfortunately, the implementation of this algorithm requires large computation and storage. Furthermore, its forward and backward recursions result in a long decoding delay. For practical applications, this decoding algorithm must be simplifled and its decoding complexity and delay must be reduced. In this paper, the MAP algorithm and its variation's, such as log-MAP and max-log-MAP algorithms, are first applied to sectionalized trellises for linear block codes and carried out as two-stage decodings. Using the structural properties of properly sectionalized trellises, the decoding complexity and delay of the MAP algorithms can be reduced. Computation-wise optimum sectionalizations of a trellis for MAP algorithms are investigated. Also presented in this paper are bidirectional and parallel MAP decodings Shannon limit. Backward recursions. Bidirectional MAP decoding. Decoding algorithm. Decoding complexity reduction. Decoding delay reduction. Error performance. Forward recursions. Linear block codes decoding. Log-MAP algorithm. Max-log-MAP algorithm. Maximum a posteriori probability. Parallel MAP decoding. Sectionalized trellis diagrams. Structural properties. Trellis-based MAP decoding algorithm. Turbo iterative decoding. Two-stage decoding. IEEE Transactions on communications 48, 4 (2000). FO UPD DENG-II Article