The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Fast Converging Algorithm for Weighted Sum Rate Maximization in Multicell MISO Downlink
Open accessAbstract
The problem of maximizing weighted sum rates in the downlink of a multicell environment is of considerable interest. Unfortunately, this problem is known to be NP-hard. For the case of multi-antenna base stations and single antenna mobile terminals, we devise a low complexity, fast and provably convergent algorithm that locally optimizes the weighted sum rate in the downlink of the system. In particular, we derive an iterative second-order cone program formulation of the weighted sum rate maximization problem. The algorithm converges to a local optimum within a few iterations. Superior performance of the proposed approach is established by numerically comparing it to other known solutions.
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
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 · cited 5×
“) k )=( ⋆ k ⋆ k ⋆ k )and φ (n+1) k = q x(n+1) k β(n+1) k ; n:= +1. 4: until convergence 7 P (dBW) Average sum rate (b/s/Hz) 5 10 15 20 25 5 10 15 20 25 Optimal linear design Algorithm 1 SIN [7] WMMSE [9] Zero−forcing Fig. 1. Average sum rate comparison for single-cell scenario, N =4, K =4. the n+1st iteration of Algor…”
BackgroundMethodInfluential
Cited by
On the Total Energy Efficiency of Cell-Free Massive MIMO
Ngo, H. Q., Tran, L.-N., Duong, T. Q., Matthaiou, M., & Larsson, E. G. (2018) · IEEE Transactions on Green Communications and Networking · doi:10.1109/tgcn.2017.2770215 · Cited by 863
Self-citationResource Allocation in Intelligent Reflecting Surface Assisted NOMA Systems
Zuo, J., Liu, Y., Qin, Z., & Al-Dhahir, N. (2020) · IEEE Transactions on Communications · doi:10.1109/tcomm.2020.3016742 · Cited by 259
Kai, C., Zhou, H., Yi, Y., & Huang, W. (2021) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2020.3018159 · Cited by 249
Metadata
- Authors
- Tran, L.-N., Hanif, M. F., Tolli, A., & Juntti, M.
- Venue
- IEEE Signal Processing Letters
- Published
- 2012-12
- Volume
- 19
- Issue
- 12
- Pages
- 872-875
- ISSN
- 1070-9908 (ISSN-L)
- 1558-2361
- OpenAlex
- W2162841150
- Cited by
- 175
- References
- 1
- FWCI
- 7.73
- 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
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.