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

The DOI matches its Crossref record.

Uplink-downlink duality via minimax duality

Wei Yu·2006·IEEE Transactions on Information Theory

Abstract

The sum capacity of a Gaussian vector broadcast channel is the saddle point of a minimax Gaussian mutual information expression where the maximization is over the set of transmit covariance matrices subject to a power constraint and the minimization is over the set of noise covariance matrices subject to a diagonal constraint. This sum capacity result has been proved using two different methods, one based on decision-feedback equalization and the other based on a duality between uplink and downlink channels. This paper illustrates the connection between the two approaches by establishing that uplink-downlink duality is equivalent to Lagrangian duality in minimax optimization. This minimax Lagrangian duality relation allows the optimal transmit covariance and the least-favorable-noise covariance matrices in a Gaussian vector broadcast channel to be characterized in terms of the dual variables. In particular, it reveals that the least favorable noise is not unique. Further, the new Lagrangian interpretation of uplink-downlink duality allows the duality relation to be generalized to Gaussian vector broadcast channels with arbitrary linear constraints. However, duality depends critically on the linearity of input constraints. Duality breaks down when the input constraint is an arbitrary convex constraint. This shows that the minimax representation of the broadcast channel sum capacity is more general than the uplink-downlink duality representation.

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.2005.862102

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 217

Metadata

Authors
Yu, W.
Venue
IEEE Transactions on Information Theory
Published
2006-02
Volume
52
Issue
2
Pages
361-374
ISSN
0018-9448 (ISSN-L)
OpenAlex
W2123531758
Cited by
217
References
0
FWCI
20.58
Type
journal article
Language
en
Open access
closed

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: Uplink-downlink duality via minimax duality. https://app.cochat.ai/papers/10.1109/tit.2005.862102
The paper
Yu, W. (2006). Uplink-downlink duality via minimax duality. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2005.862102

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.