CaltechAUTHORS
  A Caltech Library Service

Unitary space-time modulation via Cayley transform

Jing, Yindi and Hassibi, Babak (2003) Unitary space-time modulation via Cayley transform. IEEE Transactions on Signal Processing, 51 (11). pp. 2891-2904. ISSN 1053-587X. http://resolver.caltech.edu/CaltechAUTHORS:JINieeetsp03

[img]
Preview
PDF
See Usage Policy.

1022Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:JINieeetsp03

Abstract

A prevoiusly proposed method for communicating with multiple antennas over block fading channels is unitary space-time modulation (USTM). In this method, the signals transmitted from the antennas, viewed as a matrix with spatial and temporal dimensions, form a unitary matrix, i.e., one with orthonormal columns. Since channel knowledge is not required at the receiver, USTM schemes are suitable 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. Previous results have shown that if suitably designed, USTM schemes can achieve full channel capacity at high SNR and, moreover, that all this can be done over a single coherence interval, provided the coherence interval and number of transmit antennas are sufficiently large, which is a phenomenon referred to as autocoding. While all this is well recognized, what is not clear is how to generate good performing constellations of (nonsquare) unitary matrices that lend themselves to efficient encoding/decoding. The schemes proposed so far either exhibit poor performance, especially at high rates, or have no efficient decoding algorithms. We propose to use the Cayley transform to design USTM constellations. This work can be viewed as a generalization, to the nonsquare case, of the Cayley codes that have been proposed for differential USTM. The codes are designed based on an information-theoretic criterion and lend themselves to polynomial-time (often cubic) near-maximum-likelihood decoding using a sphere decoding algorithm. Simulations suggest that the resulting codes allow for effective high-rate data transmission in multiantenna communication systems without knowing the channel. However, our preliminary results do not show a substantial advantage over training-based schemes.


Item Type:Article
Additional Information:© Copyright 2003 IEEE. Reprinted with permission. Manuscript received September 5, 2002; revised June 2, 2003. [Posted online: 2003-12-19] This work was supported by the Air Force Office for Scientific Research for Mathematical Infrastructure for Robust Virtual Engineering (MURI), Protecting Infrastructures from Themselves (URI), and Caltech’s Lee Center for Advanced Networking. The associate editor coordinating the review of this paper and approving it for publication was Prof. Brian Hughes.
Subject Keywords:Cauchy random matrices, Cayley transform, diversity product, fading channels, isotropic distribution, unitary space-time codes, unitary space-time modulation, wireless communications
Record Number:CaltechAUTHORS:JINieeetsp03
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:JINieeetsp03
Alternative URL:http://dx.doi.org/10.1109/TSP.2003.818202
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:1817
Collection:CaltechAUTHORS
Deposited By: Archive Administrator
Deposited On:19 Feb 2006
Last Modified:26 Dec 2012 08:46

Repository Staff Only: item control page