Cart (Loading....) | Create Account
Close category search window
 

Upper bounds of rates of complex orthogonal space-time block codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Haiquan Wang ; Dept. of Electr. & Comput. Eng., Univ. of Delaware, Newark, DE, USA ; Xia, Xiang-Gen

We derive some upper bounds of the rates of (generalized) complex orthogonal space-time block codes. We first present some new properties of complex orthogonal designs and then show that the rates of complex orthogonal space-time block codes for more than two transmit antennas are upper-bounded by 3/4. We show that the rates of generalized complex orthogonal space-time block codes for more than two transmit antennas are upper-bounded by 4/5, where the norms of column vectors may not be necessarily the same. We also present another upper bound under a certain condition. For a (generalized) complex orthogonal design, its variables are not restricted to any alphabet sets but are on the whole complex plane. A (generalized) complex orthogonal design with variables over some alphabet sets on the complex plane is also considered. We obtain a condition on the alphabet sets such that a (generalized) complex orthogonal design with variables over these alphabet sets is also a conventional (generalized) complex orthogonal design and, therefore, the above upper bounds on its rate also hold. We show that commonly used quadrature amplitude modulation (QAM) constellations of sizes above 4 satisfy this condition.

Published in:

Information Theory, IEEE Transactions on  (Volume:49 ,  Issue: 10 )

Date of Publication:

Oct. 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.