当前位置: X-MOL 学术IEEE Trans. Wirel. Commun. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Performance of Dynamic Power and Channel Allocation for Downlink MC-NOMA Systems
IEEE Transactions on Wireless Communications ( IF 8.9 ) Pub Date : 2020-03-01 , DOI: 10.1109/twc.2019.2955940
Fei Liu , Marina Petrova

In this paper, we develop an analytical model for the performance analysis of dynamic power and channel allocation (DPCA) in downlink multi-channel non-orthogonal multiple access (MC-NOMA) systems. To make the performance analysis tractable, we first relax the condition in the optimization problem of DPCA by assuming an ideal MC-NOMA system in which an arbitrary number of users can be multiplexed per subchannel. We use the basic decomposition method to solve the optimal DPCA for this problem and design a low-complexity algorithm for inter-channel power allocation. Then, based on the derivation of this optimal DPCA solution, we analyze its data rate performance and prove that it is an upper bound for practical MC-NOMA systems in which the number of multiplexed users per subchannel is limited. The simulation results verify our analysis of the upper bound performance and confirm that using its analytical results for data rate estimation in practical MC-NOMA systems has high accuracy under different system configurations. In addition, we study the influence of multi-user and multi-channel diversities on the performance of MC-NOMA, serving as a guideline for its deployment and optimization in practice.

中文翻译:

下行链路 MC-NOMA 系统的动态功率和信道分配性能

在本文中,我们开发了一种分析模型,用于下行链路多信道非正交多址 (MC-NOMA) 系统中动态功率和信道分配 (DPCA) 的性能分析。为了使性能分析易于处理,我们首先通过假设一个理想的 MC-NOMA 系统来放宽 DPCA 优化问题中的条件,其中每个子信道可以复用任意数量的用户。我们使用基本分解方法来解决这个问题的最优DPCA,并设计了一种低复杂度的信道间功率分配算法。然后,基于此最优 DPCA 解决方案的推导,我们分析了其数据速率性能,并证明它是每个子信道复用用户数有限的实际 MC-NOMA 系统的上限。仿真结果验证了我们对上限性能的分析,并确认在实际 MC-NOMA 系统中使用其分析结果进行数据速率估计在不同系统配置下具有很高的准确性。此外,我们研究了多用户和多通道多样性对 MC-NOMA 性能的影响,作为其在实践中部署和优化的指南。
更新日期:2020-03-01
down
wechat
bug