The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Dirty-Paper Coding Versus TDMA for MIMO Broadcast Channels
Abstract
We compare the capacity of dirty-paper coding (DPC) to that of time-division multiple access (TDMA) for a multiple-antenna (multiple-input multiple-output (MIMO)) Gaussian broadcast channel (BC). We find that the sum-rate capacity (achievable using DPC) of the multiple-antenna BC is at most min(M,K) times the largest single-user capacity (i.e., the TDMA sum-rate) in the system, where M is the number of transmit antennas and K is the number of receivers. This result is independent of the number of receive antennas and the channel gain matrix, and is valid at all signal-to-noise ratios (SNRs). We investigate the tightness of this bound in a time-varying channel (assuming perfect channel knowledge at receivers and transmitters) where the channel experiences uncorrelated Rayleigh fading and in some situations we find that the dirty paper gain is upper-bounded by the ratio of transmit-to-receive antennas. We also show that min(M,K) upper-bounds the sum-rate gain of successive decoding over TDMA for the uplink channel, where M is the number of receive antennas at the base station and K is the number of transmitters.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Capacity of Multi‐antenna Gaussian Channels
Telatar, E. (1999) · European Transactions on Telecommunications · doi:10.1002/ett.4460100604 · Cited by 11,234
Writing on dirty paper (Corresp.)
Costa, M. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056659 · Cited by 3,735
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
Self-citationData throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system
Jalali, A., Padovani, R., & Pankaj, R. K. (2002) · IEEE Vehicular Technology Conference (VTC) · doi:10.1109/vetecs.2000.851593 · Cited by 1,421
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
Multiple-Antenna Channel Hardening and Its Implications for Rate Feedback and Scheduling
Hochwald, B. M., Marzetta, T. L., & Tarokh, V. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.833345 · Cited by 674
Sum Power Iterative Water-Filling for Multi-Antenna Gaussian Broadcast Channels
Jindal, N., Rhee, W., Vishwanath, S., Jafar, S. A., & Goldsmith, A. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.844082 · Cited by 622
Self-citationCapacity and optimal resource allocation for fading broadcast channels .I. Ergodic capacity
Li, L., & Goldsmith, A. J. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.915665 · Cited by 518
Self-citation
Cited by
Millimeter-Wave Massive MIMO Communication for Future Wireless Systems: A Survey
Busari, S. A., Huq, K. M. S., Mumtaz, S., Dai, L., & Rodriguez, J. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2787460 · Cited by 730
Multiuser MIMO Achievable Rates With Downlink Training and Channel State Feedback
Caire, G., Jindal, N., Kobayashi, M., & Ravindran, N. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2046225 · Cited by 537
Self-citationJoudeh, H., & Clerckx, B. (2016) · IEEE Transactions on Communications · doi:10.1109/tcomm.2016.2603991 · Cited by 432
Peng, M., Sun, Y., Li, X., Mao, Z., & Wang, C. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2548658 · Cited by 386
Beam Alignment in mmWave V2X Communications: A Survey
Tan, J., Luan, T. H., Guan, W., Wang, Y., Peng, H., Zhang, Y., Zhao, D., & Lu, N. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3383093 · Cited by 75
Metadata
- Authors
- Jindal, N., & Goldsmith, A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2005-05
- Volume
- 51
- Issue
- 5
- Pages
- 1783-1794
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2053896644
- Cited by
- 346
- References
- 11
- FWCI
- 31.14
- 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: Dirty-Paper Coding Versus TDMA for MIMO Broadcast Channels. https://app.cochat.ai/papers/10.1109/tit.2005.846425
- The paper
- Jindal, N., & Goldsmith, A. (2005). Dirty-Paper Coding Versus TDMA for MIMO Broadcast Channels. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2005.846425
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.