arXiv subjects

Gui Zhou

Publications and source records attributed to Gui Zhou.

42 records · Page 3Linked to original sources

arXiv2021

User Cooperation for IRS-aided Secure SWIPT MIMO Systems

In this paper, intelligent reflecting surface (IRS) is proposed to enhance the physical layer security in the Rician fading channel where the angular direction of the eavesdropper is aligned with a legitimate user. In this scenario, we consider a two-phase communication system under the active attacks and passive eavesdropping. Particularly, in the first phase, the base station avoids direct transmission to the attacked user. While, in the second phase, other users cooperate to forward signals to the attacked user with the help of IRS and energy harvesting technology. Under the active attacks, we investigate an outage constrained beamforming design problem under the statistical cascaded channel error model, which is solved by using the Bernstein-type inequality. As for the passive eavesdropping, an average secrecy rate maximization problem is formulated, which is addressed by a low complexity algorithm. Numerical results show that the negative effect of the eavesdropper's channel error is greater than that of the legitimate user.

eess.SP↗

arXiv2021

Secure Wireless Communication in RIS-Aided MISO Systems with Hardware Impairments

In practice, residual transceiver hardware impairments inevitably lead to distortion noise which causes the performance loss. In this paper, we study the robust transmission design for a reconfigurable intelligent surface (RIS)-aided secure communication system in the presence of transceiver hardware impairments. We aim for maximizing the secrecy rate while ensuring the transmit power constraint on the active beamforming at the base station and the unit-modulus constraint on the passive beamforming at the RIS. To address this problem, we adopt the alternate optimization method to iteratively optimize one set of variables while keeping the other set fixed. Specifically, the successive convex approximation (SCA) method is used to solve the active beamforming optimization subproblem, while the passive beamforming is obtained by using the semidefinite program (SDP) method. Numerical results illustrate that the proposed transmission design scheme is more robust to the hardware impairments than the conventional non-robust scheme that ignores the impact of the hardware impairments.

cs.IT↗

arXiv2021

Rate-Splitting Multiple Access for Multi-antenna Downlink Communication Systems: Spectral and Energy Efficiency Tradeoff

Rate-splitting (RS) has recently been recognized as a promising physical-layer technique for multi-antenna broadcast channels (BC). Due to its ability to partially decode the interference and partially treat the remaining interference as noise, RS is an enabler for a powerful multiple access, namely rate-splitting multiple access (RSMA), that has been shown to achieve higher spectral efficiency (SE) and energy efficiency (EE) than both space division multiple access (SDMA) and non-orthogonal multiple access (NOMA) in a wide range of user deployments and network loads. As SE maximization and EE maximization are two conflicting objectives, the study of the tradeoff between the two criteria is of particular interest. In this work, we address the SE-EE tradeoff by studying the joint SE and EE maximization problem of RSMA in multiple input single output (MISO) BC with rate-dependent circuit power consumption at the transmitter. To tackle the challenges coming from multiple objective functions and rate-dependent circuit power consumption, we first propose two methods to transform the original problem into a single-objective problem, namely, weighted-sum method and weighted-power method. A successive convex approximation (SCA)-based algorithm is then proposed to jointly optimize the precoders and RS message split of the transformed problem. Numerical results show that our algorithm converges much faster than existing algorithms. In addition, the performance of RS is superior to or equal to non-RS strategy in terms of both SE and EE and their tradeoff.

cs.IT↗

arXiv2021

Stochastic Learning-Based Robust Beamforming Design for RIS-Aided Millimeter-Wave Systems in the Presence of Random Blockages

A fundamental challenge for millimeter wave (mmWave) communications lies in its sensitivity to the presence of blockages, which impact the connectivity of the communication links and ultimately the reliability of the entire network. In this paper, we analyze a reconfigurable intelligent surface (RIS)-aided mmWave communication system for enhancing the network reliability and connectivity in the presence of random blockages. To enhance the robustness of hybrid analog-digital beamforming in the presence of random blockages, we formulate a stochastic optimization problem based on the minimization of the sum outage probability. To tackle the proposed optimization problem, we introduce a low-complexity algorithm based on the stochastic block gradient descent method, which learns sensible blockage patterns without searching for all combinations of potentially blocked links. Numerical results confirm the performance benefits of the proposed algorithm in terms of outage probability and effective data rate.

eess.SP↗

arXiv2020

Robust Beamforming Design for Intelligent Reflecting Surface Aided MISO Communication Systems

Perfect channel state information (CSI) is challenging to obtain due to the limited signal processing capability at the intelligent reflection surface (IRS). In this paper, we study the worst-case robust beamforming design for an IRS-aided multiuser multiple-input single-output (MU-MISO) system under the assumption of imperfect CSI. We aim for minimizing the transmit power while ensuring that the achievable rate of each user meets the quality of service (QoS) requirement for all possible channel error realizations. With unit-modulus and rate constraints, this problem is non-convex. The imperfect CSI further increases the difficulty of solving this problem. By using approximation and transformation techniques, we convert this problem into a squence of semidefinite programming (SDP) subproblems that can be efficiently solved. Numerical results show that the proposed robust beamforming design can guarantee the required QoS targets for all the users.

eess.SP↗

arXiv2020

Intelligent Reflecting Surface Aided Multigroup Multicast MISO Communication Systems

Intelligent reflecting surface (IRS) has recently been envisioned to offer unprecedented massive multiple-input multiple-output (MIMO)-like gains by deploying large-scale and low-cost passive reflection elements. By adjusting the reflection coefficients, the IRS can change the phase shifts on the impinging electromagnetic waves so that it can smartly reconfigure the signal propagation environment and enhance the power of the desired received signal or suppress the interference signal. In this paper, we consider downlink multigroup multicast communication systems assisted by an IRS. We aim for maximizing the sum rate of all the multicasting groups by the joint optimization of the precoding matrix at the base station (BS) and the reflection coefficients at the IRS under both the power and unit-modulus constraint. To tackle this non-convex problem, we propose two efficient algorithms under the majorization--minimization (MM) algorithm framework. Specifically, a concave lower bound surrogate objective function of each user's rate has been derived firstly, based on which two sets of variables can be updated alternately by solving two corresponding second-order cone programming (SOCP) problems. Then, in order to reduce the computational complexity, we derive another concave lower bound function of each group's rate for each set of variables at every iteration, and obtain the closed-form solutions under these loose surrogate objective functions. Finally, the simulation results demonstrate the benefits in terms of the spectral and energy efficiency of the introduced IRS and the effectiveness in terms of the convergence and complexity of our proposed algorithms.

eess.SP↗