The DOI matches its Crossref record.
Quantization Bounds on Grassmann Manifolds and Applications to MIMO Communications
Open accessAbstract
The Grassmann manifold Gn,p(L) is the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space Ln, where L is either R or C. This paper considers the quantization problem in which a source in Gn,p(L) is quantized through a code in Gn,q(L), with p and q not necessarily the same. The analysis is based on the volume of a metric ball in Gn,p(L) with center in Gn,q(L), and our chief result is a closed-form expression for the volume of a metric ball of radius at most one. This volume formula holds for arbitrary n, p, q, and L, while previous results pertained only to some special cases. Based on this volume formula, several bounds are derived for the rate-distortion tradeoff assuming that the quantization rate is sufficiently high. The lower and upper bounds on the distortion rate function are asymptotically identical, and therefore precisely quantify the asymptotic rate-distortion tradeoff. We also show that random codes are asymptotically optimal in the sense that they achieve the minimum possible distortion in probability as n and the code rate approach infinity linearly. Finally, as an application of the derived results to communication theory, we quantify the effect of beamforming matrix selection in multiple-antenna communication systems with finite rate channel state feedback.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
An overview of limited feedback in wireless communication systems
Love, D., Heath, R., N. Lau, V., Gesbert, D., Rao, B., & Andrews, M. (2008) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2008.081002 · Cited by 1,503
Foundations of MIMO Communication
Heath Jr, R. W., & Lozano, A. (2018) · Cambridge University Press eBooks · doi:10.1017/9781139049276 · Cited by 426
High-Dimensional Stochastic Gradient Quantization for Communication-Efficient Edge Learning
Du, Y., Yang, S., & Huang, K. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2983166 · Cited by 116
Metadata
- Authors
- Dai, W., Liu, Y., & Rider, B.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2008-03
- Volume
- 54
- Issue
- 3
- Pages
- 1108-1123
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2169448252
- Cited by
- 205
- References
- 0
- FWCI
- 21.96
- 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: Quantization Bounds on Grassmann Manifolds and Applications to MIMO Communications. https://app.cochat.ai/papers/10.1109/tit.2007.915691
- The paper
- Dai, W., Liu, Y., & Rider, B. (2008). Quantization Bounds on Grassmann Manifolds and Applications to MIMO Communications. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2007.915691
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.