Algebraic Decoding for Doubly Cyclic Convolutional Codes
Information Theory
2009-08-07 v1 math.IT
Optimization and Control
Abstract
An iterative decoding algorithm for convolutional codes is presented. It successively processes consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be corrected. The algorithm can be efficiently used on a particular class of convolutional codes, known as doubly cyclic convolutional codes. Due to their highly algebraic structure those codes are well suited for the algorithm and the main step of the procedure can be carried out using Reed-Solomon decoding. Examples illustrate the decoding and a comparison with existing algorithms is being made.
Cite
@article{arxiv.0908.0753,
title = {Algebraic Decoding for Doubly Cyclic Convolutional Codes},
author = {H. Gluesing-Luerssen and U. Helmke and J. I. Iglesias Curto},
journal= {arXiv preprint arXiv:0908.0753},
year = {2009}
}
Comments
16 pages