Low-complexity multicast beamforming for multi-stream multi-group communications
Bakhshzad Mahmoodi, Hamidreza; Gouda, Bikshapathi; Salehi, MohammadJavad; Tölli, Antti (2022-02-02)
H. B. Mahmoodi, B. Gouda, M. Salehi and A. Tölli, "Low-complexity Multicast Beamforming for Multi-stream Multi-group Communications," 2021 IEEE Global Communications Conference (GLOBECOM), Madrid, Spain, 2021, pp. 01-06, doi: 10.1109/GLOBECOM46510.2021.9685158.
© 2021 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/
https://urn.fi/URN:NBN:fi-fe2023032332869
Tiivistelmä
Abstract
In this paper, assuming multi-antenna transmitter and receivers, we consider a multicast beamformer design for the weighted max-min-fairness (WMMF) problem in a multi-stream multi-group communication setup. Unlike the single-stream scenario, the WMMF objective in this setup is not equivalent to maximizing the minimum weighted SINR due to the summation over the rates of multiple streams. Therefore, the non-convex problem at hand is first approximated with a convex one and then solved using Karush-Kuhn-Tucker (KKT) conditions. Then, a practically appealing closed-form solution is derived for both transmit and receive beamformers as a function of dual variables. Finally, we use an iterative solution based on the sub-gradient method to solve for the mutually coupled and interdependent dual variables. The proposed solution does not rely on generic solvers and does not require any bisection loop for finding the achievable rate of various streams. As a result, it significantly outperforms the state-of-art in terms of computational cost and convergence speed.
Kokoelmat
- Avoin saatavuus [31907]