Abstract
Recently, Lee has proposed a blind feedforward symbol timing estimator that exhibits low computational complexity and requires only two samples per symbol. In this paper, Lee's estimator is analyzed rigorously by exploiting efficiently the cyclostationary statistics present in the received oversampled signal, and its asymptotic (large sample) bias and mean-square error (MSE) are derived in closed-form expression. A new blind feedforward time estimator that requires only two samples per symbol and presents the same computational complexity as Lee's estimator is proposed. It is shown that the proposed new estimator is asymptotically unbiased and exhibits smaller MSE than Lee's estimator. Computer simulations are presented to illustrate the performance of the proposed new estimator with respect to Lee's estimator and the existing conventional estimators.
| Original language | English |
|---|---|
| Pages (from-to) | 1451-1455 |
| Number of pages | 5 |
| Journal | IEEE Transactions on Communications |
| Volume | 51 |
| Issue number | 9 |
| DOIs | |
| Publication status | Published - 1 Sept 2003 |
Keywords
- Asymptotic performance analysis
- Blind feedforward estimation
- Cyclostationarity
- Symbol timing estimation