Cayley Differential Unitary Space-Time Codes


Bertrand Hochwald    Babak Hassibi


Abstract: One method for communicating with multiple antennas is to encode the transmitted data differentially using unitary matrices at the transmitter, and to decode differentially without knowing the channel coefficients at the receiver. Since channel knowledge is not required at the receiver, differential schemes are 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 for any rate. This is especially true at high rates where the constellations must be rapidly encoded and decoded.

We propose a class of Cayley codes that works with any number of antennas, and has efficient encoding and decoding at any rate. The codes are named for their use of the Cayley transform, which maps the highly nonlinear Stiefel manifold of unitary matrices to the linear space of skew-Hermitian matrices. This transformation 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. Moreover, the resulting Cayley codes allow polynomial-time near-maximum-likelihood decoding based on either successive nulling/cancelling or sphere decoding. Simulations show that the Cayley codes allow efficient and effective high-rate data transmission in multi-antenna communication systems without knowing the channel.

Status: Submitted to IEEE Trans. Info. Theory, February 2001.

Files:
   Compressed PostScript (.ps.gz) (123K),
   PostScript (.ps) (483K),
   PDF v3.0 (.pdf) (260K).

Instructions on how to view and print these files.

Bert Hochwald<hochwald@lucent.com>