Joint MIMO Transceiver and Reflector Design for Reconfigurable Intelligent Surface-Assisted Communication

In this paper, we consider a reconfigurable intelligent surface (RIS)-assisted multiple-input multiple-output communication system with multiple antennas at both the base station (BS) and the user. We plan to maximize the achievable rate through jointly optimizing the transmit precoding matrix, the...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on vehicular technology 2024-10, Vol.73 (10), p.15061-15075
Main Authors: Zhao, Yaqiong, Xu, Jindan, Xu, Wei, Wang, Kezhi, Ye, Xinquan, Yuen, Chau, You, Xiaohu
Format: Article
Language:English
Subjects:
Algorithms
alternating optimization
Communications systems
Karush-Kuhn-Tucker (KKT) point
MIMO communication
Optimization
Precoding
Reconfigurable intelligent surface (RIS)
Reconfigurable intelligent surfaces
Reflection
semi-definite relaxation (SDR)
successive closed form (SCF)
transceiver optimization
Transceivers
weighted minimum mean squared error (WMMSE)
Wireless communication
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we consider a reconfigurable intelligent surface (RIS)-assisted multiple-input multiple-output communication system with multiple antennas at both the base station (BS) and the user. We plan to maximize the achievable rate through jointly optimizing the transmit precoding matrix, the receive combining matrix, and the RIS reflection matrix under the constraints of the transmit power at the BS and the unit-modulus reflection at the RIS. Regarding the non-trivial problem form, we initially reformulate it into an considerable problem to make it tractable by utilizing the relationship between the achievable rate and the weighted minimum mean squared error. Next, the transmit precoding matrix, the receive combining matrix, and the RIS reflection matrix are alternately optimized. In particular, the optimal transmit precoding matrix and receive combining matrix are obtained in closed forms. Furthermore, a pair of computationally efficient methods are proposed for the RIS reflection matrix, namely the semi-definite relaxation (SDR) method and the successive closed form (SCF) method. We theoretically prove that both methods are ensured to converge, and the SCF-based algorithm is able to converges to a Karush-Kuhn-Tucker point of the problem.
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2024.3406199