The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems Based on Game Theory—Part II: Algorithms
Open accessAbstract
In this two-part paper, we address the problem of finding the optimal precoding/multiplexing scheme for a set of noncooperative links sharing the same physical resources, e.g., time and bandwidth. We consider two alternative optimization problems: P.1) the maximization of mutual information on each link, given constraints on the transmit power and spectral mask; and P.2) the maximization of the transmission rate on each link, using finite-order constellations, under the same constraints as in P.1, plus a constraint on the maximum average error probability on each link. Aiming at finding decentralized strategies, we adopted as optimality criterion the achievement of a Nash equilibrium and thus we formulated both problems P.1 and P.2 as strategic noncooperative (matrix-valued) games. In Part I of this two-part paper, after deriving the optimal structure of the linear transceivers for both games, we provided a unified set of sufficient conditions that guarantee the uniqueness of the Nash equilibrium. In this Part II of the paper, we focus on the achievement of the equilibrium and propose alternative distributed iterative algorithms that solve both games. Specifically, the new proposed algorithms are the following: 1) thesequentialandsimultaneousiterative waterfilling-based algorithms, incorporating spectral mask constraints and 2) thesequentialandsimultaneousgradient-projection-based algorithms, establishing an interesting link with variational inequality problems. Our main contribution is to provide sufficient conditions for theglobalconvergence of all the proposed algorithms which, although derived under stronger constraints, incorporating for example spectral mask constraints, have a broader validity than the convergence conditions known in the current literature for the sequential iterative waterfilling algorithm.
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
Fundamentals of Wireless Communication
Tse, D., & Viswanath, P. (2005) · doi:10.1017/cbo9780511807213 · Cited by 13,162
Cited by
Scutari, G., Palomar, D. P., & Barbarossa, S. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.907807 · Cited by 316
Self-citationOptimal Resource Allocation for MIMO Ad Hoc Cognitive Radio Networks
Kim, S.-J., & Giannakis, G. B. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2120270 · Cited by 301
Competitive Design of Multiuser MIMO Systems Based on Game Theory: A Unified View
Scutari, G., Palomar, D., & Barbarossa, S. (2008) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2008.080907 · Cited by 265
Self-citation
Metadata
- Authors
- Scutari, G., Palomar, D. P., & Barbarossa, S.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2008
- Volume
- 56
- Issue
- 3
- Pages
- 1250-1267
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2149803021
- Cited by
- 214
- References
- 1
- FWCI
- 30.48
- 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: Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems Based on Game Theory—Part II: Algorithms. https://app.cochat.ai/papers/10.1109/tsp.2007.907808
- The paper
- Scutari, G., Palomar, D. P., & Barbarossa, S. (2008). Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems Based on Game Theory—Part II: Algorithms. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2007.907808
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.