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

Performance Analysis and Computational Complexity Comparison of Sequence Detection Receivers With No Explicit Channel Estimation

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)
Mingwei Wu ; Dept. of Electr. & Comput. Eng., Nat. Univ. of Singapore, Singapore, Singapore ; Pooi Yuen Kam

We consider a single-input-multiple-output (SIMO) fading channel that can be assumed static over a duration of L symbols. We show that the generalized likelihood ratio test (GLRT) receiver for detecting a block of L uncoded symbols does not require channel-state information (CSI). By deriving an exact closed-form pairwise error probability expression for the detector over slowly time-varying Rayleigh fading, we show that its performance approaches that of coherent detection with perfect CSI when L becomes large. To detect a very long sequence of S symbols over a channel that can be assumed to remain static only over L symbols, where S ≫ L, while keeping computational complexity low, we consider three pilot-based algorithms, namely, the trellis search algorithm, pilot-symbol-assisted block detection, and decision-aided block detection. We compare them with the two existing block-by-block detection algorithms, namely, lattice decoding and sphere decoding, and show the former's advantages in complexity and performance.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:59 ,  Issue: 5 )

Date of Publication:

Jun 2010

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.