TY - JOUR
T1 - Achievable Rate of a Cognitive MIMO Multiple Access Channel With Multi-Secondary Users
AU - Sboui, Lokman
AU - Ghazzai, Hakim
AU - Rezki, Zouheir
AU - Alouini, Mohamed-Slim
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: Manuscript received July 28, 2014; revised December 24, 2014; accepted December 27, 2014. Date of publication January 6, 2015; date of current version March 6, 2015. This work was supported by the Qatar National Research Fund (a member of Qatar Foundation) under NPRP Grant NPRP 5-250-2-087. The statements made herein are solely the responsibility of the authors. The associate editor coordinating the review of this paper and approving it for publication was T. Q. Duong.
PY - 2015/3
Y1 - 2015/3
N2 - We study the secondary sum-rate of an underlay cognitive multiple access channel consisting of a primary user and multiple secondary users (SUs) communicating with a common destination. We propose a particular linear precoding and SU selection scheme that maximize the cognitive sum-rate. This scheme is based on space alignment strategy allowing SUs to share the spectrum without interfering with each other. We derive the optimal power allocation for each selected SU after applying perfect or imperfect successive interference cancellation. Numerical results show that the proposed scheme provides a significant sum-rate improvement as the number of SUs increases. In addition, it achieves almost the same performance as an exhaustive search selection, mainly in low and high power ranges. © 1997-2012 IEEE.
AB - We study the secondary sum-rate of an underlay cognitive multiple access channel consisting of a primary user and multiple secondary users (SUs) communicating with a common destination. We propose a particular linear precoding and SU selection scheme that maximize the cognitive sum-rate. This scheme is based on space alignment strategy allowing SUs to share the spectrum without interfering with each other. We derive the optimal power allocation for each selected SU after applying perfect or imperfect successive interference cancellation. Numerical results show that the proposed scheme provides a significant sum-rate improvement as the number of SUs increases. In addition, it achieves almost the same performance as an exhaustive search selection, mainly in low and high power ranges. © 1997-2012 IEEE.
UR - http://hdl.handle.net/10754/575727
UR - http://ieeexplore.ieee.org/document/7001575/
UR - http://www.scopus.com/inward/record.url?scp=84924873225&partnerID=8YFLogxK
U2 - 10.1109/LCOMM.2014.2387843
DO - 10.1109/LCOMM.2014.2387843
M3 - Article
SN - 1089-7798
VL - 19
SP - 403
EP - 406
JO - IEEE Communications Letters
JF - IEEE Communications Letters
IS - 3
ER -