Gaussian intersymbol interference channels with mismatch

Wasim Huleihel, Salman Salamatian, Neri Merhav, Muriel Medard

Research output: Contribution to journalArticlepeer-review


This paper considers the problem of channel coding over Gaussian intersymbol interference (ISI) channels with a given decoding rule. Specifically, it is assumed that the mismatched decoder has an incorrect assumption on the channel impulse response. The mismatch capacity is the highest achievable rate for a given decoding rule. The existing achievable rates for channels and decoding metrics with memory (as in our model) are currently available only in the form of multi-letter expressions that cannot be calculated. Consequently, they provide little insight on the mismatch problem. In this paper, we derive the computable formulas of achievable rates and discuss some implications of our results. Our achievable rates are based on two ensembles: The ensemble of codewords generated by an autoregressive process and the ensemble of codewords drawn uniformly over a 'type class' of real-valued sequences. We provide a few numerical results of our achievable rates, as functions of the mismatched ISI parameters. Finally, we compare our results with universal decoders which are designed outside the true class of channels that we consider in this paper.

Original languageEnglish
Article number8643966
Pages (from-to)4499-4517
Number of pages19
JournalIEEE Transactions on Information Theory
Issue number7
StatePublished - Jul 2019


  • Mismatch capacity
  • error exponent
  • intersymbol interference
  • mismatch decoding


Dive into the research topics of 'Gaussian intersymbol interference channels with mismatch'. Together they form a unique fingerprint.

Cite this