Journal ArticleDOI
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
TLDR
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.Abstract:
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. The decoding of linear block and convolutional codes to minimize symbol error probability is shown to be a special case of this problem. An optimal decoding algorithm is derived.read more
Citations
More filters
Journal ArticleDOI
Factor graphs and the sum-product algorithm
TL;DR: A generic message-passing algorithm, the sum-product algorithm, that operates in a factor graph, that computes-either exactly or approximately-various marginal functions derived from the global function.
Journal ArticleDOI
The viterbi algorithm
TL;DR: This paper gives a tutorial exposition of the Viterbi algorithm and of how it is implemented and analyzed, and increasing use of the algorithm in a widening variety of areas is foreseen.
Proceedings ArticleDOI
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
TL;DR: In this article, a new class of convolutional codes called turbo-codes, whose performances in terms of bit error rate (BER) are close to the Shannon limit, is discussed.
Journal ArticleDOI
Good error-correcting codes based on very sparse matrices
TL;DR: It is proved that sequences of codes exist which, when optimally decoded, achieve information rates up to the Shannon limit, and experimental results for binary-symmetric channels and Gaussian channels demonstrate that practical performance substantially better than that of standard convolutional and concatenated codes can be achieved.
Journal ArticleDOI
Near optimum error correcting coding and decoding: turbo-codes
Claude Berrou,A. Glavieux +1 more
TL;DR: A new family of convolutional codes, nicknamed turbo-codes, built from a particular concatenation of two recursive systematic codes, linked together by nonuniform interleaving appears to be close to the theoretical limit predicted by Shannon.
References
More filters
Journal ArticleDOI
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
TL;DR: The upper bound is obtained for a specific probabilistic nonsequential decoding algorithm which is shown to be asymptotically optimum for rates above R_{0} and whose performance bears certain similarities to that of sequential decoding algorithms.
Journal ArticleDOI
The viterbi algorithm
TL;DR: This paper gives a tutorial exposition of the Viterbi algorithm and of how it is implemented and analyzed, and increasing use of the algorithm in a widening variety of areas is foreseen.
Journal ArticleDOI
Statistical Inference for Probabilistic Functions of Finite State Markov Chains
Leonard E. Baum,Ted Petrie +1 more
Journal ArticleDOI
On receiver structures for channels having memory
R. Chang,J. Hancock +1 more
TL;DR: Receiver structures are developed for making jointly optimum decisions about L consecutive symbols on the basis of the complete message received and the decision statistics are computed by a sequential procedure, and the number of computations increases only linearly with the message length.
Journal ArticleDOI
Bootstrap hybrid decoding for symmetrical binary input channels
Frederick Jelinek,John Cocke +1 more
TL;DR: A new method of decoding is presented that utilizes algebraic constraints across streams of convolutionally encoded information sequences to improve the performance of ordinary sequential decoding and over the older hybrid scheme developed by Falconer.