Matrix analysis
Eigenvalues and condition numbers of random matrices
SIAM Journal on Matrix Analysis and Applications
Elements of information theory
Elements of information theory
Matrix computations (3rd ed.)
The Geometry of Algorithms with Orthogonality Constraints
SIAM Journal on Matrix Analysis and Applications
Space-Time Wireless Systems: From Array Processing to MIMO Communications
Space-Time Wireless Systems: From Array Processing to MIMO Communications
Trellis-coded unitary space-time modulation
IEEE Transactions on Wireless Communications
Space-time decoding with imperfect channel estimation
IEEE Transactions on Wireless Communications
Non-Coherent Codes over the Grassmannian
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading
IEEE Transactions on Information Theory
Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading
IEEE Transactions on Information Theory
Systematic design of unitary space-time constellations
IEEE Transactions on Information Theory
Multiple-antenna signal constellations for fading channels
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
High-rate codes that are linear in space and time
IEEE Transactions on Information Theory
Bounds on packings of spheres in the Grassmann manifold
IEEE Transactions on Information Theory
Existence and construction of noncoherent unitary space-time codes
IEEE Transactions on Information Theory
How much training is needed in multiple-antenna wireless links?
IEEE Transactions on Information Theory
On design criteria and construction of noncoherent space-time constellations
IEEE Transactions on Information Theory
Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels
IEEE Transactions on Information Theory
Leveraging coherent space-time codes for noncoherent communication via training
IEEE Transactions on Information Theory
Analysis of multiple-antenna wireless links at low SNR
IEEE Transactions on Information Theory
The golden code: a 2×2 full-rate space-time code with nonvanishing determinants
IEEE Transactions on Information Theory
Noncoherent space-time coding: An algebraic perspective
IEEE Transactions on Information Theory
Sphere-packing bounds in the Grassmann and Stiefel manifolds
IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
A BICM-IDD scheme for non-coherent MIMO communication
IEEE Transactions on Wireless Communications
Hi-index | 754.84 |
This paper considers the design of both a transmitter and a receiver for noncoherent communication over a frequency-flat, richly scattered multiple-input multiple-output (MIMO) channel. The design is guided by the fact that at high signal-to-noise ratios (SNRs), the ergodic capacity of the channel can be achieved by input signals that are isotropically distributed on the (compact) Grassmann manifold. The first part of the paper considers the design of Grassmannian constellations that mimic the isotropic distribution. A subspace perturbation analysis is used to determine an appropriate metric for the distance between Grassmannian constellation points, and using this metric, greedy, direct and rotation-based techniques for designing constellations are proposed. These techniques offer different tradeoffs between the minimum distance of the constellation and the design complexity. In addition, the rotation-based technique results in constellations that have lower storage requirements and admit a natural "quasi-set-partitioning" binary labeling. In the second part of the paper, a reduced search suboptimum detector is proposed. The development of this detector relies on the subspace perturbation analysis and exploits the geometric properties of the Grassmann manifold and the isotropic distribution of the constellation points and the noise realizations. The performance of this detector is comparable to that of the maximum likelihood detector, but it requires considerably less computational effort. Finally, in order to assess the performance of a given constellation, an exact expression is provided for the pairwise error probability of the ML detector. In comparison to existing pairwise error probability expressions, the proposed expression is numerically stable and does not require the evaluation of residues at poles with high multiplicities.