Low-Complexity Feedforward Symbol Timing Estimator Using Conditional Maximum-Likelihood Principle Academic Article uri icon

abstract

  • A low complexity feedforward symbol-timing estimator based on the conditional maximum-likelihood principle is proposed. An approximation is applied to the Fourier series expansion of the conditional maximum-likelihood function such that implementation complexity is greatly reduced. It is shown that the proposed estimator can be viewed as a generalization of the well-known square nonlinearity estimator proposed by Oerder and Meyr in 1988. Simulation results show that the performance of the proposed estimator is very close to the conditional Cramer-Rao bound and is better than that of the square nonlinearity estimator.

published proceedings

  • IEEE Communications Letters

author list (cited authors)

  • Wu, Y., & Serpedin, E

citation count

  • 9

complete list of authors

  • Wu, Y-C||Serpedin, E

publication date

  • March 2004