Subcarrier and Power Allocation for Sparse Code Multiple Access
Subcarrier and Power Allocation for Sparse Code Multiple Access
复制标题
DOI：
10.1109/vtc2020-spring48590.2020.9128928
复制
发表时间：
2020-03
期刊：
影响因子：
--
通讯作者：
Yanely Jimenez Licea;Kevin Z. Shen;D. So
中科院分区：
文献类型：
--
作者：
Yanely Jimenez Licea;Kevin Z. Shen;D. So
稀疏码多址（SCMA）系统的资源分配受到不同用户同时传输数据的码本设计的限制。分配给同一资源的用户之间的干扰效应可能导致性能严重下降。为了缓解这个问题，本文提出了一种实用的子载波分配方法。所提出的方案比现有方法具有更低的复杂度，同时实现接近最优的性能。它基于改进的贪婪算法，并通过向相邻用户分配相反的码本模式来利用多用户系统的特性。探讨了不同分配图设计之间的比较，并引入了一种低复杂度的功率分配方法，每个用户具有最小的速率限制。该方案基于适用于存在干扰的多用户稀疏系统的注水原理。仿真结果表明，该方案具有接近最优的性能且计算复杂度较低。
Resource allocation for Sparse Code Multiple Access (SCMA) systems is restricted by the codebook design for data transmission from different users simultaneously. The effect of the interference between users assigned to the same resource can result in severe degradation of performance. To alleviate this problem, a practical subcarrier allocation approach is proposed in this paper. The proposed scheme has a lower complexity than existing methods while achieving close to optimal performance. It is based on a modified greedy algorithm and exploits the properties of multiuser systems by assigning opposite codebook patterns to adjacent users. A comparison between different allocation graph designs is explored and we introduce a low complexity power allocation method with minimum rate constraints per user. The scheme is based on the water-filling principle adapted for multiuser sparse systems in the presence of interference. Simulation results show that the proposed scheme has close to optimal performance with lower computational complexity.