A Recursive Log-MAP Algorithm for Binary Linear Block Codes
نویسندگان
چکیده
| An e cient recursive Log-MAP algorithm for binary linear block codes is proposed. This algorithm is devised based on the structural properties of the minimal trellis diagram. Simulation results show that for some well known codes, the proposed algorithm reduces decoding complexity signi cantly compared to the conventional Log-MAP algorithm.
منابع مشابه
Binary Linear Codes with Optimal Scaling and Quasi-Linear Complexity
We present the first family of binary codes that attains optimal scaling and quasi-linear complexity, at least for the binary erasure channel (BEC). In other words, for any fixed δ > 0, we provide codes that ensure reliable communication at rates within ε > 0 of the Shannon capacity with block length n = O(1/ε2+δ), construction complexity Θ(n), and encoding/decoding complexity Θ(n log n). Furth...
متن کاملArea-Efficient and High Speed ML MAP Processor Design Using DB/SB Decoding Technique
In communication systems, specifically wireless mobile communication applications, Size and Speed are dominant factors while meeting the performance requirements. Turbo codes play an important role in such practical applications due to their better error-correcting capability. In Turbo decoders, Maximum A Posterior probability (MAP) algorithm has been widely used for its optimum error correctin...
متن کاملThe Decision Reliability of MAP, Log-MAP, Max-Log-MAP and SOVA Algorithms for Turbo Codes
In this paper, we study the reliability of decisions of e Codes, Channel Reliability, e N comm llular, satellite and we also consider two improved versions, named Log-MAP two different or identical Recursi s, connected in p Fig. 1. The turbo encoder with rate 1/3. The first encoder operat ed b e u, i ond encoder p Lucian Andrei Perişoară, and Rodica Stoian th MAP, Log-MAP, Max-Log-MAP and SOVA ...
متن کاملNear-optimum decoding of product codes: block turbo codes
This paper describes an iterative decoding algorithm for any product code built using linear block codes. It is based on soft-input/soft-output decoders for decoding the component codes so that near-optimum performance is obtained at each iteration. This soft-input/soft-output decoder is a Chase decoder which delivers soft outputs instead of binary decisions. The soft output of the decoder is a...
متن کاملMaximum-likelihood Soft-decision Decoding for Binary Linear Block Codes Based on Their Supercodes
Based on the notion of supercodes, we propose a two-phase maximum-likelihood soft-decision decoding (tpMLSD) algorithm for binary linear block codes in this work. The first phase applies the Viterbi algorithm backwardly to a trellis derived from the parity-check matrix of the supercode of the linear block code. Using the information retained from the first phase, the second phase employs the pr...
متن کامل