The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Rank-Constrained Separable Semidefinite Programming With Applications to Optimal Beamforming
Abstract
Consider a downlink communication system where multiantenna base stations transmit independent data streams to decentralized single-antenna users over a common frequency band. The goal of the base stations is to jointly adjust the beamforming vectors to minimize the transmission powers while ensuring the signal-to-interference-noise ratio requirement of each user within the system. At the same time, it may be necessary to keep the interference generated on other coexisting systems under a certain tolerable level. In addition, one may want to include general individual shaping constraints on the beamforming vectors. This beamforming problem is a separable homogeneous quadratically constrained quadratic program, and it is difficult to solve in general. In this paper, we give conditions under which strong duality holds and propose efficient algorithms for the optimal beamforming problem. First, we study rank-constrained solutions of general separable semidefinite programs (SDPs) and propose rank reduction procedures to achieve a lower rank solution. Then we show that the SDP relaxation of three classes of optimal beamforming problem always has a rank-one solution, which can be obtained by invoking the rank reduction procedures.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Writing on dirty paper (Corresp.)
Costa, M. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056659 · Cited by 3,735
Solution of the Multiuser Downlink Beamforming Problem With Individual SINR Constraints
Schubert, M., & Boche, H. (2004) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2003.819629 · Cited by 1,178
Transmit beamforming and power control for cellular wireless systems
Rashid-Farrokhi, F., Liu, K. J. R., & Tassiulas, L. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.730452 · Cited by 867
Handbook of Antennas in Wireless Communications
(2001) · Electrical Engineering & Applied Signal Processing Series · doi:10.1201/9781420042146 · Cited by 863
Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications
Ben-Tal, A., & Nemirovski, A. (2001) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718829 · Cited by 747
Quality of Service and Max-Min Fair Transmit Beamforming to Multiple Cochannel Multicast Groups
Karipidis, E., Sidiropoulos, N. D., & Luo, Z.-Q. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.909010 · Cited by 585
Convex Optimization in Signal Processing and Communications
(2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804458 · Cited by 554
On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
Pataki, G. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.2.339 · Cited by 332
Iterative multiuser uplink and downlink beamforming under SINR constraints
Schubert, M., & Boche, H. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.849164 · Cited by 205
Scutari, G., Palomar, D. P., & Barbarossa, S. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2008.929297 · Cited by 203
Self-citationComplex Matrix Decomposition and Quadratic Programming
Huang, Y., & Zhang, S. (2007) · Mathematics of Operations Research · doi:10.1287/moor.1070.0268 · Cited by 176
Self-citationOn maximization of quadratic form over intersection of ellipsoids with common center
Nemirovski, A., Roos, C., & Terlaky, T. (1999) · Mathematical Programming · doi:10.1007/s101070050100 · Cited by 168
Far-Field Multicast Beamforming for Uniform Linear Antenna Arrays
Karipidis, E., Sidiropoulos, N. D., & Luo, Z.-Q. T. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.897903 · Cited by 147
Doubly Constrained Robust Capon Beamformer With Ellipsoidal Uncertainty Sets
Beck, A., & Eldar, Y. C. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.885729 · Cited by 67
Chang, T., Luo, Z.-Q. T., & Chi, C. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.921762 · Cited by 65
Cited by
Semidefinite Relaxation of Quadratic Optimization Problems
Luo, Z.-Q., Ma, W.-K., So, A., Ye, Y., & Zhang, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936019 · Cited by 3,715
Convex Optimization-Based Beamforming
Gershman, A., Sidiropoulos, N., Shahbazpanahi, S., Bengtsson, M., & Ottersten, B. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936015 · Cited by 571
Multiuser MISO Beamforming for Simultaneous Wireless Information and Power Transfer
Xu, J., Liu, L., & Zhang, R. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2340817 · Cited by 521
Secrecy Wireless Information and Power Transfer With MISO Beamforming
Liu, L., Zhang, R., & Chua, K.-C. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2303422 · Cited by 446
Liao, W.-C., Chang, T.-H., Ma, W.-K., & Chi, C.-Y. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2094610 · Cited by 390
Metadata
- Authors
- Huang, Y., & Palomar, D. P.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2010-02
- Volume
- 58
- Issue
- 2
- Pages
- 664-678
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2122744491
- Cited by
- 561
- References
- 16
- FWCI
- 13.73
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.