Minimal Code(Error)-Trellis Module Construction for Rate-k/n Convolutional Codes : Extension of Yamada-Harashima-Miyakawa's Construction
-
- TAJIMA Masato
- Department of Intellectual Information Systems Engineering, University of Toyama
-
- OKINO Koji
- Information Technology Center, University of Toyama
-
- MIYAGOSHI Takashi
- Department of Intellectual Information Systems Engineering, University of Toyama
この論文をさがす
抄録
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.
収録刊行物
-
- IEICE transactions on fundamentals of electronics, communications and computer sciences
-
IEICE transactions on fundamentals of electronics, communications and computer sciences 90 (11), 2629-2634, 2007-11-01
一般社団法人電子情報通信学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1571698602521907072
-
- NII論文ID
- 110007538005
-
- NII書誌ID
- AA10826239
-
- ISSN
- 09168508
-
- 本文言語コード
- en
-
- データソース種別
-
- CiNii Articles