Minimal Code(Error)-Trellis Module Construction for Rate-k/n Convolutional Codes: Extension of Yamada-Harashima-Miyakawa's Construction
Minimal Code(Error)-Trellis Module Construction for Rate-k/n Convolutional Codes: Extension of Yamada-Harashima-Miyakawa's Construction
复制标题
DOI：
10.1093/ietfec/e90-a.11.2629
复制
发表时间：
2007-11
期刊：
影响因子：
--
通讯作者：
M. Tajima;K. Okino;T. Miyagoshi
中科院分区：
文献类型：
--
作者：
M. Tajima;K. Okino;T. Miyagoshi
Yamada、Harashima和Miyakawa提出使用基于校正子形成器构造的网格用于速率为（n-1）/n的卷积码的Viterbi解码。在本文中，我们扩展他们的代码网格建设一般率k/n卷积码。我们证明了扩展构造等价于Sidorenko和Zyablov提出的构造。此外，我们表明，所提出的方法也可以应用到一个错误的网格结构进行微小的修改。
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.