Title :
Simultaneous code/error-trellis reduction for convolutional codes using shifted code/error-subsequences
Author :
Tajima, Masato ; Okino, Koji ; Miyagoshi, Takashi
Author_Institution :
Grad. Sch. of Sci. & Eng., Univ. of Toyama, Toyama, Japan
fDate :
July 31 2011-Aug. 5 2011
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 by shifting particular error-subsequences. In this case, if the identical shifts occur in the corresponding 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 :
convolutional codes; matrix algebra; parity check codes; trellis codes; code path; code-error-trellis reduction; convolutional code; error path; generator matrix; matrices reduction; parity check matrix; particular error-subsequence; shifted code-error-subsequence; Complexity theory; Convolutional codes; Decoding; Educational institutions; Electronic mail; Generators; Parity check codes;
Conference_Titel :
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location :
St. Petersburg
Print_ISBN :
978-1-4577-0596-0
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2011.6034012