O. Lyons, M. F. Hanif, M. Juntti and L. Tran, "Fast Adaptive Minorization-Maximization Procedure for Beamforming Design of Downlink NOMA Systems," in IEEE Transactions on Vehicular Technology, vol. 69, no. 7, pp. 8023-8027, July 2020, doi: 10.1109/TVT.2020.2993987
Fast adaptive minorization-maximization procedure for beamforming design of downlink NOMA systems
|Author:||Lyons, Oisin1; Hanif, Muhammad Fainan2; Juntti, Markku3;|
1School of Electrical and Electronic Engineering, University College Dublin, Dublin D04 V1W8, Ireland
2Department of Electrical Engineering, University of Lahore, Lahore 55150, Pakistan
3Centre for Wireless Communications, University of Oulu, 90014 Oulu, Finland
|Online Access:||PDF Full Text (PDF, 0.2 MB)|
|Persistent link:|| http://urn.fi/urn:nbn:fi-fe2020080448047
Institute of Electrical and Electronics Engineers,
|Publish Date:|| 2020-08-04
We develop a novel technique to accelerate minorization-maximization (MM) procedure for the non-orthogonal multiple access (NOMA) weighted sum rate maximization problem. Specifically, we exploit the Lipschitz continuity of the gradient of the objective function to adaptively update the MM algorithm. With fewer additional analysis variables and low complexity second-order cone program (SOCP) to solve in each iteration of the MM algorithm, the proposed approach converges quickly at a small computational cost. By numerical simulation results, our algorithm is shown to greatly outperform known solutions in terms of achieved sum rates and computational complexity.
IEEE transactions on vehicular technology
|Pages:||8023 - 8027|
|Type of Publication:||
A1 Journal article – refereed
|Field of Science:||
213 Electronic, automation and communications engineering, electronics
M. Juntti’s work has been supported in part by 6Genesis Flagship (grant 318927) funded by the Academy of Finland.
|Academy of Finland Grant Number:||
318927 (Academy of Finland Funding decision)
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.