Error-Trellis Construction for Convolutional Codes Using Shifted Error/Syndrome-Subsequences
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we extend the conventional error-trellis construction for convolutional codes to the case where a given check matrix H(D) has a factor Dl in some column (row). In the first case, there is a possibility that the size of the state space can be reduced using shifted error-subsequences, whereas in the second case, the size of the state space can be reduced using shifted syndrome-subsequences. The construction presented in this paper is based on the adjoint-obvious realization of the corresponding syndrome former HT(D). In the case where all the columns and rows of H(D) are delay free, the proposed construction is reduced to the conventional one of Schalkwijk et al. We also show that the proposed construction can equally realize the state-space reduction shown by Ariel et al. Moreover, we clarify the difference between their construction and that of ours using examples.
- (社)電子情報通信学会の論文
- 2009-08-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