By Topic

Iterative maximum-likelihood sequence estimation for space-time coded systems

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

3 Author(s)
Yingxue Li ; Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA ; Georghiades, C.N. ; Huang, G.

In previous work on decoding space-time codes, it is either assumed that perfect channel state information (CSI) is present, or a channel estimate is obtained using pilot symbols and then used as if it were perfect to extract symbol estimates. In the latter case, a loss in performance is incurred, since the resulting overall receiver is not optimal. We look at maximum-likelihood (ML) sequence estimation for space-time coded systems without assuming CSI. The log-likelihood function is presented for both-quasi-static and nonstatic fading channels, and an expectation-maximization (EM)-based algorithm is introduced for producing ML data estimates, whose complexity is much smaller than a direct evaluation of the log-likelihood function. Simulation results indicate the EM-based algorithm achieves a performance close to that of a receiver which knows the channel perfectly

Published in:

Communications, IEEE Transactions on  (Volume:49 ,  Issue: 6 )