An Algorithm for the Exact Packet Error Probability Calculation for Viterbi Decoding

The performance of the Viterbi decoding algorithm in a binary symmetric channel is usually estimated by a lower or an upper bounds of a bit error probability. Nowadays, there are expressions for the exact bit error probability estimation for several trivial convolutional codes. However, traffic in m...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International Conference on Actual Problems of Electronic Instrument Engineering proceedings s. 282 - 287
Hlavní autori: Shapin, Alexey G., Kleyko, Denis V., Krasheninnikov, Pavel V., Melentyev, Oleg G.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.10.2018
Predmet:
binary symmetric channel (BSC)
Complexity theory
Convolutional codes
Decoding
Error probability
Measurement
packet error probability (PEP)
Viterbi algorithm
Viterbi decoding algorithm (VA)
ISSN:2473-8573
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The performance of the Viterbi decoding algorithm in a binary symmetric channel is usually estimated by a lower or an upper bounds of a bit error probability. Nowadays, there are expressions for the exact bit error probability estimation for several trivial convolutional codes. However, traffic in modern systems is packetized. Thus, packet error probability is also an important performance metric. Besides, the existed methods could not be used for the task of packet error probability estimation. Therefore this paper presents an algorithm for the calculation of the exact packet error probability for the Viterbi decoding. The algorithm is based on a recurrent search of the cases, which lead to an error free-decoding and then cumulative probabilities of these cases are calculated.
ISSN:2473-8573
DOI:10.1109/APEIE.2018.8545996