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...

Full description

Bibliographic Details

Published in:	2022 IEEE 8th International Conference on Computer and Communications (ICCC) pp. 2477 - 2482
Main Authors:	Fu, Ziyun, Liu, Haiyang
Format:	Conference Proceeding
Language:	English
Published:	IEEE 09.12.2022
Subjects:	Complexity theory Convolution Convolutional codes Degradation hybrid algorithm Iterative decoding normalized min-sum algorithm Simulation SST Viterbi algorithm Viterbi algorithm
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!