By Topic

On performance limits of space-time codes: a sphere-packing bound approach

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
$33 $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)
M. Fozunbal ; Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA ; S. W. McLaughlin ; R. W. Schafer

A sphere-packing bound (SPB) on average word-error probability (WEP) is derived to determine the performance limits of space-time codes on Rayleigh block-fading channels under delay and maximum energy constraints. Two other explicit bounds, a looser bound and a tight approximate bound, are also derived to provide more intuition on how the system parameters affect the performance limits. Moreover, it is shown that as the block length grows to infinity, the SPB converges to the outage probability, and the asymptotic behavior of performance limits is determined by the outage probability.

Published in:

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