The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching
Open accessAbstract
This two-part paper develops novel methodologies for using fractional programming (FP) techniques to design and optimize communication systems. Part I of this paper proposes a new quadratic transform for FP and treats its application for continuous optimization problems. In this Part II of the paper, we study discrete problems, such as those involving user scheduling, which are considerably more difficult to solve. Unlike the continuous problems, discrete or mixed discrete-continuous problems normally cannot be recast as convex problems. In contrast to the common heuristic of relaxing the discrete variables, this work reformulates the original problem in an FP form amenable to distributed combinatorial optimization. The paper illustrates this methodology by tackling the important and challenging problem of uplink coordinated multicell user scheduling in wireless cellular systems. Uplink scheduling is more challenging than downlink scheduling, because uplink user scheduling decisions significantly affect the interference pattern in nearby cells. Furthermore, the discrete scheduling variable needs to be optimized jointly with continuous variables such as transmit power levels and beamformers. The main idea of the proposed FP approach is to decouple the interaction among the interfering links, thereby permitting a distributed and joint optimization of the discrete and continuous variables with provable convergence. The paper shows that the well-known weighted minimum mean-square-error (WMMSE) algorithm can also be derived from a particular use of FP; but our proposed FP-based method significantly outperforms WMMSE when discrete user scheduling variables are involved, both in term of run-time efficiency and optimizing results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
Fields, J. (2001) · Cited by 4,044
On Nonlinear Fractional Programming
Dinkelbach, W. (1967) · Management Science · doi:10.1287/mnsc.13.7.492 · Cited by 3,139
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
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
Self-citationClique is hard to approximate within n1−ε
Håstad, J. (1999) · Acta Mathematica · doi:10.1007/bf02392825 · Cited by 1,369
The Hungarian method for the assignment problem
Kuhn, H. W. (2005) · Naval Research Logistics (NRL) · doi:10.1002/nav.20053 · Cited by 1,260
Weighted sum-rate maximization using weighted MMSE for MIMO-BC beamforming design
Christensen, S. S., Agarwal, R., De Carvalho, E., & Cioffi, J. M. (2008) · IEEE Transactions on Wireless Communications · doi:10.1109/t-wc.2008.070851 · Cited by 1,014
Cited by
Weighted Sum-Rate Maximization for Reconfigurable Intelligent Surface Aided Wireless Networks
Guo, H., Liang, Y.-C., Chen, J., & Larsson, E. G. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.2970061 · Cited by 1,013
Towards Optimal Power Control via Ensembling Deep Neural Networks
Liang, F., Shen, C., Yu, W., & Wu, F. (2020) · IEEE Transactions on Communications · doi:10.1109/tcomm.2019.2957482 · Cited by 268
Self-citationSpatial Deep Learning for Wireless Scheduling
Cui, W., Shen, K., & Yu, W. (2019) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2019.2904352 · Cited by 265
Self-citationAlgorithm-Unrolling-Based Distributed Optimization for RIS-Assisted Cell-Free Networks
Xu, W., An, J., Li, H., Gan, L., & Yuen, C. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3288072 · Cited by 49
Metadata
- Authors
- Shen, K., & Yu, W.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2018-05-15
- Volume
- 66
- Issue
- 10
- Pages
- 2631-2644
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2788428941
- Cited by
- 578
- References
- 25
- FWCI
- 8.09
- Type
- journal article
- Language
- en
- Open access
- green
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: Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching. https://app.cochat.ai/papers/10.1109/tsp.2018.2812748
- The paper
- Shen, K., & Yu, W. (2018). Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2018.2812748
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.