On the Achievable Rate-Regions for State-Dependent Gaussian Interference Channel

In this paper, we study a general additive state-dependent Gaussian interference channel (ASD-GIC) where we consider two-user interference channel with two independent states known non-causally at both transmitters, but unknown to either of the receivers. An special case, where the additive states over the two links are the same is studied in [1], [2], in which it is shown that the gap between the achievable symmetric rate and the upper bound is less than 1/4 bit for the strong interference case. Here, we also consider the case where each channel state has unbounded variance [3], which is referred to as the strong interferences. We first obtain an outer bound on the capacity region. By utilizing lattice-based coding schemes, we obtain four achievable rate regions. Depend on noise variance and channel power constraint, achievable rate regions can coincide with the channel capacity region. For the symmetric model, the achievable sum-rate reaches to within 0.661 bit of the channel capacity for signal to noise ratio (SNR) greater than one.

[1]  I-Hsiang Wang.  Approximate Capacity of the Dirty Multiple-Access Channel With Partial State Information at the Encoders , 2012, IEEE Transactions on Information Theory.

[2]  Igal Sason,et al.  On achievable rate regions for the Gaussian interference channel , 2004, IEEE Transactions on Information Theory.

[3]  Aylin Yener,et al.  The Gaussian Interference Relay Channel: Improved Achievable Rates and Sum Rate Upperbounds Using a Potent Relay , 2011, IEEE Transactions on Information Theory.

[4]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[5]  Aydano B. Carleial,et al.  A case where interference does not reduce capacity (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[6]  Michael Gastpar,et al.  Compute-and-Forward: Harnessing Interference Through Structured Codes , 2009, IEEE Transactions on Information Theory.

[7]  Hua Wang,et al.  Gaussian Interference Channel Capacity to Within One Bit , 2007, IEEE Transactions on Information Theory.

[8]  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.

[9]  Roy D. Yates,et al.  Capacity of Interference Channels With Partial Transmitter Cooperation , 2007, IEEE Transactions on Information Theory.

[10]  Hiroshi Sato,et al.  The capacity of the Gaussian interference channel under strong interference , 1981, IEEE Trans. Inf. Theory.

[11]  Yi Cao,et al.  An Achievable Rate Region for Interference Channels with Conferencing , 2007, 2007 IEEE International Symposium on Information Theory.

[12]  Gregory Poltyrev,et al.  On coding without restrictions for the AWGN channel , 1993, IEEE Trans. Inf. Theory.

[13]  Lili Zhang,et al.  Gaussian Interference Channel with State Information , 2013, IEEE Transactions on Wireless Communications.

[14]  Lili Zhang,et al.  Interference Channel with State Information , 2011, ArXiv.

[15]  David Tse,et al.  Feedback Capacity of the Gaussian Interference Channel to Within 2 Bits , 2010, IEEE Transactions on Information Theory.

[16]  Hamid Behroozi,et al.  On the sum-capacity and lattice-based transmission strategies for state-dependent Gaussian interference channel , 2012, 2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC).

[17]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[18]  W. Fischer,et al.  Sphere Packings, Lattices and Groups , 1990 .

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

[20]  Vinod M. Prabhakaran,et al.  Interference Channels With Source Cooperation , 2009, IEEE Transactions on Information Theory.

[21]  Aydano B. Carleial,et al.  Interference channels , 1978, IEEE Trans. Inf. Theory.

[22]  Uri Erez,et al.  Lattice Strategies for the Dirty Multiple Access Channel , 2007, IEEE Transactions on Information Theory.

[23]  Simon Litsyn,et al.  Lattices which are good for (almost) everything , 2005, IEEE Transactions on Information Theory.

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

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

[26]  Te Sun Han,et al.  A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.

[27]  Lili Zhang,et al.  Symmetric Gaussian interference channel with state information , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[28]  R. Zamir.  Lattices are everywhere , 2009, 2009 Information Theory and Applications Workshop.

[29]  Claude E. Shannon,et al.  Two-way Communication Channels , 1961 .

[30]  G. David Forney,et al.  On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener , 2004, ArXiv.