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

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels

Open access
Scutari, Gesualdo, Palomar, Daniel P., Barbarossa, Sergio·2008·IEEE Transactions on Information Theory

Abstract

This paper considers the maximization of information rates for the Gaussian frequency-selective interference channel, subject to power and spectral mask constraints on each link. To derive decentralized solutions that do not require any cooperation among the users, the optimization problem is formulated as a static noncooperative game of complete information. To achieve the so-called Nash equilibria of the game, we propose a new distributed algorithm called asynchronous iterative water-filling algorithm. In this algorithm, the users update their power spectral density (PSD) in a completely distributed and asynchronous way: some users may update their power allocation more frequently than others and they may even use outdated measurements of the received interference. The proposed algorithm represents a unified framework that encompasses and generalizes all known iterative water-filling algorithms, e.g., sequential and simultaneous versions. The main result of the paper consists of a unified set of conditions that guarantee the global converge of the proposed algorithm to the (unique) Nash equilibrium of the game.

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.1109/tit.2008.924723

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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

Cites

Cited by

See all 224

Metadata

Authors
Scutari, G., Palomar, D. P., & Barbarossa, S.
Venue
IEEE Transactions on Information Theory
Published
2008-07
Volume
54
Issue
7
Pages
2868-2878
ISSN
0018-9448 (ISSN-L)
OpenAlex
W2167032653
Cited by
224
References
1
FWCI
27.19
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: Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels. https://app.cochat.ai/papers/10.1109/tit.2008.924723
The paper
Scutari, G., Palomar, D. P., & Barbarossa, S. (2008). Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2008.924723

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.