Performance Analysis of Generalized Zero-Padded Blind Channel Estimation Algorithms
- Creators
- Su, Borching
-
Vaidyanathan, P. P.
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.
Additional Information
© Copyright 2007 IEEE. Reprinted with permission. Manuscript received March 20, 2007; revised April 9, 2007. [Posted online: 2007-10-22] This work was supported in part by the NSF Grant CCF-0428326, in part by ONR Grant N00014-06-1-0011, and in part by the Moore Fellowship of the California Institute of Technology. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Xiang-Gen Xia.Files
| Name | Size | Download all |
|---|---|---|
|
md5:2d0cd46d50b1814e46384be05b6b4f2f
|
155.2 kB | Preview Download |
Additional details
- Eprint ID
- 9223
- Resolver ID
- CaltechAUTHORS:SUBieeespl07
- Created
-
2007-11-27Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field