2014/01/11 by Masato Tajima, Tajima, Masato, Koji Okino +3
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1401.2496
5 pages, submitted to the 2014 IEEE International Symposium on Information Theory
arxiv created 2014/01/11 · arxiv updated 2014/01/14
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.