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

Search this article

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.

Journal

  • IEICE Trans. Fundamentals, A

    IEICE Trans. Fundamentals, A 90 (11), 2629-2634, 2007-11-01

    The Institute of Electronics, Information and Communication Engineers

Citations (3)*help

See more

References(23)*help

See more

Details 詳細情報について

  • CRID
    1571698602521907072
  • NII Article ID
    110007538005
  • NII Book ID
    AA10826239
  • ISSN
    09168508
  • Text Lang
    en
  • Data Source
    • CiNii Articles

Report a problem

Back to top