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

Reduced Complexity Decoding Algorithm for Quasi-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)
Jeongchang Kim ; Div. of Electr. & Comput. Eng., Pohang Univ. of Sci. & Technol. ; Kyungwhoon Cheun

The quasi-orthogonality of quasi-orthogonal space-time block codes (QO-STBCs) does reduce the decoding complexity from order of MQN to MQN/2 for Q-ary QAM modulation with N transmit and M receive antennas. Here, we propose a decoding algorithm for QO-STBCs based on interference cancellation with complexity on the order of MQ N/2-1 and performance virtually identical to that of ML decoding

Published in:

Communications, 2006. APCC '06. Asia-Pacific Conference on

Date of Conference:

Aug. 2006

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.