The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Linear Precoding Based on Polynomial Expansion: Large-Scale Multi-Cell MIMO Systems
Open accessAbstract
Large-scale MIMO systems can yield a substantial improvements in spectral efficiency for future communication systems. Due to the finer spatial resolution and array gain achieved by a massive number of antennas at the base station, these systems have shown to be robust to inter-user interference and the use of linear precoding appears to be asymptotically optimal. However, from a practical point of view, most precoding schemes exhibit prohibitively high computational complexity as the system dimensions increase. For example, the near-optimal regularized zero forcing (RZF) precoding requires the inversion of a large matrix. To solve this issue, we propose in this paper to approximate the matrix inverse by a truncated polynomial expansion (TPE), where the polynomial coefficients are optimized to maximize the system performance. This technique has been recently applied in single cell scenarios and it was shown that a small number of coefficients is sufficient to reach performance similar to that of RZF, while it was not possible to surpass RZF. In a realistic multi-cell scenario involving large-scale multi-user MIMO systems, the optimization of RZF precoding has, thus far, not been feasible. This is mainly attributed to the high complexity of the scenario and the non-linear impact of the necessary regularizing parameters. On the other hand, the scalar coefficients in TPE precoding give hope for possible throughput optimization. To this end, we exploit random matrix theory to derive a deterministic expression of the asymptotic signal-to-interference-and-noise ratio for each user based on channel statistics. We also provide an optimization algorithm to approximate the coefficients that maximize the network-wide weighted max-min fairness. The optimization weights can be used to mimic the user throughput distribution of RZF precoding. Using simulations, we compare the network throughput of the proposed TPE precoding with that of the suboptimal RZF scheme and show that our scheme can achieve higher throughput using a TPE order of only 5.
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
A tutorial on decomposition methods for network utility maximization
Palomar, D. P., & Chiang, M. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879350 · Cited by 1,647
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
Marzetta, T. L., Larsson, E. G., Yang, H., & Ngo, H. Q. (2016) · Cambridge University Press eBooks · doi:10.1017/cbo9781316799895 · Cited by 1,718
Nadeem, Q.-U.-A., Alwazani, H., Kammoun, A., Chaaban, A., Debbah, M., & Alouini, M.-S. (2020) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2020.2992791 · Cited by 453
Self-citationFoundations of MIMO Communication
Heath Jr, R. W., & Lozano, A. (2018) · Cambridge University Press eBooks · doi:10.1017/9781139049276 · Cited by 426
Ali, E., Ismail, M., Nordin, R., & Abdulah, N. F. (2017) · Frontiers of Information Technology & Electronic Engineering · doi:10.1631/fitee.1601817 · Cited by 279
Metadata
- Authors
- Kammoun, A., Muller, A., Bjornson, E., & Debbah, M.
- Venue
- IEEE Journal of Selected Topics in Signal Processing
- Published
- 2014-10
- Volume
- 8
- Issue
- 5
- Pages
- 861-875
- ISSN
- 1932-4553 (ISSN-L)
- 1941-0484
- OpenAlex
- W2044075512
- Cited by
- 198
- References
- 1
- FWCI
- 12.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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Linear Precoding Based on Polynomial Expansion: Large-Scale Multi-Cell MIMO Systems. https://app.cochat.ai/papers/10.1109/jstsp.2014.2322582
- The paper
- Kammoun, A., Muller, A., Bjornson, E., & Debbah, M. (2014). Linear Precoding Based on Polynomial Expansion: Large-Scale Multi-Cell MIMO Systems. IEEE Journal of Selected Topics in Signal Processing. https://doi.org/10.1109/jstsp.2014.2322582
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.