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

Upper bounds on the bit-error probability of space-time trellis codes using generating function techniques

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)
Gozali, R. ; Mobile & Portable Radio Res. Group, Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA ; Woerner, B.D.

Generating function techniques have been extensively used to analyze the performance of both convolutional and trellis codes over AWGN and Rayleigh fading channels. We apply the generating function technique with appropriate modifications in order to upper bound the bit-error probability of space-time trellis codes (STTC) over Rayleigh and Rician fading channels. We restrict our analysis to the important class of geometrically, uniform STTC, where the modified state diagram has no more states than the original code trellis. As examples, 4 and 8 state STTC with 2 transmit antenna elements and 1 or 2 receive antenna elements are considered. For these codes, the upper bound is found to be inversely proportional to the lth power of E¯b¯/N 0, where 1 corresponds to the diversity advantage of the scheme. Furthermore, comparing simulation results with the derived upper bounds, we conclude that these bounds are within 2 dB to the performance of STTC in Rayleigh or Rician fading channels

Published in:

Vehicular Technology Conference, 2001. VTC 2001 Spring. IEEE VTS 53rd  (Volume:2 )

Date of Conference:

2001

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.