Simultaneous Code/Error-Trellis Reduction for Convolutional Codes Using Shifted Code/Error-Subsequences
スポンサーリンク
概要
- 論文の詳細を見る
In this letter, 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.
- The Institute of Electronics, Information and Communication Engineersの論文
- 2011-12-01
著者
-
Tajima Masato
Graduate School Of Science And Engineering University Of Toyama
-
Miyagoshi Takashi
Graduate School Of Science And Engineering University Of Toyama
-
Okino Koji
Information Technology Center University Of Toyama
関連論文
- Error-Trellis Construction for Convolutional Codes Using Shifted Error/Syndrome-Subsequences
- Minimal Code (Error)-Trellis Module Construction for Rate-k/n Convolutional Codes : Extension of Yamada-Harashima-Miyakawa's Construction(Coding Theory)
- State-Complexity Reduction for Convolutional Codes Using Trellis-Module Integration(Coding Theory,Information Theory and Its Applications)
- Simultaneous Code/Error-Trellis Reduction for Convolutional Codes Using Shifted Code/Error-Subsequences