Unitary signal constellations for differential space--Time modulation with two transmit antennas: Parametric codes, optimal designs, and bounds

نویسندگان

  • Xue-Bin Liang
  • Xiang-Gen Xia
چکیده

Differential space–time modulation has been recently proposed in the literature for multiple-antenna systems over Rayleigh-fading channels, where neither the transmitter nor the receiver knows the fading coefficients. For the practical success of differential space–time modulation, it has been shown critical to design unitary space–time signal constellations with large diversity product which is a primary property for the signal constellations to have good performance in high signal-to-noise ratio (SNR) scenarios. In this paper, we focus on the design of unitary signal constellations for differential space–time modulation with double transmit antennas. By using the parametric form of a two-by-two unitary matrix, we present a class of unitary space–time codes called parametric codes and show that this class of unitary space–time codes leads to a five-signal constellation with the largest possible diversity product and a 16-signal constellation with the largest known diversity product. Although the parametric code of size 16 is not a group by itself, we show that it is a subset of a group of order 32. Furthermore, the unitary signal constellations of sizes 32 64 128 and 256 obtained by taking the subsets of the parametric codes of sizes 37 75 135 and 273, respectively, have the largest known diversity products. We also use large diversity sum of unitary space–time signal constellations as another significant property for the signal constellations to have good performance in low-SNR scenarios. The newly introduced unitary space–time codes can lead to signal constellations with sizes of 5 and 9 through 16 that have the largest possible diversity sums. Subsequently, we construct a few sporadic unitary signal constellations with the largest possible diversity product or diversity sum. A four-signal constellation which has both the largest possible diversity product and the largest possible diversity sum and three unitary signal constellations with the largest possible diversity sums for sizes of 6, 7, and 8 are constructed, respectively. Furthermore, by making use of the existing results in sphere packing and spherical codes, we provide several upper and lower bounds on the largest possible diversity Manuscript received December 22, 2000; revised August 23, 2001. This work was supported in part by the Air Force Office of Scientific Research (AFOSR) under Grants F49620-00-1-0086 and F49620-02-1-0157, and by the National Science Foundation under Grants MIP-9703377 and CCR-0097240. The material in this paper was presented in part at the 34th Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, October 29–November 1, 2000 and the IEEE International Symposium on Information Theory, Washington, DC, June 24–29, 2001. X.-B. Liang was with the Department of Electrical and Computer Engineering, University of Delaware, Newark, DE 19716 USA. He is now with the Department of Electrical and Computer Engineering, Louisiana State University, Baton Rouge, LA 70803 USA. X.-G. Xia is with the Department of Electrical and Computer Engineering, University of Delaware, Newark, DE 19716 USA (e-mail: [email protected]). Communicated by G. Caire, Associate Editor for Communications. Publisher Item Identifier 10.1109/TIT.2002.800498. product and the largest possible diversity sum that unitary signal constellations of any size can achieve.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unitary Space-Time Constellation Designs From Group Codes

We propose new unitary space-time constellation designs with high diversity products. Our Hamiltonian and product constellations are based on Slepian’s group codes, and can be used for any number of transmitter antennas M and any data rate R. Our Hamiltonian constellations achieve the theoretical upper bound of diversity product in the case where M is even and the cardinality of the signal cons...

متن کامل

Space-Time Code Design and Its Applications in Wireless Networks

This thesis has two main contributions: the designs of differential/non-differential unitary spacetime codes for multiple-antenna systems and the analysis of the diversity gain when using spacetime coding among nodes in wireless networks. Capacity has long been a bottleneck in wireless communications. Recently, multiple-antenna techniques have been used in wireless communications to combat the ...

متن کامل

An Application of theBruhat Decomposition to the Design of Full Diversity Unitary Space-Time Codes

A full diversity constellation, that is, a set of unitary matrices whose differences have nonzero determinant, is a design criterion for codes with good performance using differential unitary space-time modulation. Recently, fixed-point free groups and the infinite group SU(2) have been used to produce full diversity unitary group constellations. In this paper, we present a new Bruhat decomposi...

متن کامل

Two complex orthogonal space-time codes for eight transmit antennas

Two complex orthogonal space-time codes for eight transmit antennas" (2004). Two new constructions of complex orthogonal space-time block codes of order 8 based on the theory of amicable orthogonal designs are presented and their performance compared with that of the standard code of order 8. These new codes are suitable for multi-modulation schemes where the performance can be sacrificed for a...

متن کامل

This Page Is Not Part of the Thesis, but Should Be Turned in to the Proofreader!

by Guangyue Han Recently there has been considerable interest in wireless communication systems using multiple antennas. Theoretical analysis shows that such systems can provide spacial and temporal diversity gain if appropriate signal sets are employed. This dissertation analyzes and designs suitable signal constellations for such systems. Diversity product and diversity sum will be derived as...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2002