Computer Science > Information Theory
[Submitted on 27 Dec 2023]
Title:Optimal Beamforming Structure and Efficient Optimization Algorithms for Generalized Multi-Group Multicast Beamforming Optimization
View PDF HTML (experimental)Abstract:In this work, we focus on solving non-smooth non-convex maximization problems in multi-group multicast transmission. Leveraging Karush-Kuhn-Tucker (KKT) optimality conditions and successive incumbent transcending (SIT) duality, we thoroughly analyze the optimal beamforming structure for a set of optimization problems characterized by a general utility-based objective function. By exploiting the identified optimal structure, we further unveil inherent low-dimensional beamforming structures within the problems, which are asymptotically optimal in various regimes of transmit signal-to-noise ratios (SNRs) or the number of transmit antennas. Building upon the discovered optimal and low-dimensional beamforming structures, we then propose highly efficient and toolbox-free optimization algorithms to solve a specific multi-group multicast optimization problem based on the weighted sum rate (WSR) utility function. The proposed algorithms first use the cyclic maximization (CM) framework to decompose the problem into multiple subproblems, each has an optimal or low-dimensional closed-form beamforming solution structure. Then, we propose the projected adaptive gradient descent (PAGD) algorithm to compute the optimal Lagrangian dual variables for each subproblem. Numerical results show that the proposed algorithms maintain comparable or improved WSR performance compared to baseline algorithms, while dramatically reducing the computational complexity. Notably, the proposed ultra-low-complexity algorithms based on low-dimensional beamforming structures achieve near optimal WSR performance with extremely low computational complexity. This complexity remains independent of the number of transmit antennas, making them promising and practical for extremely large multiple-input multiple-output (XL-MIMO) applications in 6G.
Current browse context:
cs.IT
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.