Lattice strategies for the ergodic fading dirty paper channel

A modified version of Costa's dirty paper channel is studied, in which both the input signal and the state experience stationary and ergodic time-varying fading. The fading coefficients are assumed to be known exclusively at the receiver. An inner bound of the achievable rates using lattice codes is derived and compared to an outer bound of the capacity. For a wide range of fading distributions, the gap to capacity is within a constant value that does not depend on either the power of the input signal or the state. The results presented in this paper are applied to a class of ergodic fading broadcast channels with receive channel state information, where the achievable rate region is shown to be close to capacity under certain configurations.

[1]  Andrea J. Goldsmith,et al.  Capacity and optimal resource allocation for fading broadcast channels - Part I: Ergodic capacity , 2001, IEEE Trans. Inf. Theory.

[2]  Susan A. Murphy,et al.  Monographs on statistics and applied probability , 1990 .

[3]  Meir Feder,et al.  On lattice quantization noise , 1996, IEEE Trans. Inf. Theory.

[4]  Shlomo Shamai,et al.  Capacity and lattice strategies for canceling known interference , 2005, IEEE Transactions on Information Theory.

[5]  Shlomo Shamai,et al.  On two-user fading gaussian broadcast channels with perfect channel state information at the receivers , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[6]  Aria Nosratinia,et al.  Approaching the ergodic capacity with lattice coding , 2014, 2014 IEEE Global Communications Conference.

[7]  Uri Erez,et al.  Achieving 1/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding , 2004, IEEE Transactions on Information Theory.

[8]  Hans-Andrea Loeliger,et al.  Averaging bounds for lattices and linear codes , 1997, IEEE Trans. Inf. Theory.

[9]  Claude E. Shannon,et al.  Channels with Side Information at the Transmitter , 1958, IBM J. Res. Dev..

[10]  Syed Ali Jafar.  Capacity With Causal and Noncausal Side Information: A Unified View , 2006, IEEE Transactions on Information Theory.

[11]  Roy D. Yates,et al.  Fading broadcast channels with state information at the receivers , 2009, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[12]  Tetsunao Matsuta,et al.  国際会議開催報告:2013 IEEE International Symposium on Information Theory , 2013 .

[13]  Yuval Kochman,et al.  Lattice Coding for Signals and Networks: Side-information problems , 2014 .

[14]  Sriram Vishwanath,et al.  The two-user Gaussian fading broadcast channel , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[15]  Shlomo Shamai,et al.  On the dirty paper channel with fast fading dirt , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[16]  Milton Abramowitz,et al.  Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .