Proceedings ArticleDOI
Soft-output decoding algorithms for continuous decoding of parallel concatenated convolutional codes
S. Benedetto,Dariush Divsalar,Guido Montorsi,F. Pollara +3 more
- Vol. 1, pp 112-117
Reads0
Chats0
TLDR
New decoding algorithms to be embedded in the iterative decoding strategy of parallel concatenated convolutional codes are derived from the optimum maximum-a-posteriori algorithm and permit a continuous decoding of the coded sequence without requiring trellis termination of the constituent codes.Abstract:
We propose new decoding algorithms to be embedded in the iterative decoding strategy of parallel concatenated convolutional codes. They are derived from the optimum maximum-a-posteriori algorithm and permit a continuous decoding of the coded sequence without requiring trellis termination of the constituent codes. Two basic versions of the continuous algorithm and their suboptimum simplifications are described. Simulation results refer to the applications of the new algorithms to a highly efficient rate 1/3 concatenated code; they show performance only 0.6 dB worse than the Shannon limit.read more
Citations
More filters
Journal ArticleDOI
Serial concatenation of interleaved codes: performance analysis, design and iterative decoding
TL;DR: In this article, the authors derived upper bounds to the average maximum likelihood bit error probability of serially concatenated block and convolutional codes with interleaver, and derived design guidelines for the outer and inner encoders that maximize the interleavers gain and the asymptotic slope of the error probability curves.
Journal ArticleDOI
Unveiling turbo codes: some results on parallel concatenated coding schemes
Sergio Benedetto,Guido Montorsi +1 more
TL;DR: A method to evaluate an upper bound to the bit error probability of a parallel concatenated coding scheme averaged over all interleavers of a given length is proposed and used to shed some light on some crucial questions which have been floating around in the communications community since the proposal of turbo codes.
Journal ArticleDOI
Design of parallel concatenated convolutional codes
Sergio Benedetto,Guido Montorsi +1 more
TL;DR: The separate contributions that the interleaver length and constituent codes give to the overall performance of the parallel concatenated code are characterized, and some guidelines for the optimal design of the constituent convolutional codes are presented.
Proceedings ArticleDOI
Hybrid concatenated codes and iterative decoding
Dariush Divsalar,F. Pollara +1 more
TL;DR: An upper bound to the bit error rate (BER) of the hybrid code is obtained and a low-complexity iterative decoding algorithm with near maximum-likelihood performance is proposed.
A soft-input soft-output maximum a posteriori (MAP) module to decode parallel and serial concatenated codes
TL;DR: This article describes the SISO module in a form that continuously updates the maximum a posteriori (MAP) probabilities of input and output code symbols and shows how to embed it into iterative decoders for parallel and serially concatenated codes.
References
More filters
Journal ArticleDOI
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
TL;DR: The general problem of estimating the a posteriori probabilities of the states and transitions of a Markov source observed through a discrete memoryless channel is considered and an optimal decoding algorithm is derived.
Proceedings ArticleDOI
A Viterbi algorithm with soft-decision outputs and its applications
TL;DR: The Viterbi algorithm is modified to deliver the most likely path sequence in a finite-state Markov chain, as well as either the a posteriori probability for each bit or a reliability value, with the aim of producing soft decisions to be used in the decoding of outer codes.
Proceedings ArticleDOI
A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain
TL;DR: A log- MAP algorithm is presented that avoids the approximations in the max-log-MAP algorithm and hence is equivalent to the true MAP, but without its major disadvantages, and it is concluded that the three algorithms increase in complexity in the order of their optimality.
Proceedings ArticleDOI
Turbo codes for PCS applications
Dariush Divsalar,F. Pollara +1 more
TL;DR: A new simple method for trellis termination is described, the effect of interleaver choice on the weight distribution of the code, and the use of unequal rate component codes which yields better performance are introduced.