The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Capacity and optimal resource allocation for fading broadcast channels .I. Ergodic capacity
Abstract
In multiuser wireless systems, dynamic resource allocation between users and over time significantly improves efficiency and performance. In this two-part paper, we study three types of capacity regions for fading broadcast channels and obtain their corresponding optimal resource allocation strategies: the ergodic (Shannon) capacity region, the zero-outage capacity region, and the outage capacity region with nonzero outage. We derive the ergodic capacity region of an M-user fading broadcast channel for code division (CD), time division (TD), and frequency division (FD), assuming that both the transmitter and the receivers have perfect channel side information (CSI). It is shown that by allowing dynamic resource allocation, TD, FD, and CD without successive decoding have the same ergodic capacity region, while optimal CD has a larger region. Optimal resource allocation policies are obtained for these different spectrum-sharing techniques. A simple suboptimal policy is also proposed for TD and CD without successive decoding that results in a rate region quite close to the ergodic capacity region. Numerical results are provided for different fading broadcast channels.
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
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
The m-Distribution—A General Formula of Intensity Distribution of Rapid Fading
NAKAGAMI, M. (1960) · Statistical Methods in Radio Wave Propagation · doi:10.1016/b978-0-08-009306-2.50005-4 · Cited by 2,552
Variable-rate variable-power MQAM for fading channels
Goldsmith, A. J., & Chua, S.-G. (1997) · IEEE Transactions on Communications · doi:10.1109/26.634685 · Cited by 2,296
Self-citationInformation capacity and power control in single-cell multiuser communications
Knopp, R., & Humblet, P. A. (2002) · Proceedings IEEE International Conference on Communications ICC '95 · doi:10.1109/icc.1995.525188 · Cited by 2,059
Capacity of fading channels with channel side information
Goldsmith, A. J., & Varaiya, P. P. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.641562 · Cited by 2,018
Self-citationBradley, R. C., & Billingsley, P. (1987) · Journal of the American Statistical Association · doi:10.2307/2288811 · Cited by 774
Optimum power control over fading channels
Caire, G., Taricco, G., & Biglieri, E. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.771147 · Cited by 755
A simple converse for broadcast channels with additive white Gaussian noise (Corresp.)
Bergmans, P. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055184 · Cited by 445
Cited by
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
Capacity limits of MIMO channels
Goldsmith, A., Jafar, S. A., Jindal, N., & Vishwanath, S. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2003.810294 · Cited by 2,379
Self-citationReconfigurable Intelligent Surfaces: Principles and Opportunities
Liu, Y., Liu, X., Mu, X., Hou, T., Xu, J., Di Renzo, M., & Al-Dhahir, N. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3077737 · Cited by 1,847
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Throughput Maximization in Wireless Powered Communication Networks
Ju, H., & Zhang, R. (2014) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2013.112513.130760 · Cited by 1,490
Nonorthogonal Multiple Access for 5G and Beyond
Liu, Y., Qin, Z., Elkashlan, M., Ding, Z., Nallanathan, A., & Hanzo, L. (2017) · Proceedings of the IEEE · doi:10.1109/jproc.2017.2768666 · Cited by 1,369
Design challenges for energy-constrained ad hoc wireless networks
Goldsmith, A. J., & Wicker, S. B. (2002) · IEEE Wireless Communications · doi:10.1109/mwc.2002.1028874 · Cited by 952
Self-citationSecure Communication Over Fading Channels
Liang, Y., Poor, H. V., & Shamai, S. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921678 · Cited by 937
Information Theoretic Security
Liang, Y., Poor, H. V., & Shamai (Shitz), S. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601982414 · Cited by 686
Dynamic power allocation and routing for time-varying wireless networks
Neely, M. J., Modiano, E., & Rohrs, C. E. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.837349 · Cited by 596
Information Theoretic Security
Liang, Y., Poor, H. V., & Shamai (Shitz), S. (2009) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000036 · Cited by 570
Simultaneous Routing and Resource Allocation Via Dual Decomposition
Xiao, L., Johansson, M., & Boyd, S. P. (2004) · IEEE Transactions on Communications · doi:10.1109/tcomm.2004.831346 · Cited by 561
Modeling and Analysis of Cellular Networks Using Stochastic Geometry: A Tutorial
ElSawy, H., Sultan-Salem, A., Alouini, M.-S., & Win, M. Z. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2624939 · Cited by 524
On the Duality of Gaussian Multiple-Access and Broadcast Channels
Jindal, N., Vishwanath, S., & Goldsmith, A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.826646 · Cited by 453
Self-citationFairness and Optimal Stochastic Control for Heterogeneous Networks
Neely, M. J., Modiano, E., & Li, C.-P. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.900405 · Cited by 433
Dirty-Paper Coding Versus TDMA for MIMO Broadcast Channels
Jindal, N., & Goldsmith, A. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.846425 · Cited by 346
Self-citationMIDU: enabling MIMO full duplex
Aryafar, E., Khojastepour, M. A., Sundaresan, K., Rangarajan, S., & Chiang, M. (2012) · Proceedings of the 18th annual international conference on Mobile computing and networking · doi:10.1145/2348543.2348576 · Cited by 317
Secure Broadcasting Over Fading Channels
Khisti, A., Tchamkerten, A., & Wornell, G. W. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921861 · Cited by 275
Feedback Stabilization of Discrete-Time Networked Systems Over Fading Channels
Xiao, N., Xie, L., & Qiu, L. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2183450 · Cited by 271
Enhanced uplink non-orthogonal multiple access for 5G and beyond systems
Liu, W.-J., Hou, X.-L., & Chen, L. (2018) · Frontiers of Information Technology & Electronic Engineering · doi:10.1631/fitee.1700842 · Cited by 21
Metadata
- Authors
- Li, L., & Goldsmith, A. J.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2001-03
- Volume
- 47
- Issue
- 3
- Pages
- 1083-1102
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2040082383
- Cited by
- 518
- References
- 11
- FWCI
- 22.16
- 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.