多输入多输出
计算机科学
天线(收音机)
基站
选择(遗传算法)
用户设备
频道(广播)
诺玛
认知无线电
算法
计算机网络
拓扑(电路)
数学优化
电子工程
数学
电信
工程类
电信线路
无线
电气工程
人工智能
作者
Yuehua Yu,He Chen,Yonghui Li,Zhiguo Ding,Lingyang Song,Branka Vucetic
出处
期刊:IEEE Transactions on Vehicular Technology
[Institute of Electrical and Electronics Engineers]
日期:2017-11-24
卷期号:67 (4): 3158-3171
被引量:70
标识
DOI:10.1109/tvt.2017.2777540
摘要
This paper considers the antenna selection (AS) problem for a multiple-input multiple-output nonorthogonal multiple access system. In particular, we develop new computationally efficient AS algorithms for two commonly used scenarios: NOMA with fixed power allocation (F-NOMA) and NOMA with cognitive radio-inspired power allocation (CR-NOMA). For the F-NOMA scenario, a new max-max-max AS (A 3 -AS) scheme is first proposed to maximize the system sum-rate. This is achieved by selecting one antenna at the base station (BS) and corresponding best receive antenna at each user that maximizes the channel gain of the resulting strong user. To improve the user fairness, a new max-min-max AS (AIA-AS) scheme is subsequently developed, in which we jointly select one transmit antenna at BS and corresponding best receive antennas at users to maximize the channel gain of the resulting weak user. For the CR-NOMA scenario, we propose another new AS algorithm, termed maximum-channel-gain-based antenna selection (MCG-AS), to maximize the achievable rate of the secondary user, under the condition that the primary user's quality-of-service requirement is satisfied. The asymptotic closed-form expressions of the average sum-rate for A 3 -AS and AIA-AS and that of the average rate of the secondary user for MCG-AS are derived. Numerical results demonstrate that the AIA-AS provides better user fairness, whereas the A 3 -AS achieves a near-optimal sum-rate in F-NOMA systems. For the CR-NOMA scenario, MCG-AS achieves a near-optimal performance in a wide signal-to-noise-ratio regime. Furthermore, all the proposed AS algorithms yield a significant computational complexity reduction, compared to exhaustive search-based counterparts.
科研通智能强力驱动
Strongly Powered by AbleSci AI