arXiv subjects

Xianghao Yu

Publications and source records attributed to Xianghao Yu.

At least 91 records · Page 5Linked to original sources

arXiv2021

Optimal Resource Allocation Design for Large IRS-Assisted SWIPT Systems: A Scalable Optimization Framework

In this paper, we study the optimal resource allocation algorithm design for large intelligent reflecting surface (IRS)-assisted simultaneous wireless information and power transfer (SWIPT) systems. To facilitate efficient system design for large IRSs, instead of jointly optimizing all the IRS elements, we partition the IRS into several tiles and employ a scalable optimization framework comprising an offline design stage and an online optimization stage. In the offline stage, the IRS elements of each tile are jointly designed to support a set of different phase shift configurations, referred to as transmission modes, while the best transmission mode is selected from the set for each tile in the online stage. Given a transmission mode set, we aim to minimize the total base station (BS) transmit power by jointly optimizing the beamforming and the transmission mode selection policy taking into account the quality-of-service requirements of information decoding and non-linear energy harvesting receivers, respectively. Although the resource allocation algorithm design is formulated as a non-convex combinatorial optimization problem, we solve it optimally by applying the branch-and-bound (BnB) approach which entails a high computational complexity. To strike a balance between optimality and computational complexity, we also develop an efficient suboptimal algorithm capitalizing on the penalty method and successive convex approximation. Our simulation results show that the proposed designs enable considerable power savings compared to several baseline schemes. Moreover, our results reveal that by properly adjusting the numbers of tiles and transmission modes, the proposed scalable optimization framework indeed facilitates online design for large IRSs.

cs.IT↗

arXiv2021

Smart and Reconfigurable Wireless Communications: From IRS Modeling to Algorithm Design

Intelligent reflecting surfaces (IRSs) have been introduced into wireless communications systems due to their great potential to smartly customize and reconfigure radio propagation environments in a cost-effective manner. Despite the promising advantages of IRSs, academic research on IRSs is still in its infancy. In particular, the design and analysis of IRS-assisted wireless communication systems critically depend on an accurate and tractable modeling of the IRS. In this article, we first present and compare three IRS models, namely the conventional independent diffusive scatterer-based model, physics-based model, and impedance network-based model, in terms of their accuracy, tractability, and hardware complexity. Besides, a new framework based on partitioning the IRS into tiles and employing codebooks of transmission modes is introduced to enable scalable IRS optimization. Then, we investigate the impact of the three considered IRS models on system design, where several crucial technical challenges for the efficient design of IRS-assisted wireless systems are identified and the corresponding solutions are unraveled. Furthermore, to illustrate the properties of the considered models and the efficiency of the proposed solution concepts, IRS-assisted secure wireless systems and simultaneous wireless information and power transfer (SWIPT) systems are studied in more detail. Finally, several promising future research directions for IRS-assisted wireless systems are highlighted.

cs.IT↗

arXiv2020

IRS-Assisted Green Communication Systems: Provable Convergence and Robust Optimization

Intelligent reflecting surfaces (IRSs) are regarded as a key enabler of green wireless communication, due to their capability of customizing favorable wireless propagation environments. In this paper, we investigate resource allocation for IRS-assisted green multiuser multiple-input single-output (MISO) systems. To minimize the total transmit power, both the beamforming vectors at the access point (AP) and the phase shifts at multiple IRSs are jointly optimized, while taking into account the minimum required quality-of-service (QoS) of multiple users. First, two novel algorithms, namely a penalty-based alternating minimization (AltMin) algorithm and an inner approximation (IA) algorithm, are developed to tackle the non-convexity of the formulated optimization problem when perfect channel state information (CSI) is available. Unlike existing designs that cannot ensure convergence, the proposed penalty-based AltMin and IA algorithms are guaranteed to converge to a stationary point and a Karush-Kuhn-Tucker (KKT) solution of the design problem, respectively. Second, the impact of imperfect knowledge of the CSI of the channels between the AP and the users is investigated. To this end, a non-convex robust optimization problem is formulated and the penalty-based AltMin algorithm is extended to obtain a stationary solution. Simulation results reveal a key trade-off between the speed of convergence and the achievable total transmit power for the two proposed algorithms. In addition, we show that the proposed algorithms can significantly reduce the total transmit power at the AP compared to various baseline schemes and that the optimal numbers of transmit antennas and IRS reflecting elements, which minimize the total power consumption of the considered system, are finite.

cs.IT↗

arXiv2020

A Low-Complexity Algorithmic Framework for Large-Scale IRS-Assisted Wireless Systems

Intelligent reflecting surfaces (IRSs) are revolutionary enablers for next-generation wireless communication networks, with the ability to customize the radio propagation environment. To fully exploit the potential of IRS-assisted wireless systems, reflective elements have to be jointly optimized with conventional communication techniques. However, the resulting optimization problems pose significant algorithmic challenges, mainly due to the large-scale non-convex constraints induced by the passive hardware implementations. In this paper, we propose a low-complexity algorithmic framework incorporating alternating optimization and gradient-based methods for large-scale IRS-assisted wireless systems. The proposed algorithm provably converges to a stationary point of the optimization problem. Extensive simulation results demonstrate that the proposed framework provides significant speedups compared with existing algorithms, while achieving a comparable or better performance.

cs.IT↗

arXiv2020

Resource Allocation for Large IRS-Assisted SWIPT Systems with Non-linear Energy Harvesting Model

In this paper, we investigate resource allocation algorithm design for large intelligent reflecting surface (IRS)-assisted simultaneous wireless information and power transfer (SWIPT) systems. To this end, we adopt a physics-based IRS model that, unlike the conventional IRS model, takes into account the impact of the incident and reflection angles of the impinging electromagnetic wave on the reflected signal. To facilitate efficient resource allocation design for large IRSs, we employ a scalable optimization framework, where the IRS is partitioned into several tiles and the phase shift elements of each tile are jointly designed to realize different transmission modes. Then, the beamforming vectors at the base station (BS) and the transmission mode selection of the tiles of the IRS are jointly optimized for minimization of the BS transmit power taking into account the quality-of-service requirements of both non-linear energy harvesting receivers and information decoding receivers. For handling the resulting non-convex optimization problem, we apply a penalty-based method, successive convex approximation, and semidefinite relaxation to develop a computationally efficient algorithm which asymptotically converges to a locally optimal solution of the considered problem. Our simulation results show that the proposed scheme enables considerable power savings compared to two baseline schemes. Moreover, our results also illustrate that the advocated physics-based model and scalable optimization framework for large IRSs allows us to strike a balance between system performance and computational complexity, which is vital for realizing large IRS-assisted communication systems.

cs.IT↗

arXiv2020

Power-Efficient Resource Allocation for Multiuser MISO Systems via Intelligent Reflecting Surfaces

Intelligent reflecting surfaces (IRSs) are regarded as key enablers of next-generation wireless communications, due to their capability of customizing the wireless propagation environment. In this paper, we investigate power-efficient resource allocation for IRS-assisted multiuser multiple-input single-output (MISO) systems. To minimize the transmit power, both the beamforming vectors at the access point (AP) and phase shifts at the IRS are jointly optimized while taking into account the minimum required quality-of-service (QoS) of the users. To tackle the non-convexity of the formulated optimization problem, an inner approximation (IA) algorithm is developed. Unlike existing designs, which cannot guarantee local optimality, the proposed algorithm is guaranteed to converge to a Karush-Kuhn-Tucker (KKT) solution. Our simulation results show the effectiveness of the proposed algorithm compared to baseline schemes and reveal that deploying IRSs is more promising than leveraging multiple antennas at the AP in terms of energy efficiency.

cs.IT↗

arXiv2020

Channel Estimation for Intelligent Reflecting Surface-Assisted Millimeter Wave MIMO Systems

Intelligent reflecting surfaces (IRSs) are regarded as promising enablers for future millimeter wave (mmWave) wireless communication, due to their ability to create favorable line-of-sight (LoS) propagation environments. In this paper, we investigate channel estimation in downlink IRS-assisted mmWave multiple-input multiple-output (MIMO) systems. By leveraging the sparsity of mmWave channels, we formulate the channel estimation problem as a fixed-rank constrained non-convex optimization problem. To tackle the non-convexity, an efficient algorithm is proposed by capitalizing on alternating minimization and manifold optimization (MO), which yields a locally optimal solution. Simulation results show that the proposed MO-based estimation (MO-EST) algorithm significantly outperforms two benchmark schemes and demonstrate the robustness of the MO-EST algorithm with respect to imperfect knowledge of the sparsity level of the channels in practical implementations.

cs.IT↗

arXiv2020

Robust and Secure Wireless Communications via Intelligent Reflecting Surfaces

In this paper, intelligent reflecting surfaces (IRSs) are employed to enhance the physical layer security in a challenging radio environment. In particular, a multi-antenna access point (AP) has to serve multiple single-antenna legitimate users, which do not have line-of-sight communication links, in the presence of multiple multi-antenna potential eavesdroppers whose channel state information (CSI) is not perfectly known. Artificial noise (AN) is transmitted from the AP to deliberately impair the eavesdropping channels for security provisioning. We investigate the joint design of the beamformers and AN covariance matrix at the AP and the phase shifters at the IRSs for maximization of the system sum-rate while limiting the maximum information leakage to the potential eavesdroppers. To this end, we formulate a robust nonconvex optimization problem taking into account the impact of the imperfect CSI of the eavesdropping channels. To address the non-convexity of the optimization problem, an efficient algorithm is developed by capitalizing on alternating optimization, a penalty-based approach, successive convex approximation, and semidefinite relaxation. Simulation results show that IRSs can significantly improve the system secrecy performance compared to conventional architectures without IRS. Furthermore, our results unveil that, for physical layer security, uniformly distributing the reflecting elements among multiple IRSs is preferable over deploying them at a single IRS.

cs.IT↗

arXiv2020

Resource Allocation for IRS-assisted Full-Duplex Cognitive Radio Systems

In this paper, we investigate the resource allocation design for intelligent reflecting surface (IRS)-assisted full-duplex (FD) cognitive radio systems. In particular, a secondary network employs an FD base station (BS) for serving multiple half-duplex downlink (DL) and uplink (UL) users simultaneously. An IRS is deployed to enhance the performance of the secondary network while helping to mitigate the interference caused to the primary users (PUs). The DL transmit beamforming vectors and the UL receive beamforming vectors at the FD BS, the transmit power of the UL users, and the phase shift matrix at the IRS are jointly optimized for maximization of the total sum rate of the secondary system. The design task is formulated as a non-convex optimization problem taking into account the imperfect knowledge of the PUs' channel state information (CSI) and their maximum interference tolerance. Since the maximum interference tolerance constraint is intractable, we apply a safe approximation to transform it into a convex constraint. To efficiently handle the resulting approximated optimization problem, which is still non-convex, we develop an iterative block coordinate descent (BCD)-based algorithm. This algorithm exploits semidefinite relaxation, a penalty method, and successive convex approximation and is guaranteed to converge to a stationary point of the approximated optimization problem. Our simulation results do not only reveal that the proposed scheme yields a substantially higher system sum rate for the secondary system than several baseline schemes, but also confirm its robustness against CSI uncertainty. Besides, our results illustrate the tremendous potential of IRS for managing the various types of interference arising in FD cognitive radio networks.

cs.IT↗

arXiv2020

Resource Allocation for Intelligent Reflecting Surface-Assisted Cognitive Radio Networks

In this paper, we investigate resource allocation algorithm design for intelligent reflecting surface (IRS)-assisted multiuser cognitive radio (CR) systems. In particular, an IRS is deployed to mitigate the interference caused by the secondary network to the primary users. The beamforming vectors at the base station (BS) and the phase shift matrix at the IRS are jointly optimized for maximization of the sum rate of the secondary system. The algorithm design is formulated as a non-convex optimization problem taking into account the maximum interference tolerance of the primary users. To tackle the resulting non-convex optimization problem, we propose an alternating optimization-based suboptimal algorithm exploiting semidefinite relaxation, the penalty method, and successive convex approximation. Our simulation results show that the system sum rate is dramatically improved by our proposed scheme compared to two baseline schemes. Moreover, our results also illustrate the benefits of deploying IRSs in CR networks.

cs.IT↗

arXiv2020

Enabling Secure Wireless Communications via Intelligent Reflecting Surfaces

In this paper, we propose to utilize intelligent reflecting surfaces (IRSs) for enhancing the physical layer security of wireless communications systems. In particular, an IRS-assisted secure wireless system is considered, where a multi-antenna transmitter communicates with a single-antenna receiver in the presence of an eavesdropper. To maximize the secrecy rate, both the beamformer at the transmitter and the IRS phase shifts are jointly optimized. Based on the block coordinate descent (BCD) and minorization maximization (MM) techniques, two efficient algorithms are developed to solve the resulting non-convex optimization problem for small- and large-scale IRSs, respectively. Simulation results show that IRSs can significantly improve physical layer security if the proposed algorithms are employed. Furthermore, we reveal that deploying large-scale IRSs is more efficient than enlarging the antenna array size of the transmitter for both boosting the secrecy rate and enhancing the energy efficiency.

cs.IT↗

arXiv2020

Optimal Beamforming for MISO Communications via Intelligent Reflecting Surfaces

Wireless communications via intelligent reflecting surfaces (IRSs) has received considerable attention from both academia and industry. In particular, IRSs are able to create favorable wireless propagation environments with typically low-cost passive devices. While various IRS-aided wireless communication systems have been investigated in the literature, thus far, the optimal design of such systems is not well understood. In this paper, IRS-assisted single-user multiple-input single-output (MISO) communication is investigated. To maximize the spectral efficiency, a branch-and-bound (BnB) algorithm is proposed to obtain globally optimal solutions for both the active and passive beamformers at the access point (AP) and the IRS, respectively. Simulation results confirm the effectiveness of deploying IRSs in wireless systems. Furthermore, by taking the proposed optimal BnB algorithm as the performance benchmark, the optimality of existing design algorithms is investigated.

cs.IT↗

arXiv2019

Hybrid Beamforming for 5G and Beyond Millimeter-Wave Systems: A Holistic View

Millimeter-wave (mm-wave) communication is a key technology for future wireless networks. To combat significant path loss and exploit the abundant mm-wave spectrum, effective beamforming is crucial. Nevertheless, conventional fully digital beamforming techniques are inapplicable, as they demand a separate radio frequency (RF) chain for each antenna element, which is costly and consumes too much energy. Hybrid beamforming is a cost-effective alternative, which can significantly reduce the hardware cost and power consumption by employing a small number of RF chains. This paper presents a holistic view on hybrid beamforming for 5G and beyond mm-wave systems, based on a new taxonomy for different hardware structures. We take a pragmatic approach and compare different proposals from three key aspects: 1) hardware efficiency, i.e., the required hardware components; 2) computational efficiency of the associated beamforming algorithm; and 3) achievable spectral efficiency, a main performance indicator. Through systematic comparisons, the interplay and trade-off among these three design aspects are demonstrated, and promising candidates for hybrid beamforming in future wireless networks are identified.

eess.SP↗

arXiv2019

Resource Allocation for Secure IRS-assisted Multiuser MISO Systems

In this paper, we study resource allocation design for secure communication in intelligent reflecting surface (IRS)-assisted multiuser multiple-input single-output (MISO) communication systems. To enhance physical layer security, artificial noise (AN) is transmitted from the base station (BS) to deliberately impair the channel of an eavesdropper. In particular, we jointly optimize the phase shift matrix at the IRS and the beamforming vectors and AN covariance matrix at the BS for maximization of the system sum secrecy rate. To handle the resulting non-convex optimization problem, we develop an efficient suboptimal algorithm based on alternating optimization, successive convex approximation, semidefinite relaxation, and manifold optimization. Our simulation results reveal that the proposed scheme substantially improves the system sum secrecy rate compared to two baseline schemes.

cs.IT↗

arXiv2019

Doubling Phase Shifters for Efficient Hybrid Precoder Design in Millimeter-Wave Communication Systems

Hybrid precoding is a cost-effective approach to support directional transmissions for millimeter-wave (mm-wave) communications, but its precoder design is highly complicated. In this paper, we propose a new hybrid precoder implementation, namely the double phase shifter (DPS) implementation, which enables highly tractable hybrid precoder design. Efficient algorithms are then developed for two popular hybrid precoder structures, i.e., the fully- and partially-connected structures. For the fully-connected one, the RF-only precoding and hybrid precoding problems are formulated as a least absolute shrinkage and selection operator (LASSO) problem and a low-rank matrix approximation problem, respectively. In this way, computationally efficient algorithms are provided to approach the performance of the fully digital one with a small number of radio frequency (RF) chains. On the other hand, the hybrid precoder design in the partially-connected structure is identified as an eigenvalue problem. To enhance the performance of this cost-effective structure, dynamic mapping from RF chains to antennas is further proposed, for which a greedy algorithm and a modified K-means algorithm are developed. Simulation results demonstrate the performance gains of the proposed hybrid precoding algorithms over existing ones. It shows that, with the proposed DPS implementation, the fully-connected structure enjoys both satisfactory performance and low design complexity while the partially-connected one serves as an economic solution with low hardware complexity.

eess.SP↗

arXiv2019

MISO Wireless Communication Systems via Intelligent Reflecting Surfaces

Intelligent reflecting surfaces (IRSs) have received considerable attention from the wireless communications research community recently. In particular, as low-cost passive devices, IRSs enable the control of the wireless propagation environment, which is not possible in conventional wireless networks. To take full advantage of such IRS-assisted communication systems, both the beamformer at the access point (AP) and the phase shifts at the IRS need to be optimally designed. However, thus far, the optimal design is not well understood. In this paper, a point-to-point IRS-assisted multiple-input single-output (MISO) communication system is investigated. The beamformer at the AP and the IRS phase shifts are jointly optimized to maximize the spectral efficiency. Two efficient algorithms exploiting fixed point iteration and manifold optimization techniques, respectively, are developed for solving the resulting non-convex optimization problem. The proposed algorithms not only achieve a higher spectral efficiency but also lead to a lower computational complexity than the state-of-the-art approach. Simulation results reveal that deploying large-scale IRSs in wireless systems is more efficient than increasing the antenna array size at the AP for enhancing both the spectral and the energy efficiency.

cs.IT↗

arXiv2019

A Tractable Framework for Coverage Analysis of Cellular-Connected UAV Networks

Unmanned aerial vehicles (UAVs) have recently found abundant applications in the public and civil domains. To ensure reliable control and navigation, connecting UAVs to controllers via existing cellular network infrastructure, i.e., ground base stations (GBSs), has been proposed as a promising solution. Nevertheless, it is highly challenging to characterize the communication performance of cellular-connected UAVs, due to their unique propagation conditions. This paper proposes a tractable framework for the coverage analysis of cellular-connected UAV networks, which consists of a new blockage model and an effective approach to handle general fading channels. In particular, a line-of-sight (LoS) ball model is proposed to capture the probabilistic propagation in UAV communication systems, and a tractable expression is derived for the Laplace transform of the aggregate interference with general Nakagami fading. This framework leads to a tractable expression for the coverage probability, which in turn helps to investigate the impact of the GBS density. Specifically, a tight lower bound on the optimal density that maximizes the coverage probability is derived. Numerical results show that the proposed LoS ball model is accurate, and the optimal GBS density decreases when the UAV altitude increases.

cs.IT↗

arXiv2018

A Unified Framework for the Tractable Analysis of Multi-Antenna Wireless Networks

Densifying networks and deploying more antennas at each access point are two principal ways to boost the capacity of wireless networks. However, the complicated distributions of the signal power and the accumulated interference power, largely induced by various space-time processing techniques, make it highly challenging to quantitatively characterize the performance of multi-antenna networks. In this paper, using tools from stochastic geometry, a unified framework is developed for the analysis of such networks. The major results are two innovative representations of the coverage probability, which make the analysis of multi-antenna networks almost as tractable as the single-antenna case. One is expressed as an $\ell_1$-induced norm of a Toeplitz matrix, and the other is given in a finite sum form. With a compact representation, the former incorporates many existing analytical results on single- and multi-antenna networks as special cases, and leads to tractable expressions for evaluating the coverage probability in both ad hoc and cellular networks. While the latter is more complicated for numerical evaluation, it helps analytically gain key design insights. In particular, it helps prove that the coverage probability of ad hoc networks is a monotonically decreasing convex function of the transmitter density and that there exists a peak value of the coverage improvement when increasing the number of transmit antennas. On the other hand, in multi-antenna cellular networks, it is shown that the coverage probability is independent of the transmitter density and that the outage probability decreases exponentially as the number of transmit antennas increases.

cs.IT↗