The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Zero-Forcing Methods for Downlink Spatial Multiplexing in Multiuser MIMO Channels
Abstract
The use of space-division multiple access (SDMA) in the downlink of a multiuser multiple-input, multiple-output (MIMO) wireless communications network can provide a substantial gain in system throughput. The challenge in such multiuser systems is designing transmit vectors while considering the co-channel interference of other users. Typical optimization problems of interest include the capacity problem - maximizing the sum information rate subject to a power constraint-or the power control problem-minimizing transmitted power such that a certain quality-of-service metric for each user is met. Neither of these problems possess closed-form solutions for the general multiuser MIMO channel, but the imposition of certain constraints can lead to closed-form solutions. This paper presents two such constrained solutions. The first, referred to as "block-diagonalization," is a generalization of channel inversion when there are multiple antennas at each receiver. It is easily adapted to optimize for either maximum transmission rate or minimum power and approaches the optimal solution at high SNR. The second, known as "successive optimization," is an alternative method for solving the power minimization problem one user at a time, and it yields superior results in some (e.g., low SNR) situations. Both of these algorithms are limited to cases where the transmitter has more antennas than all receive antennas combined. In order to accommodate more general scenarios, we also propose a framework for coordinated transmitter-receiver processing that generalizes the two algorithms to cases involving more receive than transmit antennas. While the proposed algorithms are suboptimal, they lead to simpler transmitter and receiver structures and allow for a reasonable tradeoff between performance and complexity.
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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas
Foschini, G. J., & Gans, M. J. (1998) · Wireless Personal Communications · doi:10.1023/a:1008889222784 · Cited by 10,091
Writing on dirty paper (Corresp.)
Costa, M. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056659 · Cited by 3,735
Wolniansky, P. W., Foschini, G. J., Golden, G. D., & Valenzuela, R. A. (2002) · 1998 URSI International Symposium on Signals, Systems, and Electronics. Conference Proceedings (Cat. No.98EX167) · doi:10.1109/issse.1998.738086 · Cited by 3,527
On the achievable throughput of a multiantenna Gaussian broadcast channel
Caire, G., & Shamai, S. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.813523 · Cited by 2,527
Duality, achievable rates, and sum-rate capacity of gaussian mimo broadcast channels
Vishwanath, S., Jindal, N., & Goldsmith, A. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.817421 · Cited by 1,683
Spatio-temporal coding for wireless communication
Raleigh, G. G., & Cioffi, J. M. (1998) · IEEE Transactions on Communications · doi:10.1109/26.662641 · Cited by 1,460
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
Sum Capacity of Gaussian Vector Broadcast Channels
Yu, W., & Cioffi, J. M. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.833336 · Cited by 742
MIMO capacity with interference
Blum, R. S. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2003.810345 · Cited by 459
Asymptotically optimal water-filling in vector multiple-access channels
Viswanath, P., Tse, D. N. C., & Anantharam, V. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.904525 · Cited by 199
Interference avoidance for multiaccess vector channels
Popescu, D. C., Popescu, O., & Rose, C. (2003) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2002.1023771 · Cited by 20
Cited by
Wireless Networks With RF Energy Harvesting: A Contemporary Survey
Lu, X., Wang, P., Niyato, D., Kim, D. I., & Han, Z. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2368999 · Cited by 2,603
On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming
Taesa, & Goldsmith, A. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.862421 · Cited by 2,057
Improving Wireless Physical Layer Security via Cooperating Relays
Dong, L., Han, Z., Petropulu, A. P., & Poor, H. V. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2038412 · Cited by 1,366
Joint Spatial Division and Multiplexing—The Large-Scale Array Regime
Adhikary, A., Nam, J., Ahn, J.-Y., & Caire, G. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2269476 · Cited by 1,317
Limited Feedback Hybrid Precoding for Multi-User Millimeter Wave Systems
Alkhateeb, A., Leus, G., & Heath, R. W. (2015) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2015.2455980 · Cited by 1,099
Metadata
- Authors
- Spencer, Q. H., Swindlehurst, A. L., & Haardt, M.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2004-02
- Volume
- 52
- Issue
- 2
- Pages
- 461-471
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2098126478
- Cited by
- 3,148
- References
- 13
- FWCI
- 77.82
- 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.