The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
본 논문에서는 컨벌루션 코드에 대한 기존의 오류 격자 구조를 주어진 검사 행렬이 있는 경우로 확장합니다. H(D) 요인이 있습니다 Dl 일부 열(행)에서. 첫 번째 경우에는 Shifted Error-Subsequence를 이용하여 상태공간의 크기를 줄일 수 있는 가능성이 있고, 두 번째 경우에는 Shifted Syndrome-Subsequence를 이용하여 상태공간의 크기를 줄일 수 있을 가능성이 있다. 본 논문에서 제시된 구성은 해당 증후군 형성기의 인접-명백한 실현을 기반으로 합니다. HT(D). 모든 열과 행이 H(D) 지연이 없으므로 제안된 구성은 Schalkwijk et al.의 기존 구성으로 축소됩니다. 또한 제안된 구성이 Ariel et al.이 보여준 상태 공간 감소를 동일하게 실현할 수 있음을 보여줍니다. 또한 예제를 사용하여 해당 구성과 우리 구성의 차이점을 명확하게 설명합니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Masato TAJIMA, Koji OKINO, Takashi MIYAGOSHI, "Error-Trellis Construction for Convolutional Codes Using Shifted Error/Syndrome-Subsequences" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 8, pp. 2086-2096, August 2009, doi: 10.1587/transfun.E92.A.2086.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.2086/_p
부
@ARTICLE{e92-a_8_2086,
author={Masato TAJIMA, Koji OKINO, Takashi MIYAGOSHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Error-Trellis Construction for Convolutional Codes Using Shifted Error/Syndrome-Subsequences},
year={2009},
volume={E92-A},
number={8},
pages={2086-2096},
abstract={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.},
keywords={},
doi={10.1587/transfun.E92.A.2086},
ISSN={1745-1337},
month={August},}
부
TY - JOUR
TI - Error-Trellis Construction for Convolutional Codes Using Shifted Error/Syndrome-Subsequences
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2086
EP - 2096
AU - Masato TAJIMA
AU - Koji OKINO
AU - Takashi MIYAGOSHI
PY - 2009
DO - 10.1587/transfun.E92.A.2086
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2009
AB - 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.
ER -