Disproof of the Shamai-Laroia conjecture

We prove that the conjectured Shamai-Laroia lower bound for the maximum achievable rate in the intersymbol interference channel does not hold. It is shown that in the low SNR regime, the opposite to the conjecture is true, for all ISI channels and essentially all input distributions. Using insights obtained from this proof, we construct a clear counterexample to the conjecture.

[1]  Hans-Andrea Loeliger,et al.  On the information rate of binary-input channels with memory , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[2]  Parastoo Sadeghi,et al.  Optimization of Information Rate Upper and Lower Bounds for Channels With Memory , 2007, IEEE Transactions on Information Theory.

[3]  R. Gray.  Entropy and Information Theory , 1990, Springer New York.

[4]  Shlomo Shamai,et al.  Estimation in Gaussian Noise: Properties of the Minimum Mean-Square Error , 2010, IEEE Transactions on Information Theory.

[5]  Dario Fertonani,et al.  Lower bounds on the information rate of intersymbol interference channels based on the Ungerboeck observation model , 2009, 2009 IEEE International Symposium on Information Theory.

[6]  Xiao Ma,et al.  Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds , 2003, IEEE Transactions on Information Theory.

[7]  James L. Massey,et al.  Capacity of the discrete-time Gaussian channel with intersymbol interference , 1988, IEEE Trans. Inf. Theory.

[8]  Shlomo Shamai,et al.  Mutual information and minimum mean-square error in Gaussian channels , 2004, IEEE Transactions on Information Theory.

[9]  John M. Cioffi,et al.  MMSE decision-feedback equalizers and coding. I. Equalization results , 1995, IEEE Trans. Commun..

[10]  Jaekyun Moon,et al.  Easily Computed Lower Bounds on the Information Rate of Intersymbol Interference Channels , 2011, IEEE Transactions on Information Theory.

[11]  John G. Proakis,et al.  Digital Communications , 1983 .

[12]  Lizhong Zheng,et al.  A Coordinate System for Gaussian Networks , 2010, IEEE Transactions on Information Theory.

[13]  Shlomo Shamai,et al.  Information rates for a discrete-time Gaussian channel with intersymbol interference and stationary inputs , 1991, IEEE Trans. Inf. Theory.

[14]  Paul H. Siegel,et al.  On the achievable information rates of finite state ISI channels , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[15]  Shlomo Shamai,et al.  The intersymbol interference channel: lower bounds on capacity and channel precoding loss , 1996, IEEE Trans. Inf. Theory.

[16]  Wei Zeng,et al.  Simulation-Based Computation of Information Rates for Channels With Memory , 2006, IEEE Transactions on Information Theory.

[17]  Ib N. Andersen,et al.  Sample-whitened matched filters , 1973, IEEE Trans. Inf. Theory.

[18]  Milica Stojanovic,et al.  Bounds on the Information Rate for Sparse Channels with Long Memory and i.u.d. Inputs , 2011, IEEE Transactions on Communications.