Capacity of Cognitive Interference Channels With and Without Secrecy
Authors:
- Yingbin LiangYLYingbin Liang
- Anelia Somekh-BaruchASAnelia Somekh-Baruch
- H. Vincent PoorH. Vincent Poor
- Shlomo ShamaiShlomo Shamai
- Sergio VerduSVSergio Verdu
- 6 February 2009
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 55 (2) , 604-619
Abstract
Like the conventional two-user interference channel, the cognitive interference channel consists of two transmitters whose signals interfere at two receivers. It is assumed that there is a common message (message 1) known to both transmitters, and an additional independent message (message 2) known only to the cognitive transmitter (transmitter 2). The cognitive receiver (receiver 2) needs to decode messages 1 and 2, while the non cognitive receiver (receiver 1) should decode only message 1. Furthermore, message 2 is assumed to be a confidential message which needs to be kept as secret as possible from receiver 1, which is viewed as an eavesdropper with regard to message 2. The level of secrecy is measured by the equivocation rate. In this paper, a single-letter expression for the capacity-equivocation region of the discrete memoryless cognitive interference channel is obtained. The capacity-equivocation region for the Gaussian cognitive interference channel is also obtained explicitly. Moreover, particularizing the capacity-equivocation region to the case without a secrecy constraint, the capacity region for the two-user cognitive interference channel is obtained, by providing a converse theorem.Keywords
This publication has 19 references indexed in Scilit:
- Gaussian Interference Channel Capacity to Within One BitIEEE Transactions on Information Theory, 2008
- On the Capacity of Interference Channels with a Cognitive Transmitter2007
- Review of Rate Regions for Interference Channels2006
- On Achievable Rate Regions for the Gaussian Interference ChannelIEEE Transactions on Information Theory, 2004
- A new achievable rate region for the interference channelIEEE Transactions on Information Theory, 1981
- Broadcast channels with confidential messagesIEEE Transactions on Information Theory, 1978
- Interference channelsIEEE Transactions on Information Theory, 1978
- General broadcast channels with degraded message setsIEEE Transactions on Information Theory, 1977
- The Wire-Tap ChannelBell System Technical Journal, 1975
- A Coding Theorem for Multiple Access Channels With Correlated SourcesBell System Technical Journal, 1973