On a Class of Time-Varying Gaussian ISI Channels

This paper studies a class of stochastic and time-varying Gaussian intersymbol interference (ISI) channels. The i channel tap during time slot t is uniformly distributed over an interval of centre ci and radius ri. The array of channel taps is independent along both t and i. The channel state information is unavailable at both the transmitter and the receiver. Lower and upper bounds are derived on the White-Gaussian-Input (WGI) capacity CWGI for arbitrary values of the radii ri. It is shown that CWGI does not scale with the average input power. The proposed lower bound is achieved by a joint-typicality decoder that is tuned to a set of candidates for the channel matrix. This set forms a net that covers the range of the random channel matrix and its resolution is optimized in order to yield the largest achievable rate. Tools in matrix analysis such as Weyl’s inequality on perturbation of eigenvalues of symmetric matrices are used in order to analyze the probability of error. Index Terms Intersymbol Interference, Time-Varying Channels, White-Gaussian-Input Capacity, Joint-Typicality Decoding.

[1]  Thomas M. Cover,et al.  Gaussian feedback capacity , 1989, IEEE Trans. Inf. Theory.

[2]  Are Hjørungnes,et al.  Complex-Valued Matrix Differentiation: Techniques and Key Results , 2007, IEEE Transactions on Signal Processing.

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

[4]  Neri Merhav,et al.  Universal Decoding for Gaussian Intersymbol Interference Channels , 2015, IEEE Transactions on Information Theory.

[5]  R. Gallager Information Theory and Reliable Communication , 1968 .

[6]  Shlomo Shamai,et al.  Fading channels: How perfect need "Perfect side information" be? , 2002, IEEE Trans. Inf. Theory.

[7]  Jacob Ziv,et al.  Universal decoding for finite-state channels , 1985, IEEE Trans. Inf. Theory.

[8]  H. Alzer Inequalities for the gamma function , 1999 .

[9]  Amos Lapidoth,et al.  Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels , 2003, IEEE Trans. Inf. Theory.

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

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

[12]  Suhas N. Diggavi,et al.  On achievable performance of spatial diversity fading channels , 1998, IEEE Trans. Inf. Theory.

[13]  Meir Feder,et al.  Universal Decoding for Channels with Memory , 1998, IEEE Trans. Inf. Theory.

[14]  Shlomo Shamai,et al.  Comparison of the Achievable Rates in OFDM and Single Carrier Modulation with I.I.D. Inputs , 2013, IEEE Transactions on Information Theory.

[15]  Andrea J. Goldsmith,et al.  Capacity of Time-Varying Channels With Causal Channel Side Information , 1997, IEEE Transactions on Information Theory.

[16]  Neri Merhav,et al.  Universal composite hypothesis testing: A competitive minimax approach , 2002, IEEE Trans. Inf. Theory.

[17]  Shlomo Shamai,et al.  Lower Bounds and Approximations for the Information Rate of the ISI Channel , 2014, IEEE Transactions on Information Theory.

[18]  Robert M. Gray,et al.  Toeplitz and Circulant Matrices: A Review , 2005, Found. Trends Commun. Inf. Theory.