Capacity Bounds and Exact Results for the Cognitive Z-Interference Channel

We study the discrete memoryless Z-interference channel where the transmitter of the pair that suffers from interference is cognitive. We first provide an outer bound on the capacity region of this channel. We then show that, when the channel of the transmitter-receiver pair that does not experience interference is deterministic and invertible, our proposed outer bound matches the best known inner bound. The obtained results imply that in the considered channel, superposition encoding at the noncognitive transmitter as well as Gel'fand-Pinsker encoding at the cognitive transmitter is needed in order to minimize the impact of interference. As a byproduct of the obtained capacity region, we obtain the capacity under the generalized Gel'fand-Pinsker setting where a transmitter-receiver pair communicates in the presence of interference noncausally known at the encoder.

[1]  Shlomo Shamai,et al.  On the Capacity of a Class of Cognitive Z-Interference Channels , 2011, 2011 IEEE International Conference on Communications (ICC).

[2]  Yi Cao,et al.  Interference channel with one cognitive transmitter , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

[3]  Daniela Tuninetti,et al.  New Inner and Outer Bounds for the Memoryless Cognitive Interference Channel and Some New Capacity Results , 2011, IEEE Transactions on Information Theory.

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

[5]  Jinhua Jiang,et al.  Ieee Transactions on Information Theory (accepted) on the Achievable Rate Regions for Interference Channels with Degraded Message Sets , 2022 .

[6]  Pramod Viswanath,et al.  Cognitive Radio: An Information-Theoretic Perspective , 2009, IEEE Transactions on Information Theory.

[7]  Rudolf Ahlswede,et al.  Codes with the Identifiable Parent Property and the Multiple-Access Channel , 2005, GTIT-C.

[8]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[9]  Gerhard Kramer,et al.  A New Outer Bound and the Noisy-Interference Sum–Rate Capacity for Gaussian Interference Channels , 2007, IEEE Transactions on Information Theory.

[10]  Venugopal V. Veeravalli,et al.  Gaussian Interference Networks: Sum Capacity in the Low-Interference Regime and New Outer Bounds on the Capacity Region , 2008, IEEE Transactions on Information Theory.

[11]  Mojtaba Vaezi,et al.  On the capacity of the cognitive Z-interference channel , 2011, 2011 12th Canadian Workshop on Information Theory.

[12]  Shlomo Shamai,et al.  Capacity of Cognitive Interference Channels With and Without Secrecy , 2009, IEEE Transactions on Information Theory.

[13]  Amir K. Khandani,et al.  Capacity bounds for the Gaussian Interference Channel , 2008, 2008 IEEE International Symposium on Information Theory.

[14]  Sriram Vishwanath,et al.  On the Capacity of a Class of MIMO Cognitive Radios , 2007, IEEE Journal of Selected Topics in Signal Processing.

[15]  Wei Wu,et al.  Capacity of a Class of Cognitive Radio Channels: Interference Channels With Degraded Message Sets , 2007, IEEE Transactions on Information Theory.

[16]  Daniela Tuninetti,et al.  New results on the capacity of the Gaussian cognitive interference channel , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[17]  Sriram Vishwanath,et al.  On the Capacity of a Class of MIMO Cognitive Radios , 2007 .

[18]  S. Shamai,et al.  On the Capacity of Interference Channels with a Cognitive Transmitter , 2007, 2007 Information Theory and Applications Workshop.

[19]  János Körner,et al.  General broadcast channels with degraded message sets , 1977, IEEE Trans. Inf. Theory.

[20]  Daniela Tuninetti,et al.  A new capacity result for the Z-Gaussian cognitive interference channel , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[21]  Abbas El Gamal,et al.  Lecture Notes on Network Information Theory , 2010, ArXiv.

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

[23]  Junshan Zhang,et al.  A New Achievable Rate Region for Interference Channels with Common Information , 2007, 2007 IEEE Wireless Communications and Networking Conference.

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

[25]  Mahtab Mirmohseni,et al.  Capacity regions for some classes of Causal Cognitive Interference Channels with delay , 2010, 2010 IEEE Information Theory Workshop.

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

[27]  János Körner,et al.  Images of a set via two channels and their role in multi-user communication , 1977, IEEE Trans. Inf. Theory.

[28]  G. Kramer,et al.  Review of Rate Regions for Interference Channels , 2006, 2006 International Zurich Seminar on Communications.

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

[30]  Andrea J. Goldsmith,et al.  Capacity Regions and Bounds for a Class of Z-Interference Channels , 2009, IEEE Transactions on Information Theory.

[31]  Shlomo Shamai,et al.  On the capacity of interference channels with one cooperating transmitter , 2007, Eur. Trans. Telecommun..

[32]  Patrick Mitran,et al.  Achievable rates in cognitive radio channels , 2006, IEEE Transactions on Information Theory.

[33]  Max H. M. Costa,et al.  The capacity region of a class of deterministic interference channels , 1982, IEEE Trans. Inf. Theory.

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

[35]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.