Minimal Code(Error)-Trellis Module Construction for Rate-k/n Convolutional Codes: Extension of Yamada-Harashima-Miyakawa's Construction
Summary :
Yamada, Harashima, and Miyakawa proposed to use a trellis constructed based on a syndrome former for the purpose of Viterbi decoding of rate-(n-1)/n convolutional codes. In this paper, we extend their code-trellis construction to general rate-k/n convolutional codes. We show that the extended construction is equivalent to the one proposed by Sidorenko and Zyablov. Moreover, we show that the proposed method can also be applied to an error-trellis construction with minor modification.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E90-A No.11 pp.2629-2634
- Publication Date
- 2007/11/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e90-a.11.2629
- Type of Manuscript
- LETTER
- Category
- Coding Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Masato TAJIMA, Koji OKINO, Takashi MIYAGOSHI, "Minimal Code(Error)-Trellis Module Construction for Rate-k/n Convolutional Codes: Extension of Yamada-Harashima-Miyakawa's Construction" in IEICE TRANSACTIONS on Fundamentals,
vol. E90-A, no. 11, pp. 2629-2634, November 2007, doi: 10.1093/ietfec/e90-a.11.2629.
Abstract: Yamada, Harashima, and Miyakawa proposed to use a trellis constructed based on a syndrome former for the purpose of Viterbi decoding of rate-(n-1)/n convolutional codes. In this paper, we extend their code-trellis construction to general rate-k/n convolutional codes. We show that the extended construction is equivalent to the one proposed by Sidorenko and Zyablov. Moreover, we show that the proposed method can also be applied to an error-trellis construction with minor modification.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.11.2629/_p
Copy
@ARTICLE{e90-a_11_2629,
author={Masato TAJIMA, Koji OKINO, Takashi MIYAGOSHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Minimal Code(Error)-Trellis Module Construction for Rate-k/n Convolutional Codes: Extension of Yamada-Harashima-Miyakawa's Construction},
year={2007},
volume={E90-A},
number={11},
pages={2629-2634},
abstract={Yamada, Harashima, and Miyakawa proposed to use a trellis constructed based on a syndrome former for the purpose of Viterbi decoding of rate-(n-1)/n convolutional codes. In this paper, we extend their code-trellis construction to general rate-k/n convolutional codes. We show that the extended construction is equivalent to the one proposed by Sidorenko and Zyablov. Moreover, we show that the proposed method can also be applied to an error-trellis construction with minor modification.},
keywords={},
doi={10.1093/ietfec/e90-a.11.2629},
ISSN={1745-1337},
month={November},}
Copy
TY - JOUR
TI - Minimal Code(Error)-Trellis Module Construction for Rate-k/n Convolutional Codes: Extension of Yamada-Harashima-Miyakawa's Construction
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2629
EP - 2634
AU - Masato TAJIMA
AU - Koji OKINO
AU - Takashi MIYAGOSHI
PY - 2007
DO - 10.1093/ietfec/e90-a.11.2629
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E90-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2007
AB - Yamada, Harashima, and Miyakawa proposed to use a trellis constructed based on a syndrome former for the purpose of Viterbi decoding of rate-(n-1)/n convolutional codes. In this paper, we extend their code-trellis construction to general rate-k/n convolutional codes. We show that the extended construction is equivalent to the one proposed by Sidorenko and Zyablov. Moreover, we show that the proposed method can also be applied to an error-trellis construction with minor modification.
ER -
English
