Proceedings of the 5th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications 2010
DOI: 10.4108/icst.crowncom2010.9247
|View full text |Cite
|
Sign up to set email alerts
|

Iterative dual downlink beamforming for cognitive radio networks

Abstract: We address the problem of multi-user downlink beamforming and power allocation in a cognitive radio (CR) secondary network (SN) with constraints on the total interference in the primary network (PN). We derive the Lagrange dual of the problem and show that both problems are equivalent. Two algorithms are proposed to solve the problem. The first is based on convex optimization and the second algorithm exploits the uplink-downlink duality that is enforced by the introduction of appropriate slack variables in the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
33
0

Year Published

2010
2010
2015
2015

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 26 publications
(33 citation statements)
references
References 10 publications
0
33
0
Order By: Relevance
“…In [2], it demonstrates that there exists a dual virtual uplink problem which is equivalent to the downlink MISO problem. According to this result, the inner problem is equivalent to a dual problem that minimizing the total virtual uplink power with respect to virtual uplink QoS requirements.…”
Section: Cognitive Beamforming With Perfect Informationmentioning
confidence: 98%
See 4 more Smart Citations
“…In [2], it demonstrates that there exists a dual virtual uplink problem which is equivalent to the downlink MISO problem. According to this result, the inner problem is equivalent to a dual problem that minimizing the total virtual uplink power with respect to virtual uplink QoS requirements.…”
Section: Cognitive Beamforming With Perfect Informationmentioning
confidence: 98%
“…The efficient approximate solution is to use SDP relaxation by introducing new variables U k = t k t H k and V k = r k r H k [5]. SDP relaxation does not involve any approximation as the resulting solution is always rank-one [2]. Hence, the rank-one solutions can be recovered from the optimal solution U k and V k straightforwardly by using the principal eigenvector corresponding to the only non-zero eigenvalue.…”
Section: Cognitive Beamforming With Perfect Informationmentioning
confidence: 98%
See 3 more Smart Citations