2006 IEEE International Conference on Acoustics Speed and Signal Processing Proceedings
DOI: 10.1109/icassp.2006.1661440
|View full text |Cite
|
Sign up to set email alerts
|

Convex Transmit Beamforming for Downlink Multicasting to Multiple Co-Channel Groups

Abstract: We consider the problem of transmit beamforming to multiple cochannel multicast groups. Since the direct minimization of transmit power while guaranteeing a prescribed minimum signal to interference plus noise ratio (SINR) at each receiver is nonconvex and NPhard, we present convex SDP relaxations of this problem and study when such relaxations are tight. Our results show that when the steering vectors for all receivers are of Vandermonde type (such as in the case of a uniform linear array and line-of-sight pr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
26
0

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 25 publications
(26 citation statements)
references
References 9 publications
0
26
0
Order By: Relevance
“…Assume the existence of another feasible solution with associated optimal value . This contradicts optimality of for , 2 As for problem Q, there exist special cases of problem F that are not NP-hard: e.g., for Vandermonde channel vectors it admits a SDP reformulation [8], [9] and for independent data transmission a generalized eigenvalue problem reformulation [18]. 3 The meaning will be clear from context.…”
Section: Joint Max-min Fair Beamformingmentioning
confidence: 99%
See 1 more Smart Citation
“…Assume the existence of another feasible solution with associated optimal value . This contradicts optimality of for , 2 As for problem Q, there exist special cases of problem F that are not NP-hard: e.g., for Vandermonde channel vectors it admits a SDP reformulation [8], [9] and for independent data transmission a generalized eigenvalue problem reformulation [18]. 3 The meaning will be clear from context.…”
Section: Joint Max-min Fair Beamformingmentioning
confidence: 99%
“…Interestingly, our numerical findings indicate that the solutions generated by our algorithms are often exactly optimal, especially in the case of measured channels. In certain cases, this optimality can be proven beforehand, and alternative convex reformulations of lower complexity can be constructed; see [8] and [9] for further details. In other cases, a theoretical worst-case bound on approximation accuracy can be derived, and shown to be tight; on this issue, see [15].…”
Section: Discussionmentioning
confidence: 99%
“…Assuming far-field, line-ofsight conditions, the user channels can be modeled using Vandermonde matrices. For this important special case, the SPC multicast multigroup problem was reformulated into a convex optimization problem and solved in [15], [16]. These results where motivated by the observation that in sum power constrained ULA scenarios, the relaxation consistently yields rank one solutions.…”
Section: A Uniform Linear Arraysmentioning
confidence: 99%
“…Therefore, statistical information about the channel error vectors is not required in this approach, and the rough knowledge of the upper-bound of channel error vector norms is sufficient. 3 To simplify the problem (8a)-(8c), we modify the inequality constraints (8b) and (8c) using an approach similar to the one developed in [23], [26], and [27]. From the triangle inequality, it follows…”
Section: A Transmit Power Minimization Based Beamformingmentioning
confidence: 99%