Sciweavers

Share
TSP
2008

Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem

8 years 12 months ago
Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users over a common bandwidth. The goal of the base station is to select appropriate beamforming vectors so as to maximize the minimum signal-to-interference-plus-noise ratio (SINR) among all users under a power budget constraint. Since this max-min-fair transmit beamforming problem is NP-hard in general, a randomized polynomial time approximation approach based on semidefinite relaxation (SDR) has been proposed recently where excellent performance in both simulated and measured wireless channels has been reported. This paper shows that the SDR-based approach can provide at least an (1 ) approximation to the optimum solution, where is the total number of users. This estimate implies that the SDR solution achieves an SINR that is at most (log + (1)) dB away from the highest possible value. The existence of such a data ...
Tsung-Hui Chang, Zhi-Quan Luo, Chong-Yung Chi
Added 16 Dec 2010
Updated 16 Dec 2010
Type Journal
Year 2008
Where TSP
Authors Tsung-Hui Chang, Zhi-Quan Luo, Chong-Yung Chi
Comments (0)
books