A posteriori probability decoding of convolutional codes
From MaRDI portal
A new a posteriori probability decoding (APP decoding) scheme for convolutional codes is proposed. The algorithm computes a posteriori probabilities of elements of a data sequence and performs maximum a posteriori probability decoding (MPP decoding). The authors show that the computational complexity of this algorithm is proportional to the number of encoder states. They also prove that the bit error probability can be upper bounded by the bit error probability of the Viterbi algorithm.
Recommendations
Cited in
(9)- A posteriori probability decoding of nonsystematically encoded block codes
- A truncated best-path algorithm
- A rate-k/n heuristic soft-output Viterbi algorithm (SOVA) that is postdetector-compatible
- Optimal subblock-by-subblock detection
- scientific article; zbMATH DE number 4077130 (Why is no real title available?)
- Alternative structure for computing APPs of the markov source
- scientific article; zbMATH DE number 1928620 (Why is no real title available?)
- scientific article; zbMATH DE number 1867235 (Why is no real title available?)
- scientific article; zbMATH DE number 2115921 (Why is no real title available?)
This page was built for publication: A posteriori probability decoding of convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569283)