Radio Resource Allocation for Uplink OFDMA Systems With Finite Symbol Alphabet Inputs
Radio Resource Allocation for Uplink OFDMA Systems With Finite Symbol Alphabet Inputs
复制标题
DOI：
10.1109/tvt.2013.2287809
复制
发表时间：
2014-05
影响因子：
6.8
通讯作者：
Mohammed Al-Imari;P. Xiao;M. Imran;R. Tafazolli
中科院分区：
文献类型：
--
作者：
Mohammed Al-Imari;P. Xiao;M. Imran;R. Tafazolli
在本文中，我们考虑上行链路正交频分多址（OFDMA）系统的无线资源分配问题。由于互信息的封闭形式，现有的算法都是在高斯输入的假设下推导出来的。为了实用起见，我们考虑有限符号字母表（FSA）输入的系统，并解决了这个问题，利用最近发现的互信息和最小均方误差（MMSE）之间的关系。我们首先放松的问题，制定它作为一个凸优化问题，然后，我们通过分解方法得到的最优解。最优解作为系统性能的上限。针对最优解的复杂性，提出了一种低复杂度的次优算法。数值结果表明，所提出的次优算法可以获得非常接近最优解的性能，它优于现有的次优算法。此外，使用我们提出的算法，可以实现显着的节能相比，高斯输入时，假设的情况下。
In this paper, we consider the radio resource allocation problem for uplink orthogonal frequency-division multiple-access (OFDMA) systems. The existing algorithms have been derived under the assumption of Gaussian inputs due to its closed-form expression of mutual information. For the sake of practicality, we consider the system with finite symbol alphabet (FSA) inputs and solve the problem by capitalizing on the recently revealed relationship between mutual information and minimum mean square error (MMSE). We first relax the problem to formulate it as a convex optimization problem, and then, we derive the optimal solution via decomposition methods. The optimal solution serves as an upper bound on the system performance. Due to the complexity of the optimal solution, a low-complexity suboptimal algorithm is proposed. Numerical results show that the presented suboptimal algorithm can achieve performance very close to the optimal solution and that it outperforms the existing suboptimal algorithms. Furthermore, using our proposed algorithm, significant power saving can be achieved in comparison to the case when a Gaussian input is assumed.