By Topic

Performance Analysis of Generalized Zero-Padded Blind Channel Estimation Algorithms

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)
Borching Su ; California Inst. of Technol., Pasadena ; Vaidyanathan, P.P.

In this letter, we analyze the performance of a recently reported generalized blind channel estimation algorithm. The algorithm has a parameter called repetition index, and it reduces to two previously reported special cases when the repetition index is chosen as unity and as the size of received blocks, respectively. The theoretical performance of the generalized algorithm is derived in high-SNR region for any given repetition index. A recently derived Cramer-Rao bound (CRB) is reviewed and used as a benchmark for the performance of the generalized algorithm. Both theory and simulation results suggest that the performance of the generalized algorithm is usually closer to the CRB when the repetition index is larger, but the performance does not achieve the CRB for any repetition index.

Published in:

Signal Processing Letters, IEEE  (Volume:14 ,  Issue: 11 )