The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Dynamic Spectrum Management: Complexity and Duality
Abstract
Consider a communication system whereby multiple users share a common frequency band and must choose their transmit power spectral densities dynamically in response to physical channel conditions. Due to co-channel interference, the achievable data rate of each user depends on not only the power spectral density of its own, but also those of others in the system. Given any channel condition and assuming Gaussian signaling, we consider the problem to jointly determine all users' power spectral densities so as to maximize a system-wide utility function (e.g., weighted sum-rate of all users), subject to individual power constraints. For the discretized version of this nonconvex problem, we characterize its computational complexity by establishing the NP-hardness under various practical settings, and identify subclasses of the problem that are solvable in polynomial time. Moreover, we consider the Lagrangian dual relaxation of this nonconvex problem. Using the Lyapunov theorem in functional analysis, we rigorously prove a result first discovered by Yu and Lui (2006) that there is a zero duality gap for the continuous (Lebesgue integral) formulation. Moreover, we show that the duality gap for the discrete formulation vanishes asymptotically as the size of discretization decreases to zero.
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
Cognitive radio: brain-empowered wireless communications
Haykin, S. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.839380 · Cited by 11,916
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600523 · Cited by 2,399
Sion, M. (1958) · Pacific Journal of Mathematics · doi:10.2140/pjm.1958.8.171 · Cited by 1,843
Dual methods for nonconvex spectrum optimization of multicarrier systems
Yu, W., & Lui, R. (2006) · IEEE Transactions on Communications · doi:10.1109/tcomm.2006.877962 · Cited by 1,572
Interior Point Algorithms: Theory and Analysis
Ye, Y. (1997) · Wiley eBooks · doi:10.1002/9781118032701 · Cited by 939
Spectrum sharing for unlicensed bands
Etkin, R., Parekh, A., & Tse, D. (2007) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2007.070402 · Cited by 859
Distributed multiuser power control for digital subscriber lines
Yu, W., Ginis, G., & Cioffi, J. M. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.1007390 · Cited by 855
Optimal multiuser spectrum balancing for digital subscriber lines
Cendrillon, R., Yu, W., Moonen, M., Verlinden, J., & Bostoen, T. (2006) · IEEE Transactions on Communications · doi:10.1109/tcomm.2006.873096 · Cited by 359
Scutari, G., Palomar, D. P., & Barbarossa, S. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.907807 · Cited by 316
Spectrum sharing for unlicensed bands
Etkin, R., Parekh, A., & Tse, D. (2005) · First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005. · doi:10.1109/dyspan.2005.1542641 · Cited by 205
Analysis of Iterative Waterfilling Algorithm for Multiuser Power Control in Digital Subscriber Lines
Luo, Z.-Q., & Pang, J.-S. (2006) · EURASIP Journal on Advances in Signal Processing · doi:10.1155/asp/2006/24012 · Cited by 199
Self-citationSpectrum Management for Interference-Limited Multiuser Communication Systems
Hayashi, S., & Luo, Z.-Q. T. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2011433 · Cited by 119
Self-citation
Cited by
Massive MIMO Networks: Spectral, Energy, and Hardware Efficiency
Björnson, E., Hoydis, J., & Sanguinetti, L. (2017) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000093 · Cited by 2,137
Shi, Q., Razaviyayn, M., Luo, Z.-Q., & He, C. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2147784 · Cited by 2,129
Self-citationMulti-Cell MIMO Cooperative Networks: A New Look at Interference
Gesbert, D., Hanly, S., Huang, H., Shamai Shitz, S., Simeone, O., & Yu, W. (2010) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2010.101202 · Cited by 1,760
A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
Razaviyayn, M., Hong, M., & Luo, Z.-Q. (2013) · SIAM Journal on Optimization · doi:10.1137/120891009 · Cited by 1,304
Self-citationLearning to Optimize: Training Deep Neural Networks for Interference Management
Sun, H., Chen, X., Shi, Q., Hong, M., Fu, X., & Sidiropoulos, N. D. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2866382 · Cited by 874
Metadata
- Authors
- Luo, Z.-Q., & Zhang, S.
- Venue
- IEEE Journal of Selected Topics in Signal Processing
- Published
- 2008-02
- Volume
- 2
- Issue
- 1
- Pages
- 57-73
- ISSN
- 1932-4553 (ISSN-L)
- 1941-0484
- OpenAlex
- W2144000019
- Cited by
- 929
- References
- 15
- FWCI
- 74.07
- 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.