Cognitive interference channel: achievable rate region and power allocation

被引:4
|
作者
Al-qudah, Zouhair [1 ]
Al Bataineh, Mohammad [2 ]
机构
[1] Al Hussein bin Talal Univ, Dept Elect & Commun Engn, Maan, Jordan
[2] Yarmouk Univ, Telecommun Engn Dept, Irbid, Jordan
关键词
channel coding; radiofrequency interference; Gaussian channels; resource allocation; zero-forcing dirty paper coding; Gelfand-Pinsker coding; superposition coding; Han-Kobayashi rate splitting coding scheme; Gaussian channel; discrete memoryless model; two-user interference channel; power allocation; achievable rate region; cognitive interference channel; GAUSSIAN INTERFERENCE; BROADCAST CHANNELS; CAPACITY; MITIGATION; RADIO;
D O I
10.1049/iet-com.2014.0802
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this study, the authors consider a state-dependent two user interference channel. The two users sharing the spectrum are assumed to be cognitive and each user has a non-causal access to the signal from the other user. For this channel model, an achievable rate region is established for both discrete memoryless model and Gaussian channel. In particular, the achievable rate region is obtained by combining Han-Kobayashi rate splitting coding scheme, superposition coding, Gelfand-Pinsker coding scheme and zero-forcing dirty paper coding. Furthermore, the sum rate maximisation and the associated power allocation problem are studied, numerically and theoretically. The corresponding numerical examples show that the proposed combined coding scheme outperforms the existing schemes in the sense of achievable rate region. Moreover, the effectiveness of the optimal power allocation between the two cognitive nodes is also shown.
引用
收藏
页码:249 / 257
页数:9
相关论文
共 50 条
  • [1] An Achievable Rate Region for the Cognitive Interference Channel With Causal Bidirectional Cooperation
    Li, Qian
    Li, Kwok Hung
    Teh, Kah Chan
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2010, 59 (04) : 1721 - 1728
  • [2] An Achievable Region for the Cognitive Interference Relay Channel
    Al-Qudah, Zouhair
    Rajan, Dinesh
    [J]. IEEE TRANSACTIONS ON COGNITIVE COMMUNICATIONS AND NETWORKING, 2018, 4 (04) : 665 - 676
  • [3] A NEW ACHIEVABLE RATE REGION FOR THE INTERFERENCE CHANNEL
    HAN, TS
    KOBAYASHI, K
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (01) : 49 - 60
  • [4] A new achievable rate region for the cognitive radio channel
    Jiang, Jinhua
    Xin, Yan
    [J]. 2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13, 2008, : 1055 - 1059
  • [5] An Achievable Rate Region for Gaussian Interference Channel with Intermittent Feedback
    Karakus, Can
    Wang, I-Hsiang
    Diggavi, Suhas
    [J]. 2013 51ST ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2013, : 203 - 210
  • [6] A new computable achievable rate region for the Gaussian interference channel
    Shang, Xiaohu
    Chen, Biao
    [J]. 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 2191 - 2195
  • [7] On the achievable rate region of Gaussian cognitive multiple access channel
    Cheng, Peng
    Yu, Guanding
    Zhang, Zhaoyang
    Chen, Hsiao-Hwa
    Qiu, Peiliang
    [J]. IEEE COMMUNICATIONS LETTERS, 2007, 11 (05) : 384 - 386
  • [8] Achievable Rate Region for uRLLC Interference Channel With Finite Blocklength Transmission
    Huang, Wei
    Xiao, Shifeng
    Wu, Lan
    Kai, Caihong
    He, Shiwen
    Li, Chunguo
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2023, 72 (07) : 8857 - 8868
  • [9] An Achievable Rate Region for the Gaussian Z-interference Channel with Conferencing
    Do, Hieu T.
    Oechtering, Tobias J.
    Skoglund, Mikael
    [J]. 2009 47TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1 AND 2, 2009, : 75 - +
  • [10] Key Agreement over an Interference Channel with Noiseless Feedback: Achievable Region & Distributed Allocation
    Salimi, Somayeh
    Jorswieck, Eduard A.
    Skoglund, Mikael
    Papadimitratos, Panos
    [J]. 2015 IEEE CONFERENCE ON COMMUNICATIONS AND NETWORK SECURITY (CNS), 2015, : 59 - 64