access icon free Cognitive interference channel: achievable rate region and power allocation

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.

Inspec keywords: radiofrequency interference; resource allocation; Gaussian channels; channel coding

Other keywords: Gaussian channel; cognitive interference channel; Han-Kobayashi rate splitting coding scheme; Gelfand–Pinsker coding; achievable rate region; two-user interference channel; discrete memoryless model; power allocation; zero-forcing dirty paper coding; superposition coding

Subjects: Electromagnetic compatibility and interference; Codes

References

    1. 1)
      • 18. Bagheri, H., Motahari, A., Khandani, A.: ‘Zero-forcing for the symmetric interference channel with conferencing encoders’. IEEE Int. Symp. on Information Theory, 2010, pp. 370374.
    2. 2)
      • 30. Kramer, G.: ‘Review of rate regions for interference channels’. Int. Seminar on Communication, February 2006, pp. 162165.
    3. 3)
      • 24. Ghasemi-Goojani, S., Behroozi, H.: ‘On the sum-capacity and lattice-based transmission strategies for state-dependent Gaussian interference channel’. Int. Symp. Personal Indoor and Mobile Radio Commun. (PIMRC), September 2012, pp. 19441948.
    4. 4)
    5. 5)
      • 15. Chaaban, A., Sezgin, A.: ‘Achievable rates and upper bounds for the interference relay channel’. Asilomar Conf. on Signals, Systems and Computers (ASILOMAR), November 2010, pp. 267271.
    6. 6)
    7. 7)
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
      • 16. Gelfand, S., Pinsker, M.: ‘Coding for channel with random parameters’. Problems of Control and Inform. Theory, 1980.
    13. 13)
    14. 14)
      • 12. Sridharan, S., Vishwanath, S., Jafar, S., Shamai, S.: ‘On the capacity of cognitive relay assisted Gaussian interference channel’. IEEE Int. Symp. Inform. Theory, Jul. 2008, pp. 549553.
    15. 15)
    16. 16)
    17. 17)
      • 23. Zhang, L., Jiang, J., Cui, S.: ‘Achievable rate regions for discrete Memoryless interference channel with state information’. IEEE Int. Conf. Communications, pp. 15, June.
    18. 18)
    19. 19)
    20. 20)
    21. 21)
    22. 22)
    23. 23)
    24. 24)
      • 13. Rini, S., Tuninetti, D., Devroye, N., Goldsmith, A.: ‘On the capacity of the interference channel with a cognitive relay’. CoRR, vol. abs/1107.4600, 2011.
    25. 25)
    26. 26)
    27. 27)
      • 25. Zhang, L., Cui, S., Jiang, J.: ‘Gaussian interference channel with state information’. IEEE Wireless Communication and Networking Conf. (WCNC), 2011, pp. 19601965.
    28. 28)
    29. 29)
    30. 30)
    31. 31)
      • 28. Hon-Fah Chong, H., Motani, M., Garg: ‘A Comparsion of two achievable rate regions for the interference channel’. IEEE Int. Symp. Information Theory, 2007.
    32. 32)
      • 14. Sahin, O., Erkip, E.: ‘Achievable rates for the gaussian interference relay channel’. IEEE Global Telecommunication Conf., November 2007, pp. 16271631.
    33. 33)
    34. 34)
      • 32. Stanimirovic, I.P.: ‘Compendious lexicographic method for multi-objective optimization’, Ser. Math. Inform., 2012, 27, pp. 5566.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2014.0802
Loading

Related content

content/journals/10.1049/iet-com.2014.0802
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading