Journal ArticleDOI
An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes
TLDR
An intuitive shortcut to understanding the maximum a posteriori (MAP) decoder is presented based on an approximation to correspond to a dual-maxima computation combined with forward and backward recursions of Viterbi algorithm computations.Abstract:
An intuitive shortcut to understanding the maximum a posteriori (MAP) decoder is presented based on an approximation. This is shown to correspond to a dual-maxima computation combined with forward and backward recursions of Viterbi algorithm computations. The logarithmic version of the MAP algorithm can similarly be reduced to the same form by applying the same approximation. Conversely, if a correction term is added to the approximation, the exact MAP algorithm is recovered. It is also shown how the MAP decoder memory can be drastically reduced at the cost of a modest increase in processing speed.read more
Citations
More filters
Journal ArticleDOI
Reduced complexity iterative decoding of low-density parity check codes based on belief propagation
TL;DR: Two simplified versions of the belief propagation algorithm for fast iterative decoding of low-density parity check codes on the additive white Gaussian noise channel are proposed, which greatly simplifies the decoding complexity of belief propagation.
Book
The art of error correcting coding
TL;DR: This chapter discusses encoding and decoding of binary BCH codes as well as some of the techniques used in the Viterbi algorithm, which simplifies the decoding process and increases the chances of success in the face of uncertainty.
Journal ArticleDOI
On the performance of hybrid FEC/ARQ systems using rate compatible punctured turbo (RCPT) codes
D.N. Rowitch,L.B. Milstein +1 more
TL;DR: The proposed RCPT-ARQ system combines the performance of turbo codes with the frugal use of incremental redundancy inherent in the rate compatible punctured convolutional codes of Hagenauer (1988) to achieve enhanced throughput performance over a nonstationary Gaussian channel.
Book
Turbo Coding, Turbo Equalisation and Space-Time Coding for Transmission over Fading Channels
TL;DR: This paper presents a Comparative Study of Turbo Equalisers: The Super Trellis Structure of Convolutional Turbo Codes and the Coded Modulation Theory and Performance.
Proceedings ArticleDOI
Efficient implementations of the sum-product algorithm for decoding LDPC codes
TL;DR: By exploiting the inherent robustness of LLRs, it is shown, via simulations, that coarse quantization tables are sufficient to implement complex core operations with negligible or no loss in performance.
References
More filters
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
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.
Book
Cdma: Principles of Spread Spectrum Communication
TL;DR: Generating Pseudorandom Signals (Pseudonoise) from PseudOrandom Sequences by Modulation and Demodulation of Spread Spectrum Signals in Multipath and Multiple Access Interference.