Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
166 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Optimal Beamforming Structure and Efficient Optimization Algorithms for Generalized Multi-Group Multicast Beamforming Optimization (2312.16559v1)

Published 27 Dec 2023 in cs.IT and math.IT

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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (39)
  1. N. Sidiropoulos, T. Davidson, and Z.-Q. Luo, “Transmit beamforming for physical-layer multicasting,” IEEE Trans. Signal Process., vol. 54, no. 6, pp. 2239–2251, 2006.
  2. H. Lu, Y. Zeng, C. You, Y. Han, J. Zhang, Z. Wang, Z. Dong, S. Jin, C.-X. Wang, T. Jiang et al., “A tutorial on near-field XL-MIMO communications towards 6G,” arXiv preprint arXiv:2310.11044, 2023.
  3. C. Lu and Y.-F. Liu, “An efficient global algorithm for single-group multicast beamforming,” IEEE Trans. Signal Process., vol. 65, no. 14, pp. 3761–3774, 2017.
  4. E. Karipidis, N. D. Sidiropoulos, and Z.-Q. Luo, “Quality of service and max-min fair transmit beamforming to multiple cochannel multicast groups,” IEEE Trans. Signal Process., vol. 56, no. 3, pp. 1268–1279, 2008.
  5. T.-H. Chang, Z.-Q. Luo, and C.-Y. Chi, “Approximation bounds for semidefinite relaxation of max-min-fair multicast transmit beamforming problem,” IEEE Trans. Signal Process., vol. 56, no. 8, pp. 3932–3943, 2008.
  6. Z. Xiang, M. Tao, and X. Wang, “Coordinated multicast beamforming in multicell networks,” IEEE Trans. Wireless Commun., vol. 12, no. 1, pp. 12–21, 2012.
  7. D. Christopoulos, S. Chatzinotas, and B. Ottersten, “Weighted fair multicast multigroup beamforming under per-antenna power constraints,” IEEE Trans. Signal Process., vol. 62, no. 19, pp. 5132–5142, 2014.
  8. L.-N. Tran, M. F. Hanif, and M. Juntti, “A conic quadratic programming approach to physical layer multicasting for large-scale antenna arrays,” IEEE Signal Process Lett., vol. 21, no. 1, pp. 114–117, 2013.
  9. D. Christopoulos, S. Chatzinotas, and B. Ottersten, “Multicast multigroup beamforming for per-antenna power constrained large-scale arrays,” in Proc. IEEE Int Workshop Signal Process. Advances Wireless Commun., 2015, pp. 271–275.
  10. G. Scutari, F. Facchinei, L. Lampariello, S. Sardellitti, and P. Song, “Parallel and distributed methods for constrained nonconvex optimization-part II: Applications in communications and machine learning,” IEEE Trans. Signal Process., vol. 65, no. 8, pp. 1945–1960, 2016.
  11. L. Yin and B. Clerckx, “Rate-splitting multiple access for multigroup multicast and multibeam satellite systems,” IEEE Trans. Commun., vol. 69, no. 2, pp. 976–990, 2020.
  12. ——, “Rate-splitting multiple access for satellite-terrestrial integrated networks: Benefits of coordination and cooperation,” IEEE Trans. Wireless Commun., vol. 22, no. 1, pp. 317–332, 2022.
  13. J. Zhou, Y. Sun, R. Chen, and C. Tellambura, “Rate splitting multiple access for multigroup multicast beamforming in cache-enabled C-RAN,” IEEE Trans. Veh. Technol., vol. 70, no. 12, pp. 12 758–12 770, 2021.
  14. W. Wang, L. Gao, R. Ding, J. Lei, L. You, C. A. Chan, and X. Gao, “Resource efficiency optimization for robust beamforming in multi-beam satellite communications,” IEEE Trans. Veh. Technol., vol. 70, no. 7, pp. 6958–6968, 2021.
  15. G. Zhou, C. Pan, H. Ren, K. Wang, and A. Nallanathan, “Intelligent reflecting surface aided multigroup multicast MISO communication systems,” IEEE Trans. Signal Process., vol. 68, pp. 3236–3251, 2020.
  16. Z. Li, S. Wang, M. Wen, and Y.-C. Wu, “Secure multicast energy-efficiency maximization with massive RISs and uncertain CSI: First-order algorithms and convergence analysis,” IEEE Trans. Wireless Commun., vol. 21, no. 9, pp. 6818–6833, 2022.
  17. Z. Zhang, Z. Zhao, K. Shen, D. P. Palomar, and W. Yu, “Discerning and enhancing the weighted sum-rate maximization algorithms in communications,” arXiv preprint arXiv:2311.04546, 2023.
  18. M. Grant and S. Boyd, “CVX: Matlab software for disciplined convex programming, version 2.1,” http://cvxr.com/cvx, Mar. 2014.
  19. E. Chen and M. Tao, “ADMM-based fast algorithm for multi-group multicast beamforming in large-scale wireless systems,” IEEE Trans. Commun., vol. 65, no. 6, pp. 2685–2698, 2017.
  20. C. Zhang, M. Dong, and B. Liang, “Ultra-low-complexity algorithms with structurally optimal multi-group multicast beamforming in large-scale systems,” IEEE Trans. Signal Process., vol. 71, pp. 1626–1641, 2023.
  21. H. B. Mahmoodi, B. Gouda, M. Salehi, and A. Tölli, “Low-complexity multicast beamforming for multi-stream multi-group communications,” in Proc. IEEE Global Commun. Conf. (GLOBECOM), 2021, pp. 01–06.
  22. M. Sadeghi, L. Sanguinetti, R. Couillet, and C. Yuen, “Reducing the computational complexity of multicasting in large-scale antenna systems,” IEEE Trans. Wireless Commun., vol. 16, no. 5, pp. 2963–2975, 2017.
  23. J. Yu and M. Dong, “Low-complexity weighted MRT multicast beamforming in massive MIMO cellular networks,” in Proc. lEEE Int. Conf. Acoust., Speech, Signal Process. (ICASSP).   IEEE, 2018, pp. 3849–3853.
  24. E. Bjornson, M. Bengtsson, and B. Ottersten, “Optimal multiuser transmit beamforming: A difficult problem with a simple solution structure [lecture notes],” IEEE Signal Process Mag., vol. 31, no. 4, pp. 142–148, Jul. 2014.
  25. M. Dong and Q. Wang, “Multi-group multicast beamforming: Optimal structure and efficient algorithms,” IEEE Trans. Signal Process, vol. 68, pp. 3738–3753, May. 2020.
  26. T. Fang and Y. Mao, “Optimal beamforming structure for rate splitting multiple access,” arXiv preprint arXiv:2309.10342, 2023.
  27. C. Zhang, M. Dong, and B. Liang, “Fast first-order algorithm for large-scale max-min fair multi-group multicast beamforming,” IEEE Wireless Commun. Lett., vol. 11, no. 8, pp. 1560–1564, 2022.
  28. S. Mohammadi, M. Dong, and S. ShahbazPanahi, “Fast algorithm for joint unicast and multicast beamforming for large-scale massive MIMO,” IEEE Trans. Signal Process., vol. 70, pp. 5413–5428, 2022.
  29. H. Tuy, “Robust solution of nonconvex global optimization problems,” J. Global Optim., vol. 32, pp. 307–323, 2005.
  30. D. W. Peterson, “A review of constraint qualifications in finite-dimensional spaces,” SIAM Review, vol. 15, no. 3, pp. 639–654, 1973.
  31. B. Matthiesen and E. A. Jorswieck, “Efficient global optimal resource allocation in non-orthogonal interference networks,” IEEE Trans. Signal Process., vol. 67, no. 21, pp. 5612–5627, 2019.
  32. B. Matthiesen, Y. Mao, A. Dekorsy, P. Popovski, and B. Clerckx, “Globally optimal spectrum- and energy-efficient beamforming for rate splitting multiple access,” IEEE Trans. Signal Process., vol. 70, pp. 5025–5040, Oct. 2022.
  33. C. B. Peel, B. M. Hochwald, and A. L. Swindlehurst, “A vector-perturbation technique for near-capacity multiantenna multiuser communication-part I: channel inversion and regularization,” IEEE Trans. Commun., vol. 53, no. 1, pp. 195–202, 2005.
  34. M. Asghari, A. M. Fathollahi-Fard, S. Mirzapour Al-E-Hashem, and M. A. Dulebenets, “Transformation and linearization techniques in optimization: A state-of-the-art survey,” Mathematics, vol. 10, no. 2, p. 283, 2022.
  35. S. Boyd, L. Xiao, and A. Mutapcic, “Subgradient methods,” lecture notes of EE392o, Stanford University, Autumn Quarter, 2003.
  36. S. Xu, “Smoothing method for minimax problems,” Comput. Optim. Appl., vol. 20, no. 3, pp. 267–279, 2001.
  37. X. Zhao, S. Lu, Q. Shi, and Z.-Q. Luo, “Rethinking WMMSE: Can its complexity scale linearly with the number of BS antennas?” IEEE Trans. Signal Process., vol. 71, pp. 433–446, 2023.
  38. M. Journée, Y. Nesterov, P. Richtárik, and R. Sepulchre, “Generalized power method for sparse principal component analysis.” J. Mach. Learn. Res., vol. 11, no. 2, 2010.
  39. Y. Sun, P. Babu, and D. P. Palomar, “Majorization-minimization algorithms in signal processing, communications, and machine learning,” IEEE Trans. Signal Process., vol. 65, no. 3, pp. 794–816, 2017.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets