Noncoherent MIMO Communication: Grassmannian Constellations and Efficient Detection

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 ldquoquasi-set-partitioningrdquo binary labeling.

[1]  Pranav Dayal,et al.  Leveraging coherent space-time codes for noncoherent communication via training , 2004, IEEE Transactions on Information Theory.

[2]  E. Biglieri,et al.  Space-time decoding with imperfect channel estimation , 2003, IEEE Transactions on Wireless Communications.

[3]  G. Stewart Perturbation Bounds for the $QR$ Factorization of a Matrix , 1977 .

[4]  Thomas L. Marzetta,et al.  Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading , 2000, IEEE Trans. Inf. Theory.

[5]  Tolga M. Duman,et al.  Trellis coded unitary space-time modulation , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[6]  Siavash M. Alamouti,et al.  A simple transmit diversity technique for wireless communications , 1998, IEEE J. Sel. Areas Commun..

[7]  Oliver Henkel,et al.  Sphere-packing bounds in the Grassmann and Stiefel manifolds , 2003, IEEE Transactions on Information Theory.

[8]  Jean-Claude Belfiore,et al.  Non-Coherent Codes over the Grassmannian , 2007, IEEE Transactions on Wireless Communications.

[9]  Ran Gozali,et al.  Space-Time Codes for High Data Rate Wireless Communications , 2002 .

[10]  Babak Hassibi,et al.  Analysis of multiple-antenna wireless links at low SNR , 2004, IEEE Transactions on Information Theory.

[11]  Thomas L. Marzetta,et al.  Capacity of a Mobile Multiple-Antenna Communication Link in Rayleigh Flat Fading , 1999, IEEE Trans. Inf. Theory.

[12]  R. Muirhead Aspects of Multivariate Statistical Theory , 1982, Wiley Series in Probability and Statistics.

[13]  Babak Hassibi,et al.  High-rate codes that are linear in space and time , 2002, IEEE Trans. Inf. Theory.

[14]  N. J. A. Sloane,et al.  Packing Lines, Planes, etc.: Packings in Grassmannian Spaces , 1996, Exp. Math..

[15]  Helmut Bölcskei,et al.  Space-Time Wireless Systems: From Array Processing to MIMO Communications , 2008 .

[16]  Helmut Bölcskei,et al.  Space-time coding for noncoherent channels , 2001 .

[17]  Il-Min Kim,et al.  Existence and construction of noncoherent unitary space-time codes , 2002, IEEE Trans. Inf. Theory.

[18]  Andrea J. Goldsmith,et al.  Adaptive coded modulation for fading channels , 1998, IEEE Trans. Commun..

[19]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[20]  Jean-Claude Belfiore,et al.  A new family of Grassmann space-time codes for non-coherent MIMO systems , 2003, IEEE Communications Letters.

[21]  Athanasios Papoulis,et al.  Probability, Random Variables and Stochastic Processes , 1965 .

[22]  Amos Lapidoth,et al.  Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels , 2003, IEEE Trans. Inf. Theory.

[23]  Stephan ten Brink,et al.  Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..

[24]  Emanuele Viterbo,et al.  The golden code: a 2 x 2 full-rate space-time code with non-vanishing determinants , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[25]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[26]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[27]  Thomas L. Marzetta,et al.  Systematic design of unitary space-time constellations , 2000, IEEE Trans. Inf. Theory.

[28]  Samuel Kotz,et al.  Continuous univariate distributions : distributions in statistics , 1970 .

[29]  Thomas L. Marzetta,et al.  Multiple-antennas and isotropically random unitary inputs: The received signal density in closed form , 2002, IEEE Trans. Inf. Theory.

[30]  Xiang-Gen Xia,et al.  Constellation mapping for space-time matrix modulation with iterative demodulation/decoding , 2005, IEEE Trans. Commun..

[31]  Ashutosh Sabharwal,et al.  On design criteria and construction of noncoherent space-time constellations , 2003, IEEE Trans. Inf. Theory.

[32]  Alan Edelman,et al.  The Geometry of Algorithms with Orthogonality Constraints , 1998, SIAM J. Matrix Anal. Appl..

[33]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[34]  Lizhong Zheng,et al.  Communication on the Grassmann manifold: A geometric approach to the noncoherent multiple-antenna channel , 2002, IEEE Trans. Inf. Theory.

[35]  Alexander Barg,et al.  Bounds on packings of spheres in the Grassmann manifold , 2002, IEEE Trans. Inf. Theory.

[36]  Rong Li,et al.  New tight bounds on the pairwise error probability for unitary space-time modulations , 2005, IEEE Communications Letters.

[37]  Aarnout Brombacher,et al.  Probability... , 2009, Qual. Reliab. Eng. Int..

[38]  P. R. Fisk,et al.  Distributions in Statistics: Continuous Multivariate Distributions , 1971 .

[39]  Mohamed Oussama Damen,et al.  Noncoherent space-time coding: An algebraic perspective , 2005, IEEE Transactions on Information Theory.

[40]  A. Edelman Eigenvalues and condition numbers of random matrices , 1988 .

[41]  John Robinson,et al.  THE DISTRIBUTION OF A GENERAL QUADRATIC FORM IN NORMAL VARIATES1 , 1965 .

[42]  Babak Hassibi,et al.  How much training is needed in multiple-antenna wireless links? , 2003, IEEE Trans. Inf. Theory.

[43]  T.J. Richardon,et al.  Multiple-antenna signal constellations for fading channels , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[44]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[45]  Matthias Brehler,et al.  Signal design and convolutional coding for noncoherent space-time communication on the block-Rayleigh-fading channel , 2002, IEEE Trans. Inf. Theory.

[46]  Matthias Brehler,et al.  Asymptotic error probability analysis of quadratic receivers in Rayleigh-fading channels with applications to a unified analysis of coherent and noncoherent space-Time receivers , 2001, IEEE Trans. Inf. Theory.