Error Performance Analysis of the K-best Viterbi Decoding Algorithm

The Viterbi algorithm is widely applied for the decoding of the convolutional codes. But the complexity is increase rapidly in the constraint length. The K-best Viterbi decoding algorithm for the convolutional codes is proposed to reduce its decoding complexity. This is expected to apply for Interne...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2018 International Symposium on Information Theory and Its Applications (ISITA) s. 257 - 260
Hlavní autor: Yoshikawa, Hideki
Médium: Konferenční příspěvek
Jazyk:angličtina
japonština
Vydáno: IEICE 01.10.2018
Témata:
binary symmetric channel
bit error probability
Convolutional codes
Decoding
Error probability
exact analysis
Iterative decoding
K-best Viterbi decoding algorithm
Measurement
Probability density function
Viterbi algorithm
Viterbi decoding
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The Viterbi algorithm is widely applied for the decoding of the convolutional codes. But the complexity is increase rapidly in the constraint length. The K-best Viterbi decoding algorithm for the convolutional codes is proposed to reduce its decoding complexity. This is expected to apply for Internet of Things(IoT) devices which are low-scale and low-power hardwares. The author have already shown that the exact bit error performance of Viterbi decoding algorithm for convolutional codes. This analytical technique employs the iterative calculation of probability density function of path metrics. In this paper, the application for error performance analysis for K-best Viterbi decoding algorithm is demonstrated.
DOI:10.23919/ISITA.2018.8664365