• DocumentCode
    1888761
  • Title

    A class of F-ary convolutional codes for finite state ISI channels

  • Author

    Park, Chan-Kyung ; Welch, Lloyd R.

  • Author_Institution
    Commun. Sci. Inst., Univ. of Southern California, Los Angeles, CA, USA
  • Volume
    1
  • fYear
    1998
  • fDate
    18-21 Oct 1998
  • Firstpage
    123
  • Abstract
    This paper presents F-ary convolutional codes for optimal decoding of pulse-amplitude-modulated (PAM) sequences over noisy finite intersymbol interference (ISI) channels. We refer to this new class of codes as `optimal convolutional codes´ (OCCs) for a channel in the sense of maximizing the minimum Euclidean Distance (ED), dmin, between channel output sequences corresponding to distinct input message sequences at the Viterbi detector, super-trellis of convolutional encoder and channel. Due to the mismatch between the base fields of the convolutional encoder and channel, without resorting to analytical methods, an exhaustive computer search algorithm is proposed on a set of convolutional encoders, called `standard trellis´, which have a specific structure in common. This trellis structure offers good properties in finding dmin of a code associated with a given encoder. This search scheme, as an example, is applied to the 1+4D+D2 channel, and search results have shown that the coding gains achieved are comparable to those of the best convolutional codes in a perfect response channel. To overcome the high computational complexity of optimal MLSE decoding, a new simple and efficient reduced state suboptimal decoding algorithm is also suggested
  • Keywords
    Viterbi decoding; Viterbi detection; channel coding; computational complexity; convolutional codes; intersymbol interference; maximum likelihood decoding; pulse amplitude modulation; search problems; sequential decoding; trellis codes; F-ary convolutional codes; Viterbi decoding; Viterbi detector; channel output sequences; coding gains; computational complexity; convolutional encoder; efficient reduced state suboptimal decoding algorithm; exhaustive computer search algorithm; input message sequences; intersymbol interference; minimum Euclidean Distance; noisy finite state ISI channels; optimal MLSE decoding; optimal convolutional codes; optimal decoding; perfect response channel; pulse-amplitude-modulated sequences; standard trellis; super-trellis; Convolutional codes; Decoding; Detectors; Euclidean distance; Intersymbol interference; Linear systems; Maximum likelihood estimation; Modulation coding; Transfer functions; Viterbi algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Military Communications Conference, 1998. MILCOM 98. Proceedings., IEEE
  • Conference_Location
    Boston, MA
  • Print_ISBN
    0-7803-4506-1
  • Type

    conf

  • DOI
    10.1109/MILCOM.1998.722557
  • Filename
    722557