English

Simultaneous Code/Error-Trellis Reduction for Convolutional Codes Using Shifted Code/Error-Subsequences

Information Theory 2015-05-27 v1 math.IT

Abstract

In this paper, we show that the code-trellis and the error-trellis for a convolutional code can be reduced simultaneously, if reduction is possible. Assume that the error-trellis can be reduced using shifted error-subsequences. In this case, if the identical shifts occur in the subsequences of each code path, then the code-trellis can also be reduced. First, we obtain pairs of transformations which generate the identical shifts both in the subsequences of the code-path and in those of the error-path. Next, by applying these transformations to the generator matrix and the parity-check matrix, we show that reduction of these matrices is accomplished simultaneously, if it is possible. Moreover, it is shown that the two associated trellises are also reduced simultaneously.

Keywords

Cite

@article{arxiv.1101.5858,
  title  = {Simultaneous Code/Error-Trellis Reduction for Convolutional Codes Using Shifted Code/Error-Subsequences},
  author = {Masato Tajima and Koji Okino and Takashi Miyagoshi},
  journal= {arXiv preprint arXiv:1101.5858},
  year   = {2015}
}

Comments

5 pages, submitted to the 2011 IEEE International Symposium on Information Theory

R2 v1 2026-06-21T17:19:06.396Z