Multi-antenna Cayley differential codes

Multiple antenna differential modulation using unitary matrices requires no channel knowledge at the receiver, and so is ideal for use on wireless links where channel tracking is undesirable or infeasible, either because of rapid changes in the channel characteristics or because of limited system resources. Although this basic principle is well understood, it is not known how to generate good-performing constellations of unitary matrices, for any number of transmit and receive antennas and especially at high rates. We propose a class of Cayley codes that works with any number of antennas, and allows for polynomial-time near-maximum-likelihood decoding based on either successive nulling/cancelling or sphere decoding. The codes use the Cayley transform, which maps the highly nonlinear Stiefel manifold of unitary matrices to the linear space of skew-Hermitian matrices. This leads to a simple linear constellation structure in the Cayley transform domain and to an information-theoretic design criterion based on emulating a Cauchy random matrix. Simulations show that Cayley codes allow efficient and effective high-rate data transmission in multi-antenna communication systems without knowing the channel.

[1]  Babak Hassibi,et al.  Fully-diverse multiple-antenna signal constellations and fixed-point-free Lie groups , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[2]  Gerard J. Foschini,et al.  Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.

[3]  J.E. Mazo,et al.  Digital communications , 1985, Proceedings of the IEEE.

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

[5]  Thomas L. Marzetta,et al.  BLAST training : Estimating Channel Characteristics for High-Capacity Space-Time Wireless , 1999 .

[6]  Bertrand M. Hochwald,et al.  Differential unitary space-time modulation , 2000, IEEE Trans. Commun..

[7]  Hamid Jafarkhani,et al.  A differential detection scheme for transmit diversity , 2000, IEEE Journal on Selected Areas in Communications.

[8]  Brian L. Hughes Differential Space-Time modulation , 2000, IEEE Trans. Inf. Theory.

[9]  Mohamed Oussama Damen,et al.  Lattice code decoder for space-time codes , 2000, IEEE Communications Letters.

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

[11]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[12]  U. Fincke,et al.  Improved methods for calculating vectors of short length in a lattice , 1985 .

[13]  A. Robert Calderbank,et al.  Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction , 1998, IEEE Trans. Inf. Theory.

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

[15]  Babak Hassibi,et al.  An efficient square-root algorithm for BLAST , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[16]  Reinaldo A. Valenzuela,et al.  Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture , 1999 .

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

[18]  L. Mirsky An introduction to linear algebra , 1965 .

[19]  Babak Hassibi,et al.  Representation theory for high-rate multiple-antenna code design , 2001, IEEE Trans. Inf. Theory.

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