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žené v:

Podrobná bibliografia
Vydané v:	2018 International Symposium on Information Theory and Its Applications (ISITA) s. 257 - 260
Hlavný autor:	Yoshikawa, Hideki
Médium:	Konferenčný príspevok..
Jazyk:	English Japanese
Vydavateľské údaje:	IEICE 01.10.2018
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

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