Gaussian Intersymbol Interference Channels With Mismatch
Name
1706.05883.pdf
Description
Submitted version
Size
409.9 KB
Format
Unknown
Checksum (MD5)
21e211d55bd7f03448ccc84f91fdca4f
Author(s)
Huleihel, Wasim
Salamatian, Salman
Merhav, Neri
Medard, Muriel
Date Issued
2019
Journal
IEEE Transactions on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Version
Original manuscript
Abstract
© 1963-2012 IEEE. 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.
MIT Department
Massachusetts Institute of Technology. Research Laboratory of Electronics
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/TIT.2019.2900222
