Performance Analysis of Generalized Zero-Padded Blind Channel Estimation Algorithms

Abstract

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.