Weighted Sum-Rate Maximization With Transceiver and Passive Beamforming Design for IRS-Aided MIMO-BC Communications via Matrix Fractional Programming

被引:0
|
作者
Qiu, Jing [1 ]
Yu, Jiguo [2 ,3 ]
Dong, Anming [4 ,5 ]
Yu, Kan [6 ]
Chen, Honglong [7 ]
机构
[1] Qufu Normal Univ, Sch Math Sci, Qufu 273165, Peoples R China
[2] Univ Elect Sci & Technol China, Sch Comp Sci & Engn, Chengdu 611731, Peoples R China
[3] Qilu Univ Technol, Big Data Inst, Jinan 250353, Peoples R China
[4] Qilu Univ Technol, Key Lab Comp Power Network & Informat Secur, Shandong Comp Sci Ctr, Shandong Acad Sci,Minist Educ, Jinan 250353, Shandong, Peoples R China
[5] Shandong Fundamental Res Ctr Comp Sci, Shandong Prov Key Lab Comp Networks, Jinan 250353, Shandong, Peoples R China
[6] Beijing Univ Posts & Telecommun, Key Lab Universal Wireless Commun, Minist Educ, Beijing 100876, Peoples R China
[7] China Univ Petr, Coll Control Sci & Engn, Qingdao 266580, Peoples R China
基金
美国国家科学基金会;
关键词
Optimization; Array signal processing; Transceivers; MIMO communication; Transforms; Programming; Matrix decomposition; Matrix Fractional programming (MFP); alternating optimization (AO); intelligent reflecting surface (IRS); manifold optimization (MO); beamforming; MULTIUSER MIMO; OPTIMIZATION; SYSTEMS; FRAMEWORK; NETWORKS; ROBUST; SWIPT;
D O I
10.1109/TCOMM.2024.3450600
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper investigates the joint active transceiver and passive beamforming design to maximize the weighted sum-rate (WSR) of an IRS-aided multi-streams multiuser multiple-input multiple-output broadcast channel (MIMO-BC) downlink transmission system. Due to the coupling of the transceiver parameters, the considered WSR optimization problem is highly non-convex and thus challenging to solve. Different from the normally used methods, such as the weighted minimum mean-square error (WMMSE), we rely on the matrix fractional programming (MFP) theory to derive an effective algorithm to the WSR problem. Specifically, we reformulate the original problem into a tractable one by exploiting the special structure of the objective function, i.e., a MFP which involves a matrix ratio inside a logarithm in the objective function. An alternating optimization (AO) framework is then devised to decompose the reformulated problem into four subproblems, which optimize the introduced auxiliary variable, the transmit beamforming matrix, the receive matrix, and the reflecting beamforming matrix by fixing other variables respectively. Through the matrix quadratic transform, we reformulate the MFP problem as a convex one, and thus obtain the optimal transmit beamforming matrix. By leveraging the optimality conditions for unconstrained optimization problems, the optimal receive beamforming matrix and the introduced auxiliary variable are derived in closed form. For solving the passive beamforming subproblem, we propose an iterative algorithm based on successive convex approximation (SCA). Since the computational complexity of SCA is relatively high, we propose a computationally efficient method based on manifold optimization (MO) to optimize the passive beamforming matrix. Finally, we also consider the robust beamforming design when the system suffers from imperfect CSI. Simulation results demonstrate the effectiveness of the proposed methods.
引用
收藏
页码:1383 / 1398
页数:16
相关论文
共 3 条
  • [1] Weighted Sum-Rate Maximization using Weighted MMSE for MIMO-BC Beamforming Design
    Christensen, Soren Skovgaard
    Agarwal, Rajiv
    de Carvalho, Elisabeth
    Cioffi, John M.
    2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-8, 2009, : 2945 - +
  • [2] Energy Efficiency Maximization via Joint Active and Passive Beamforming Design for Multiuser MISO IRS-Aided SWIPT
    Zargari, Shayan
    Khalili, Ata
    Zhang, Rui
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2021, 10 (03) : 557 - 561
  • [3] Weighted Sum-Rate Maximization for Analog Beamforming and Combining in Millimeter Wave Massive MIMO Communications
    Sun, Yuhan
    Qi, Chenhao
    IEEE COMMUNICATIONS LETTERS, 2017, 21 (08) : 1883 - 1886