Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 199

The DOI matches its Crossref record.

Analysis of Iterative Waterfilling Algorithm for Multiuser Power Control in Digital Subscriber Lines

Open access
Luo, Zhi-Quan, Pang, Jong-Shi·2006·EURASIP Journal on Advances in Signal Processing

Abstract

We present an equivalent linear complementarity problem (LCP) formulation of the noncooperative Nash game resulting from the DSL power control problem. Based on this LCP reformulation, we establish the linear convergence of the popular distributed iterative waterfilling algorithm (IWFA) for arbitrary symmetric interference environment and for certain asymmetric channel conditions with any number of users. In the case of symmetric interference crosstalk coefficients, we show that the users of IWFA in fact, unknowingly but willingly, cooperate to minimize a common quadratic cost function whose gradient measures the received signal power from all users. This is surprising since the DSL users in the IWFA have no intention to cooperate as each maximizes its own rate to reach a Nash equilibrium. In the case of asymmetric coefficients, the convergence of the IWFA is due to a contraction property of the iterates. In addition, the LCP reformulation enables us to solve the DSL power control problem under no restrictions on the interference coefficients using existing LCP algorithms, for example, Lemke's method. Indeed, we use the latter method to benchmark the empirical performance of IWFA in the presence of strong crosstalk interference.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1155/asp/2006/24012

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 199

Metadata

Authors
Luo, Z.-Q., & Pang, J.-S.
Venue
EURASIP Journal on Advances in Signal Processing
Published
2006-03-20
Volume
2006
Issue
1
ISSN
  • 1110-8657 (ISSN-L)
  • 1687-6180
OpenAlex
W1989873462
Cited by
199
References
0
FWCI
23.28
Type
journal article
Language
en
Open access
gold

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: Analysis of Iterative Waterfilling Algorithm for Multiuser Power Control in Digital Subscriber Lines. https://app.cochat.ai/papers/10.1155/asp/2006/24012
The paper
Luo, Z.-Q., & Pang, J.-S. (2006). Analysis of Iterative Waterfilling Algorithm for Multiuser Power Control in Digital Subscriber Lines. EURASIP Journal on Advances in Signal Processing. https://doi.org/10.1155/asp/2006/24012

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.