Referenced Items are not available for this document.
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
- Page(s):
- 1157 - 1162 vol.4
- Meeting Date :
- 11 Jun 2001-14 Jun 2001
- Print ISBN:
- 0-7803-7097-1
- INSPEC Accession Number:
- 7106226
- Conference Location :
- Helsinki
- Digital Object Identifier :
- 10.1109/ICC.2001.936850
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
