Referenced Items are not available for this document.
Space-time coding (STC) schemes for communication systems employing multiple transmit and receive antennas have been attracting increased attention. The so-called linear space-time block codes (STBC) have been of particular interest due to their good performance and low decoding complexity. In this paper we take a systematic maximum-likelihood (ML) approach to the decoding of STBC for unknown propagation channels and unknown noise and interference conditions. We derive a low-complexity ML decoding algorithm based on cyclic maximization of the likelihood function. Furthermore, we discuss the design of optimal training sequences and optimal information transfer to an outer decoder. Numerical examples demonstrate the performance of our algorithm.
Published in:
Signals, Systems and Computers, 2001. Conference Record of the Thirty-Fifth Asilomar Conference on
(Volume:2
)
Date of Conference: 4-7 Nov. 2001
- Page(s):
- 916 - 920 vol.2
- Meeting Date :
- 04 Nov 2001-07 Nov 2001
- ISSN :
- 1058-6393
- Print ISBN:
- 0-7803-7147-X
- INSPEC Accession Number:
- 7335491
- Conference Location :
- Pacific Grove, CA, USA
- Digital Object Identifier :
- 10.1109/ACSSC.2001.987629
- 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.
