CoChat

Compressed CSI Acquisition in FDD Massive MIMO: How Much Training is Needed?

Shen, Juei-Chin, Zhang, Jun, Alsusa, Emad, Letaief, Khaled B. · 2016 · IEEE Transactions on Wireless Communications

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

Abstract

Massive multiple-input-multiple-output (MIMO) is a promising technique for providing unprecedented spectral efficiency. However, it has been well recognized that the excessive training overhead required for obtaining the channel side information is a major handicap in frequency-division duplexing (FDD) massive MIMO. Several attempts have been made to reduce this training overhead by exploiting the sparsity structures of massive MIMO channels. So far, however, there has been little discussion about how to exploit the partial support information of these channels to achieve further overhead reductions. Such information, which is a set of indices of the significant elements of a channel vector, can be acquired in advance and hence is an important option to explore. In this paper, we examine the impact on the required training overhead when this information is applied within a weighted ℓ1minimization framework, and analytically show that a sharp estimate of the reduced overhead size can be successfully obtained. Furthermore, we examine how the accuracy of the partial support information impacts the achievable overhead reduction. Numerical results for a wide range of sparsity and partial support information reliability levels are presented to quantify our findings and main conclusions.

Overview

Integrity signals

Registry

Crossref · 10.1109/twc.2016.2535310

Cites

49 of 49 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Cited by

See all 99

Metadata

Authors
Shen, J.-C., Zhang, J., Alsusa, E., & Letaief, K. B.
Affiliations
  • MediaTek (Taiwan) (TW)
  • Hong Kong University of Science and Technology (HK)
  • University of Manchester (GB)
Venue
IEEE Transactions on Wireless Communications
Published
2016-06
Volume
15
Issue
6
Pages
4145-4156
ISSN
1536-1276 (ISSN-L)
OpenAlex
W2326913951
Cited by
99
References
49
Citations by year
2026: 3 · 2025: 3 · 2024: 3 · 2023: 7 · 2022: 9 · 2021: 10 · 2020: 15 · 2019: 18 · 2018: 19 · 2017: 9 · 2016: 3
FWCI
7.52
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Transactions on Wireless Communications (publishedVersion)
  • Research Explorer (The University of Manchester) (publishedVersion)
  • Rare & Special e-Zone (The Hong Kong University of Science and Technology) (submittedVersion)
Funders
Hong Kong Research Grant Council (16211815)
Topics
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced MIMO Systems Optimization
  • Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Millimeter-Wave Propagation and Modeling
Keywords
massive MIMO, FDD, channel state information acquisition, training overhead reduction, channel sparsity, weighted l1 minimization, compressed sensing, sparse channel estimation

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

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.