Proceedings ArticleDOI
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
Claude Berrou,A. Glavieux,Punya Thitimajshima +2 more
- Vol. 2, pp 1064-1070
TLDR
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.Abstract:
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. The turbo-code encoder is built using a parallel concatenation of two recursive systematic convolutional codes, and the associated decoder, using a feedback decoding rule, is implemented as P pipelined identical elementary decoders. >read more
Citations
More filters
Journal ArticleDOI
On Limits of Wireless Communications in a Fading Environment when UsingMultiple Antennas
G. J. Foschini,M. J. Gans +1 more
TL;DR: In this article, the authors examined the performance of using multi-element array (MEA) technology to improve the bit-rate of digital wireless communications and showed that with high probability extraordinary capacity is available.
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
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
Design of capacity-approaching irregular low-density parity-check codes
TL;DR: This work designs low-density parity-check codes that perform at rates extremely close to the Shannon capacity and proves a stability condition which implies an upper bound on the fraction of errors that a belief-propagation decoder can correct when applied to a code induced from a bipartite graph with a given degree distribution.
Journal ArticleDOI
The capacity of low-density parity-check codes under message-passing decoding
TL;DR: The results are based on the observation that the concentration of the performance of the decoder around its average performance, as observed by Luby et al. in the case of a binary-symmetric channel and a binary message-passing algorithm, is a general phenomenon.
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 low complexity soft-output Viterbi decoder architecture
TL;DR: A means to adapt the classical architecture of a Viterbi decoder to make it able to provide soft (weighted) decisions is presented and an application to the decoding of concatenated convolutional codes, with the proposed soft-output decoder as the inner decoder is examined.