Fast adaptive minorization-maximization procedure for beamforming design of downlink NOMA systems

Lyons, Oisin; Hanif, Muhammad Fainan; Juntti, Markku; Tran, Le-Nam (2020-05-11)
 
Avaa tiedosto
Lataukset: 

URL:
https://doi.org/10.1109/TVT.2020.2993987

Lyons, Oisin
Hanif, Muhammad Fainan
Juntti, Markku
Tran, Le-Nam
Institute of Electrical and Electronics Engineers
11.05.2020

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

https://rightsstatements.org/vocab/InC/1.0/
© 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.
https://rightsstatements.org/vocab/InC/1.0/
doi:https://doi.org/10.1109/TVT.2020.2993987
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe2020080448047
Tiivistelmä

Abstract

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.

Kokoelmat