A posteriori probability decoding of convolutional codes (Q1569283)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1467819
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A posteriori probability decoding of convolutional codes |
scientific article; zbMATH DE number 1467819 |
Statements
A posteriori probability decoding of convolutional codes (English)
0 references
19 November 2001
0 references
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.
0 references
APP decoding
0 references
a posteriori probability decoding scheme
0 references
MPP decoding
0 references
convolutional codes
0 references
maximum a posteriori probability decoding
0 references
computational complexity
0 references
bit error probability
0 references
0.8144329190254211
0 references
0.8088773488998413
0 references
0.8077324628829956
0 references
0.8013346791267395
0 references
0.7982780337333679
0 references
