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

Yik Chung Wu, Erchin Serpedin

Research output: Contribution to journalArticle

10 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)168-170
Number of pages3
JournalIEEE Communications Letters
Volume8
Issue number3
DOIs
Publication statusPublished - Mar 2004
Externally publishedYes

Fingerprint

Likelihood Principle
Conditional Maximum Likelihood
Feedforward
Low Complexity
Maximum likelihood
Timing
Estimator
Cramer-Rao bounds
Fourier series
Nonlinearity
Cramér-Rao Bound
Fourier Expansion
Likelihood Function
Series Expansion
Approximation
Simulation

Keywords

  • Estimator
  • Maximum likelihood
  • Timing delay

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Low-complexity feedforward symbol timing estimator using conditional maximum-likelihood principle. / Wu, Yik Chung; Serpedin, Erchin.

In: IEEE Communications Letters, Vol. 8, No. 3, 03.2004, p. 168-170.

Research output: Contribution to journalArticle

@article{42097b5f26ff487fb2fb2a11e1003f08,
title = "Low-complexity feedforward symbol timing estimator using conditional maximum-likelihood principle",
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.",
keywords = "Estimator, Maximum likelihood, Timing delay",
author = "Wu, {Yik Chung} and Erchin Serpedin",
year = "2004",
month = "3",
doi = "10.1109/LCOMM.2004.825694",
language = "English",
volume = "8",
pages = "168--170",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

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

AU - Wu, Yik Chung

AU - Serpedin, Erchin

PY - 2004/3

Y1 - 2004/3

N2 - 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.

AB - 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.

KW - Estimator

KW - Maximum likelihood

KW - Timing delay

UR - http://www.scopus.com/inward/record.url?scp=1942488301&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1942488301&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2004.825694

DO - 10.1109/LCOMM.2004.825694

M3 - Article

VL - 8

SP - 168

EP - 170

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 3

ER -