CaltechAUTHORS
  A Caltech Library Service

Bound-intersection detection for multiple-symbol differential unitary space-time modulation

Cui, Tao and Tellambura, Chinthananda (2005) Bound-intersection detection for multiple-symbol differential unitary space-time modulation. IEEE Transactions on Communications, 53 (12). pp. 2114-2123. ISSN 0090-6778. http://resolver.caltech.edu/CaltechAUTHORS:CUIieeetc05

[img]
Preview
PDF
See Usage Policy.

671Kb

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

Abstract

This paper considers multiple-symbol differential detection (MSD) of differential unitary space-time modulation (DUSTM) over multiple-antenna systems. We derive a novel exact maximum-likelihood (ML) detector, called the bound-intersection detector (BID), using the extended Euclidean algorithm for single-symbol detection of diagonal constellations. While the ML search complexity is exponential in the number of transmit antennas and the data rate, our algorithm, particularly in high signal-to-noise ratio, achieves significant computational savings over the naive ML algorithm and the previous detector based on lattice reduction. We also develop four BID variants for MSD. The first two are ML and use branch-and-bound, the third one is suboptimal, which first uses BID to generate a candidate subset and then exhaustively searches over the reduced space, and the last one generalizes decision-feedback differential detection. Simulation results show that the BID and its MSD variants perform nearly ML, but do so with significantly reduced complexity.


Item Type:Article
Additional Information:© Copyright 2005 IEEE. Reprinted with permission. Paper approved by R. Schober, the Editor for Detection, Equalization, and MIMO of the IEEE Communications Society. Manuscript received December 6, 2004; revised April 11, 2005 and June 9, 2005. [Posted online: 2005-12-12] This work was supported in part by the Natural Sciences and Engineering Research Council of Canada, in part by the Informatics Circle of Research Excellence, and in part by the Alberta Ingenuity Fund. This paper was presented in part at the IEEE International Conference on Communications, Seoul, Korea, May 2005. The authors would like to thank the anonymous reviewers for their critical comments that greatly improved this paper.
Subject Keywords:Differential space–time coding, maximum-likelihood (ML), multiple-symbol differential detection (MSD)
Record Number:CaltechAUTHORS:CUIieeetc05
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:CUIieeetc05
Alternative URL:http://dx.doi.org/10.1109/TCOMM.2005.860056
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:382
Collection:CaltechAUTHORS
Deposited By: Archive Administrator
Deposited On:26 Oct 2006
Last Modified:26 Dec 2012 08:39

Repository Staff Only: item control page