Low-complexity feedforward symbol timing estimator using conditional maximum-likelihood principle Academic Article

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.

authors

• Serpedin, Erchin

published proceedings

• IEEE COMMUNICATIONS LETTERS

author list (cited authors)

• Wu, Y. C., & Serpedin, E.

citation count

• 9

complete list of authors

• Wu, YC||Serpedin, E

publication date

• March 2004

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE Communications Letters  Journal

keywords

• Estimator
• Maximum Likelihood
• Timing Delay

Digital Object Identifier (DOI)

• 10.1109/LCOMM.2004.825694

start page

• 168

end page

• 170

volume

• 8

issue

• 3

URL

• http://dx.doi.org/10.1109/lcomm.2004.825694