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

A computationally efficient algorithm for space-time block decoding

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)
Cavus, E. ; Dept. of Electr. Eng., California Univ., Los Angeles, CA, USA ; Daneshrad, B.

This paper presents a computationally efficient, low-power algorithm for the decoding of space-time block codes using a previously reported maximum likelihood algorithm (Tarokh et al. 1998). The new algorithm arrives at the same decision with less computation, and therefore reduces power dissipation for an actual implementation. Based on the previous algorithm, we develop a more efficient algorithm by utilizing the properties of the constellation signals and reported decision metrics. In most cases, the new algorithm results in more than 50% reduction in the computation complexity. The algorithm is illustrated for BPSK, QPSK, PSK or QAM

Published in:

Communications, 2001. ICC 2001. IEEE International Conference on  (Volume:4 )

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.