Quantization Bounds on Grassmann Manifolds and Applications to MIMO Communications

DOI10.1109/TIT.2007.915691MaRDI QIDQ3604618zbMATH OpenOpenAlexFDO

Authors Wei Dai, Youjian Liu, Brian Rider

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0603039

Mathematics Subject Classification ID

Communication theory (94A05) Source coding (94A29) Applications to coding theory and cryptography of arithmetic geometry (14G50) Rate-distortion theory in information and communication theory (94A34)

Abstract: This paper considers the quantization problem on the Grassmann manifold mathcal{G}_{n,p}, the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space. The chief result is a closed-form formula for the volume of a metric ball in the Grassmann manifold when the radius is sufficiently small. This volume formula holds for Grassmann manifolds with arbitrary dimension n and p, while previous results pertained only to p=1, or a fixed p with asymptotically large n. Based on this result, several quantization bounds are derived for sphere packing and rate distortion tradeoff. We establish asymptotically equivalent lower and upper bounds for the rate distortion tradeoff. Since the upper bound is derived by constructing random codes, this result implies that the random codes are asymptotically optimal. The above results are also extended to the more general case, in which mathcal{G}_{n,q} is quantized through a code in mathcal{G}_{n,p}, where p and q are not necessarily the same. Finally, we discuss some applications of the derived results to multi-antenna communication systems.

Recommendations

• Communication on the Grassmann manifold: a geometric approach to the noncoherent multiple-antenna channel
• Grassmannian frames with applications to coding and communication
• Adaptive Quantization on a Grassmann-Manifold for Limited Feedback Beamforming Systems
• Algorithms and Bounds for Complex and Quaternionic Lattices With Application to MIMO Transmission
• Geometric and algebraic structures associated with the channel quantization problem
• Techniques for MIMO Channel Covariance Matrix Quantization
• Noncoherent MIMO Communication: Grassmannian Constellations and Efficient Detection
• Quadratic Forms on Complex Random Matrices and Multiple-Antenna Systems
• MIMO Systems With Quantized Covariance Feedback
• Grassmannian Signalling Achieves Tight Bounds on the Ergodic High-SNR Capacity of the Noncoherent MIMO Full-Duplex Relay Channel

Cited in

(5)

• Grassmannian beamforming for multiple-input multiple-output wireless systems
• Grassmannian frames with applications to coding and communication
• Channel prediction based on Grassmannian manifold for limited feedback multiple antenna systems
• On the computability of continuous maximum entropy distributions with applications
• On beamforming with finite rate feedback in multiple-antenna systems

This page was built for publication: Quantization Bounds on Grassmann Manifolds and Applications to MIMO Communications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604618)