Minimal Code(Error)-Trellis Module Construction for Rate-k/n Convolutional Codes: Extension of Yamada-Harashima-Miyakawa's Construction

Masato TAJIMA  Koji OKINO  Takashi MIYAGOSHI  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E90-A   No.11   pp.2629-2634
Publication Date: 2007/11/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e90-a.11.2629
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Coding Theory
convolutional codes,  syndrome former,  minimal code(error)-trellis module,  trellis complexity,  

Full Text: PDF>>
Buy this Article

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.