TY - JOUR
T1 - Capacity of cognitive interference channels with and without secrecy
AU - Liang, Yingbin
AU - Somekh-Baruch, Anelia
AU - Poor, H. Vincent
AU - Shamai, Shlomo
AU - Verdú, Sergio
N1 - Funding Information:
Manuscript received December 18, 2007; revised September 30, 2008. Current version published February 04, 2009. The material in this paper was presented in part at the 45th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, September 2007. The work of Y. Liang and H. V. Poor was supported by the National Science Foundation under Grants ANI-03-38807, CNS-06-25637, and CCF-07-28208. The work of A. Somekh-Baruch was supported by a Marie Curie Outgoing International Fellowship within the 6th European Community Framework Programme. The work of S. Shamai and S. Verdú was supported by the US–Israel Binational Science Foundation. The work of S. Verdú was also supported by the National Science Foundation under Grant CCF-0635154.
Funding Information:
Dr. Somekh-Baruch received the Tel-Aviv University program for outstanding B.Sc. students scholarship, the Viterbi scholarship, the Rothschild foundation scholarship for postdoctoral studies, and the Marie Curie Outgoing International Fellowship.
PY - 2009
Y1 - 2009
N2 - 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 noncognitive 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.
AB - 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 noncognitive 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.
KW - Capacity-equivocation region
KW - Cognitive communication
KW - Confidential messages
KW - Interference channel
KW - Rate splitting
KW - Secrecy capacity region
UR - http://www.scopus.com/inward/record.url?scp=61349186445&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=61349186445&partnerID=8YFLogxK
U2 - 10.1109/TIT.2008.2009584
DO - 10.1109/TIT.2008.2009584
M3 - Article
AN - SCOPUS:61349186445
SN - 0018-9448
VL - 55
SP - 604
EP - 619
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 2
ER -