Low-Complexity Hybrid Algorithm for Decoding Convolutional Codes

The Viterbi algorithm is one of the most commonly used methods for decoding convolutional codes, which outputs a maximum-likelihood codeword for the input sequence. However, the complexity of the Viterbi algorithm is high when the constraint length is large. To address this issue, we propose a hybri...

Celý popis

Podrobná bibliografia

Vydané v:	2022 IEEE 8th International Conference on Computer and Communications (ICCC) s. 2477 - 2482
Hlavní autori:	Fu, Ziyun, Liu, Haiyang
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 09.12.2022
Predmet:	Complexity theory Convolution Convolutional codes Degradation hybrid algorithm Iterative decoding normalized min-sum algorithm Simulation SST Viterbi algorithm Viterbi algorithm
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!