Reduction of Error-Trellises for Tail-Biting Convolutional Codes Using Shifted Error-Subsequences
Information Theory
2014-01-14 v1 math.IT
Abstract
In this paper, we discuss the reduction of error-trellises for tail-biting convolutional codes. In the case where some column of a parity-check matrix has a monomial factor (with indeterminate D), we show that the associated tail-biting error-trellis can be reduced by cyclically shifting the corresponding error-subsequence by l (the power of D) time units. We see that the resulting reduced error-trellis is again tail-biting. Moreover, we show that reduction is also possible using backward-shifted error-subsequences.
Cite
@article{arxiv.1401.2496,
title = {Reduction of Error-Trellises for Tail-Biting Convolutional Codes Using Shifted Error-Subsequences},
author = {Masato Tajima and Koji Okino and Tatsuto Murayama},
journal= {arXiv preprint arXiv:1401.2496},
year = {2014}
}
Comments
5 pages, submitted to the 2014 IEEE International Symposium on Information Theory