The DOI matches its Crossref record; 63 of the 63 references it cites were found in a registry or an index.
Geometric Programming for Communication Systems
Abstract
Recently, Geometric Programming has been applied to study a variety of problems in the analysis and design of communication systems from information theory and queuing theory to signal processing and network protocols. Geometric Programming for Communication Systems begins its comprehensive treatment of the subject by providing an in-depth tutorial on the theory, algorithms, and modeling methods of Geometric Programming. It then gives a systematic survey of the applications of Geometric Programming to the study of communication systems. It collects in one place various published results in this area, which are currently scattered in several books and many research papers, as well as up-to-date unpublished results. Geometric Programming for Communication Systems is intended for researchers and students who wish to have a comprehensive star ting point for understanding the theory and applications of geometric programming in communication systems.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
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
Parekh, A. K., & Gallager, R. G. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.234856 · Cited by 3,705
Large Deviations Techniques and Applications
Schmock, U., Dembo, A., & Zeitouni, O. (2000) · Journal of the American Statistical Association · doi:10.2307/2669805 · Cited by 3,524
Information Theory: Coding Theorems for Discrete Memoryless Systems
Csiszár, I., & Körner, J. (2014) · REAL-EOD (Library of the Hungarian Academy of Sciences and the Information Center Oriental Collection) · Cited by 3,246
Cited by
Fractional Programming for Communication Systems—Part I: Power Control and Beamforming
Shen, K., & Yu, W. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2812733 · Cited by 1,935
Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures
Chiang, M., Low, S. H., Calderbank, A. R., & Doyle, J. C. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887322 · Cited by 1,352
Self-citationA tutorial on geometric programming
Boyd, S., Kim, S.-J., Vandenberghe, L., & Hassibi, A. (2007) · Optimization and Engineering · doi:10.1007/s11081-007-9001-7 · Cited by 1,195
Power Control By Geometric Programming
Chiang, M., Tan, C. W., Palomar, D. P., O'neill, D., & Julian, D. (2007) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2007.05960 · Cited by 886
Self-citationA tutorial on cross-layer optimization in wireless networks
Lin, X., Shroff, N. B., & Srikant, R. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879351 · Cited by 833
Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching
Shen, K., & Yu, W. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2812748 · Cited by 578
An introduction to convex optimization for communications and signal processing
Luo, Z.-Q., & Yu, W. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879347 · Cited by 562
Waveform Design for Wireless Power Transfer
Clerckx, B., & Bayguzina, E. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2601284 · Cited by 346
MIMO Transceiver Design via Majorization Theory
Palomar, D. P., & Jiang, Y. (2007) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000018 · Cited by 320
MIMO Relaying With Linear Processing for Multiuser Transmission in Fixed Relay Networks
Chae, C.-B., Tang, T., Heath, R. W., & Cho, S. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.907821 · Cited by 311
Distributed Non-Autonomous Power Control through Distributed Convex Optimization
Ram, S. S., Veeravalli, V. V., & Nedic, A. (2009) · IEEE INFOCOM 2009 · doi:10.1109/infcom.2009.5062275 · Cited by 99
Metadata
- Authors
- Chiang, M.
- Venue
- now publishers, Inc. eBooks
- Publisher
- now Publishers Inc
- Published
- 2005
- OpenAlex
- W1997988602
- Cited by
- 423
- References
- 63
- FWCI
- 6.86
- Type
- book
- 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.