Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userChernoff Bounds and Saddlepoint Approximations for the Outage Probability in Intelligent Reflecting Surface Assisted Communication Systems
65
0
0.0
(
0
)
Added by
Tianxiong Wang
Publication date
2020
fields
Electronic Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We analyze the outage probability of an intelligent reflecting surface (IRS)-assisted communication network. A tight upper bound on the outage probability is formulated based on the Chernoff inequality. Furthermore, through an exact asymptotic (a large number of reflecting elements) analysis based on a saddlepoint approximation, we derive closed-form expressions of the outage probability for systems with and without a direct link and obtain the corresponding diversity orders. Simulation results corroborate our theoretical analysis and show the inaccuracies inherent in using the central limit theorem (CLT) to analyze system performance. Our analysis is accurate even for a small number of IRS elements in the high signal-to-noise ratio (SNR) regime.
rate research
Read More
Intelligent reflecting surfaces (IRSs) constitute passive devices, which are capable of adjusting the phase shifts of their reflected signals, and hence they are suitable for passive beamforming. In this paper, we conceive their design with the active beamforming action of multiple-input multipleoutput (MIMO) systems used at the access points (APs) for improving the beamforming gain, where both the APs and users are equipped with multiple antennas. Firstly, we decouple the optimization problem and design the active beamforming for a given IRS configuration. Then we transform the optimization problem of the IRS-based passive beamforming design into a tractable non-convex quadratically constrained quadratic program (QCQP). For solving the transformed problem, we give an approximate solution based on the technique of widely used semidefinite relaxation (SDR). We also propose a low-complexity iterative solution. We further prove that it can converge to a locally optimal value. Finally, considering the practical scenario of discrete phase shifts at the IRS, we give the quantization design for IRS elements on basis of the two solutions. Our simulation results demonstrate the superiority of the proposed solutions over the relevant benchmarks.
In this letter, we investigate an intelligent reflecting surface (IRS) aided device-to-device (D2D) offloading system, where an IRS is employed to assist in computation offloading from a group of users with intensive tasks to another group of idle users. We propose a new two-timescale joint passive beamforming and resource allocation algorithm based on stochastic successive convex approximation to minimize the system latency while cutting down the heavy overhead in exchange of channel state information (CSI). Specifically, the high-dimensional passive beamforming vector at the IRS is updated in a frame-based manner based on the channel statistics, where each frame consists of a number of time slots, while the offloading ratio and user matching strategy are optimized relied on the low-dimensional real-time effective channel coefficients in each time slot. The convergence property and the computational complexity of the proposed algorithm are also examined. Simulation results show that our proposed algorithm significantly outperforms the conventional benchmarks.
This paper considers a secure multigroup multicast multiple-input single-output (MISO) communication system aided by an intelligent reflecting surface (IRS). Specifically, we aim to minimize the transmit power at the Alice via jointly optimizing the transmit beamformer, AN vector and phase shifts at the IRS subject to the secrecy rate constraints as well as the unit modulus constraints of IRS phase shifts. However, the optimization problem is non-convex and directly solving it is intractable. To tackle the optimization problem, we first transform it into a semidefinite relaxation (SDR) problem, and then alternately update the transmit beamformer and AN matrix as well as the phase shifts at the IRS. In order to reduce the high computational complexity, we further propose a low-complexity algorithm based on second-order cone programming (SOCP). We decouple the optimization problem into two sub-problems and optimize the transmit beamformer, AN vector and the phase shifts alternately by solving two corresponding SOCP sub-problem. Simulation results show that the proposed SDR and SOCP schemes require half or less transmit power than the scheme without IRS, which demonstrates the advantages of introducing IRS and the effectiveness of the proposed methods.
This paper investigates the uplink cascaded channel estimation for intelligent-reflecting-surface (IRS)-assisted multi-user multiple-input-single-output systems. We focus on a sub-6 GHz scenario where the channel propagation is not sparse and the number of IRS elements can be larger than the number of BS antennas. A novel channel estimation protocol without the need of on-off amplitude control to avoid the reflection power loss is proposed. In addition, the pilot overhead is substantially reduced by exploiting the common-link structure to decompose the cascaded channel coefficients by the multiplication of the common-link variables and the user-specific variables. However, these two types of variables are highly coupled, which makes them difficult to estimate. To address this issue, we formulate an optimization-based joint channel estimation problem, which only utilizes the covariance of the cascaded channel. Then, we design a low-complexity alternating optimization algorithm with efficient initialization for the non-convex optimization problem, which achieves a local optimum solution. To further enhance the estimation accuracy, we propose a new formulation to optimize the training phase shifting configuration for the proposed protocol, and then solve it using the successive convex approximation algorithm. Comprehensive simulations verify that the proposed algorithm has supreme performance compared to various state-of-the-art baseline schemes.
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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
