• DocumentCode
    1992676
  • Title

    Reduced complexity super-trellis decoding for convolutionally encoded transmission over ISI-channels

  • Author

    Schuh, Fabian ; Schenk, Andreas ; Huber, Johannes B.

  • Author_Institution
    Inst. for Inf. Transm., Friedrich-Alexander-Univ. Erlangen-Nurnberg, Erlangen-Nürnberg, Germany
  • fYear
    2013
  • fDate
    28-31 Jan. 2013
  • Firstpage
    484
  • Lastpage
    489
  • Abstract
    In this paper we propose a matched encoding (ME) scheme for convolutionally encoded transmission over intersymbol interference (usually called ISI) channels. A novel trellis description enables to perform equalization and decoding jointly, i.e., enables efficient super-trellis decoding. By means of this matched non-linear trellis description we can significantly reduce the number of states needed for the receiver-side Viterbi algorithm to perform maximum-likelihood sequence estimation. Further complexity reduction is achieved using the concept of reduced-state sequence estimation.
  • Keywords
    Viterbi decoding; channel coding; convolutional codes; equalisers; intersymbol interference; maximum likelihood decoding; maximum likelihood sequence estimation; nonlinear codes; trellis codes; ISI-channel; ME; convolutionally encoded transmission; decoding; equalization; intersymbol interference channel; matched encoding scheme; matched nonlinear trellis description; maximum-likelihood sequence estimation; receiver-side Viterbi algorithm; reduced complexity super-trellis decoding; reduced-state sequence estimation; Complexity theory; Convolution; Convolutional codes; Maximum likelihood decoding; Modulation; Receivers; ISI-channel; convolutionally encoded transmission; matched decoding; reduced state sequence estimation; super-trellis decoding; trellis-coded modulation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computing, Networking and Communications (ICNC), 2013 International Conference on
  • Conference_Location
    San Diego, CA
  • Print_ISBN
    978-1-4673-5287-1
  • Electronic_ISBN
    978-1-4673-5286-4
  • Type

    conf

  • DOI
    10.1109/ICCNC.2013.6504133
  • Filename
    6504133