Gaussian ISI channels with mismatch

This paper considers the problem of channel coding over Gaussian intersymbol interference (ISI) channels with a given (possibly suboptimal) metric decoding rule. Specifically, it is assumed that the mismatched decoder has incorrect knowledge of the ISI coefficients (or, the impulse response function). The mismatch capacity is the highest achievable rate for a given decoding rule. Unfortunately, existing lower bounds to the mismatch capacity for multi-letter channels and decoding metrics (or, channels and decoding metrics with memory), as in our model, are presented only in the form of multi-letter expressions, and thus cannot be calculated in practice. In this paper, we derive a computable single-letter lower bound to the mismatch capacity, and discuss some implications of our results.

[1]  Sergio Verdú,et al.  Gaussian multiaccess channels with ISI: Capacity region and multiuser water-filling , 1993, IEEE Trans. Inf. Theory.

[2]  Irvin G. Stiglitz,et al.  Coding for a class of unknown channels , 1966, IEEE Trans. Inf. Theory.

[3]  Imre Csiszár,et al.  Channel capacity for a given decoding metric , 1995, IEEE Trans. Inf. Theory.

[4]  Neri Merhav Erasure/List Exponents for Slepian-Wolf Decoding , 2014, IEEE Trans. Inf. Theory.

[5]  Imre Csiszár,et al.  Graph decomposition: A new key to coding theorems , 1981, IEEE Trans. Inf. Theory.

[6]  Anelia Somekh-Baruch A General Formula for the Mismatch Capacity , 2015, IEEE Trans. Inf. Theory.

[7]  Neri Merhav Universal decoding for memoryless Gaussian channels with a deterministic interference , 1993, IEEE Trans. Inf. Theory.

[8]  Emre Telatar,et al.  Mismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit , 2000, IEEE Trans. Inf. Theory.

[9]  Albert Guillén i Fàbregas,et al.  Mismatched Decoding: Error Exponents, Second-Order Rates and Saddlepoint Approximations , 2013, IEEE Transactions on Information Theory.

[10]  Neri Merhav,et al.  Relations Between Random Coding Exponents and the Statistical Physics of Random Codes , 2007, IEEE Transactions on Information Theory.

[11]  Shlomo Shamai,et al.  On information rates for mismatched decoders , 1994, IEEE Trans. Inf. Theory.

[12]  Neri Merhav,et al.  Random Coding Error Exponents for the Two-User Interference Channel , 2015, IEEE Transactions on Information Theory.

[13]  Prakash Narayan,et al.  Reliable Communication Under Channel Uncertainty , 1998, IEEE Trans. Inf. Theory.

[14]  Neri Merhav,et al.  Universal decoding for Gaussian intersymbol interference channels , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[15]  Neri Merhav Exact Random Coding Error Exponents of Optimal Bin Index Decoding , 2014, IEEE Transactions on Information Theory.

[16]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[17]  Masahito Hayashi,et al.  Information Spectrum Approach to Second-Order Coding Rate in Channel Coding , 2008, IEEE Transactions on Information Theory.