Robust Transceiver Design for IRS-Assisted Cascaded MIMO Communication Systems

• Published in: Sensors (Basel, Switzerland) Vol. 22; no. 17; p. 6587
• Main Authors: Esmaeili, Hossein, Kariminezhad, Ali, Sezgin, Aydin
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 31-08-2022; MDPI
• Subjects: Algorithms; Antenna arrays; Antennas (Electronics); Communication; Communications systems; decode-and-forward; Design; IRS; Lower bounds; MIMO; MIMO communication; MIMO communications; Network reliability; Optimization; Relay systems; robust design; Signal processing; Tax administration and procedure; Taxation; Telecommunication systems; Transceivers; Transmitters; Wireless networks; worst case
• ISSN: 1424-8220; 1424-8220
• DOI: 10.3390/s22176587

Intelligent reconfigurable surfaces (IRSs) have gained much attention due to their passive behavior that can be a successor to relays in many applications. However, traditional relay systems might still be a perfect choice when reliability and throughput are the main concerns in a communication system. In this work, we use an IRS along with a decode-and-forward relay to provide a possible solution to address one of the main challenges of future wireless networks which is providing reliability. We investigate a robust transceiver design against the residual self-interference (RSI), which maximizes the throughput rate under self-interference channel uncertainty-bound constraints. The yielded problem turns out to be a non-convex optimization problem, where the non-convex objective is optimized over the cone of semidefinite matrices. We propose a novel mathematical method to find a lower bound on the performance of the IRS that can be used as a benchmark. Eventually, we show an important result in which, for the worst-case scenario, IRS can be helpful only if the number of IRS elements are at least as large as the size of the interference channel. Moreover, a novel method based on majorization theory and singular value decomposition (SVD) is proposed to find the best response of the transmitters and relay against worst-case RSI. Furthermore, we propose a multi-level water-filling algorithm to obtain a locally optimal solution iteratively. We show that our algorithm performs better that the state of the art in terms of time complexity as well as robustness. For instance, our numerical results show that the acheivable rate can be increased twofold and almost sixfold, respectively, for the case of small and large antenna array at transceivers.