The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Coordinated Beamforming for MISO Interference Channel: Complexity Analysis and Efficient Algorithms
Abstract
In a cellular wireless system, users located at cell edges often suffer significant out-of-cell interference. Assuming each base station is equipped with multiple antennas, we can model this scenario as a multiple-input single-output (MISO) interference channel. In this paper we consider a coordinated beamforming approach whereby multiple base stations jointly optimize their downlink beamforming vectors in order to simultaneously improve the data rates of a given group of cell edge users. Assuming perfect channel knowledge, we formulate this problem as the maximization of a system utility (which balances user fairness and average user rates), subject to individual power constraints at each base station. We show that, for the single-carrier case and when the number of antennas at each base station is at least two, the optimal coordinated beamforming problem is NP-hard for both the harmonic mean utility and the proportional fairness utility. For general utilities, we propose a cyclic coordinate descent algorithm, which enables each transmitter to update its beamformer locally with limited information exchange and establish its global convergence to a stationary point. We illustrate its effectiveness in computer simulations by using the space matched beamformer as the benchmark.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
(1979) · Cited by 43,841
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Two-Point Step Size Gradient Methods
BARZILAI, J., & BORWEIN, J. M. (1988) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/8.1.141 · Cited by 2,873
Computation of channel capacity and rate-distortion functions
Blahut, R. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054855 · Cited by 1,381
Sum capacity of the vector Gaussian broadcast channel and uplink–downlink duality
Viswanath, P., & Tse, D. N. C. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.814483 · Cited by 1,290
Linear precoding via conic optimization for fixed MIMO receivers
Wiesel, A., Eldar, Y. C., & Shamai, S. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.861073 · Cited by 974
Dynamic Spectrum Management: Complexity and Duality
Luo, Z.-Q., & Zhang, S. (2008) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.914876 · Cited by 929
Self-citationKarakayali, M. K., Foschini, G. J., & Valenzuela, R. A. (2006) · IEEE Wireless Communications · doi:10.1109/mwc.2006.1678166 · Cited by 919
Cited by
Satellite Communications in the New Space Era: A Survey and Future Challenges
Kodheli, O., Lagunas, E., Maturo, N., Sharma, S. K., Shankar, B., Montoya, J. F. M., Duncan, J. C. M., Spano, D., Chatzinotas, S., Kisseleff, S., et al. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.3028247 · Cited by 1,524
Joint Transmit Beamforming for Multiuser MIMO Communications and MIMO Radar
Liu, X., Huang, T., Shlezinger, N., Liu, Y., Zhou, J., & Eldar, Y. C. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3004739 · Cited by 992
Self-citationFoundations of MIMO Communication
Heath Jr, R. W., & Lozano, A. (2018) · Cambridge University Press eBooks · doi:10.1017/9781139049276 · Cited by 426
Unfolding WMMSE Using Graph Neural Networks for Efficient Power Allocation
Chowdhury, A., Verma, G., Rao, C., Swami, A., & Segarra, S. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3071480 · Cited by 162
Large-Scale Convex Optimization for Dense Wireless Cooperative Networks
Shi, Y., Zhang, J., O'Donoghue, B., & Letaief, K. B. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2443731 · Cited by 118
Metadata
- Authors
- Liu, Y.-F., Dai, Y.-H., & Luo, Z.-Q.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2011-03
- Volume
- 59
- Issue
- 3
- Pages
- 1142-1157
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2109800347
- Cited by
- 286
- References
- 33
- FWCI
- 12.96
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Coordinated Beamforming for MISO Interference Channel: Complexity Analysis and Efficient Algorithms. https://app.cochat.ai/papers/10.1109/tsp.2010.2092772
- The paper
- Liu, Y.-F., Dai, Y.-H., & Luo, Z.-Q. (2011). Coordinated Beamforming for MISO Interference Channel: Complexity Analysis and Efficient Algorithms. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2010.2092772
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.
