vix.ing · top · new · best · stats · spec

Receding horizon decoding of convolutional codes

2009/09/03 by José Ignacio Iglesias Curto, Jose Ignacio Iglesias Curto, Curto, Jose Ignacio Iglesias +2
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Coding theory and cryptography #Error Correcting Code Techniques #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Optimization and Control (math.OC) #cs.IT #math.IT #math.OC

paper · pdf · doi:10.48550/arxiv.0909.0588

arxiv created 2009/09/03 · openalex publication_date 2009/09/03 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Decoding of convolutional codes poses a significant challenge for coding theory. Classical methods, based on e.g. Viterbi decoding, suffer from being computationally expensive and are restricted therefore to codes of small complexity. Based on analogies with model predictive optimal control, we propose a new iterative method for convolutional decoding that is cheaper to implement than established algorithms, while still offering significant error correction capabilities. The algorithm is particularly well-suited for decoding special types of convolutional codes, such as e.g. cyclic convolutional codes.

Related