Outage Constrained Robust Transmit Optimization for Multiuser MISO Downlinks: Tractable Approximations by Conic Optimization
By Kun-Yu Wang, Anthony Man-Cho So, Tsung-Hui Chang, Wing-Kin Ma, Chong-Yung Chi. IEEE Transactions on Signal Processing, 2011
832 citations recorded by the source corpus.
In this paper, we study a probabilistically robust transmit optimization problem under imperfect channel state information (CSI) at the transmitter and under the multiuser multiple-input single-output (MISO) downlink scenario. The main issue is to keep the probability of each user's achievable rate outage as caused by CSI uncertainties below a given threshold. As is well known, such rate outage constraints present a significant analytical and computational challenge. Indeed, they do not admit simple closed-form expressions and are unlikely to be efficiently computable in general. Assuming Gaussian CSI uncertainties, we first review a traditional robust optimization-based method for approximating the rate outage constraints, and then develop two novel approximation methods using probabilistic techniques. Interestingly, these three methods can be viewed as implementing different tractable analytic upper bounds on the tail probability of a complex Gaussian quadratic form, and they provide convex restrictions, or safe tractable approximations, of the original rate outage constraints. In particular, a feasible solution from any one of these methods will automatically satisfy the rate outage constraints, and all three methods involve convex conic programs that can be solved efficiently using off-the-shelf solvers. We then proceed to study the performance-complexity tradeoffs of these methods through computational complexity and comparative approximation performance analyses. Finally, simulation results are provided to benchmark the three convex restriction methods against the state of the art in the literature. The results show that all three methods offer significantly improved solution quality and much lower complexity.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/68606e5af535c2338b87bd0903e0e4db56cd1520
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Rui Zhang
- Qingqing Wu
- Derrick Wing Kwan Ng
- Robert Schober
- Wei Yu
- Zhijin Qin
- Geoffrey Y. Li
- Yunlong Cai
In Electrical and Electronic Engineering
- Rui Zhang
- Robert Schober
- Qingqing Wu
- Derrick Wing Kwan Ng
- Wei Yu
- Cunhua Pan
- Ying-Chang Liang
- Geoffrey Y. Li
Citations in the corpus
- Secure Radar-Communication Systems With Malicious Targets: Integrating Radar, Communications and Jamming Functionalities (2019, methodology): “9). We denote Φ0 = card(Φ) and Ω0 = card(Ω) as the cardinality of Φ and Ω, respectively. Likely, eigenvalue decomposition operation is requiredas well, with thecost of O (K +1)N3 . Thus, referring to [39], we give the computational complexity in Table I, which can be simplified as O 3 √ 2Niter ln(1/ǫ”
- An Overview of Signal Processing Techniques for RIS/IRS-Aided Wireless Systems (2021, neutral): “One method to circumvent this issue is the Bernstein-Type inequality [180], which transforms an intractable outage probability constraint into a tractable linear matrix inequality [114].”
- Common Throughput Maximization in UAV-Enabled OFDMA Systems With Delay Consideration (2018, background): “Based on the analytical expression in [42], the total complexity of”
- A Framework of Robust Transmission Design for IRS-Aided MISO Communications With Imperfect Cascaded Channels (2020, methodology): “Please refer to [29] for the proof of Lemma 5.”
- Intelligent Reflecting Surface Meets OFDM: Protocol Design and Rate Maximization (2019, neutral): “2) is thus given by [22], i.e., O ( K 4 .”
- Robust Beamforming for Secure Communication in Systems With Wireless Information and Power Transfer (2013, background): “The optimization problem in (16) is a non-convex quadratically constrained quadratic program (QCQP) which involve s chance constrained programming [24], [25] and semi-infinit e programming.”
- Hybrid Digital and Analog Beamforming Design for Large-Scale Antenna Arrays (2016, methodology): “formers assuming perfect CSI, and then to design the digital beamformers employing robust beamforming techniques [11]– [15] to deal with imperfect CSI.”
- Spatially Selective Artificial-Noise Aided Transmit Optimization for MISO Multi-Eves Secrecy Rate Maximization (2013, methodology): “Readers are referred to the literature, such as [36], for mor e c mplete descriptions of the sphere bounding method.”
- Full-Duplex Communication for ISAC: Joint Beamforming and Power Optimization (2022, methodology): “Following [35, Section V-A], which presents a detailed method to quantitatively analyze the computational complexity of solving a convex problem through the interior point method, we obtain the complexity order for solving (27) as”
- Joint Offloading and Trajectory Design for UAV-Enabled Mobile Edge Computing Systems (2019, background): “In this section, the computational complexity of the proposed algorithms is analyzed [34].”