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

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

Network MIMO With Linear Zero-Forcing Beamforming: Large System Analysis, Impact of Channel Estimation, and Reduced-Complexity Scheduling

Open access
Huh, Hoon, Tulino, Antonia M., Caire, Giuseppe·2012·IEEE Transactions on Information Theory

Abstract

We consider the downlink of a multicell system with multiantenna base stations and single-antenna user terminals, arbitrary base station cooperation clusters, distance-dependent propagation pathloss, and general “fairness” requirements. Base stations in the same cooperation cluster employ joint transmission with linear zero-forcing beamforming, subject to sum or per-base station power constraints. Intercluster interference is treated as noise at the user terminals. Analytic expressions for the system spectral efficiency are found in the large-system limit where both the numbers of users and antennas per base station tend to infinity with a given ratio. In particular, for the per-base station power constraint, we find new results in random matrix theory, yielding the squared Frobenius norm of submatrices of the Moore-Penrose pseudo-inverse for the structured non-i.i.d. channel matrix resulting from the cooperation cluster, user distribution, and path-loss coefficients. The analysis is extended to the case of nonideal Channel State Information at the Transmitters obtained through explicit downlink channel training and uplink feedback. Specifically, our results illuminate the trade-off between the benefit of a larger number of cooperating antennas and the cost of estimating higher-dimensional channel vectors. Furthermore, our analysis leads to a new simplified downlink scheduling scheme that preselects the users according to probabilities obtained from the large-system results, depending on the desired fairness criterion. The proposed scheme performs close to the optimal (finite-dimensional) opportunistic user selection while requiring significantly less channel state feedback, since only a small fraction of preselected users must feed back their channel state information.

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

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 244

Metadata

Authors
Huh, H., Tulino, A. M., & Caire, G.
Venue
IEEE Transactions on Information Theory
Published
2012-05
Volume
58
Issue
5
Pages
2911-2934
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
OpenAlex
W2163676306
Cited by
244
References
1
FWCI
13.15
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: Network MIMO With Linear Zero-Forcing Beamforming: Large System Analysis, Impact of Channel Estimation, and Reduced-Complexity Scheduling. https://app.cochat.ai/papers/10.1109/tit.2011.2178230
The paper
Huh, H., Tulino, A. M., & Caire, G. (2012). Network MIMO With Linear Zero-Forcing Beamforming: Large System Analysis, Impact of Channel Estimation, and Reduced-Complexity Scheduling. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2011.2178230

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.