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

Space-time diversity systems based on linear constellation precoding

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

3 Author(s)
Xin, Yan ; Dept. of Electr. & Comput. Eng., Minnesota Univ., USA ; Zhengdao Wang ; Giannakis, G.B.

We present a unified approach to designing space-time (ST) block codes using linear constellation precoding (LCP). Our designs are based either on parameterizations of unitary matrices, or on algebraic number-theoretic constructions. With an arbitrary number of Nt transmit- and Nr receive-antennas, ST-LCP achieves rate 1 symbol/s/Hz and enjoys diversity gain as high as NtNr over (possibly correlated) quasi-static and fast fading channels. As figures of merit, we use diversity and coding gains, as well as mutual information of the underlying multiple-input-multiple-output system. We show that over quadrature-amplitude modulation and pulse-amplitude modulation, our LCP achieves the upper bound on the coding gain of all linear precoders for certain values of Nt and comes close to this upper bound for other values of Nt, in both correlated and independent fading channels. Compared with existing ST block codes adhering to an orthogonal design (ST-OD), ST-LCP offers not only better performance, but also higher mutual information for Nt>2. For decoding ST-LCP, we adopt the near-optimum sphere-decoding algorithm, as well as reduced-complexity suboptimum alternatives. Although ST-OD codes afford simpler decoding, the tradeoff between performance and rate versus complexity favors the ST-LCP codes when Nt, Nr, or the spectral efficiency of the system increase. Simulations corroborate our theoretical findings.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:2 ,  Issue: 2 )

Date of Publication:

Mar 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.