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
Dalam kertas ini, kami melanjutkan pembinaan ralat-trellis konvensional untuk kod konvolusi kepada kes di mana matriks semakan yang diberikan H(D) mempunyai faktor Dl dalam beberapa lajur (baris). Dalam kes pertama, terdapat kemungkinan saiz ruang keadaan boleh dikurangkan menggunakan urutan ralat beralih, manakala dalam kes kedua, saiz ruang keadaan boleh dikurangkan menggunakan urutan sindrom beralih. Pembinaan yang dibentangkan dalam kertas ini adalah berdasarkan kesedaran bersebelahan yang jelas tentang bekas sindrom yang sepadan HT(D). Dalam kes di mana semua lajur dan baris H(D) adalah bebas kelewatan, pembinaan yang dicadangkan dikurangkan kepada pembinaan konvensional Schalkwijk et al. Kami juga menunjukkan bahawa pembinaan yang dicadangkan dapat merealisasikan pengurangan ruang keadaan yang ditunjukkan oleh Ariel et al. Selain itu, kami menjelaskan perbezaan antara pembinaan mereka dan pembinaan kami menggunakan contoh.
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.
Salinan
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
Salinan
@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},}
Salinan
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 -