An alternative blind feedforward symbol timing estimator using two samples per symbol

Yang Wang, Erchin Serpedin, Philippe Ciblat

Research output: Contribution to journalLetter

34 Citations (Scopus)

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 languageEnglish
Pages (from-to)1451-1455
Number of pages5
JournalIEEE Transactions on Communications
Volume51
Issue number9
DOIs
Publication statusPublished - Sep 2003
Externally publishedYes

Fingerprint

Mean square error
Computational complexity
Statistics
Computer simulation

Keywords

  • Asymptotic performance analysis
  • Blind feedforward estimation
  • Cyclostationarity
  • Symbol timing estimation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

An alternative blind feedforward symbol timing estimator using two samples per symbol. / Wang, Yang; Serpedin, Erchin; Ciblat, Philippe.

In: IEEE Transactions on Communications, Vol. 51, No. 9, 09.2003, p. 1451-1455.

Research output: Contribution to journalLetter

@article{c00274784dae4c4b94858f53e14c207e,
title = "An alternative blind feedforward symbol timing estimator using two samples per symbol",
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.",
keywords = "Asymptotic performance analysis, Blind feedforward estimation, Cyclostationarity, Symbol timing estimation",
author = "Yang Wang and Erchin Serpedin and Philippe Ciblat",
year = "2003",
month = "9",
doi = "10.1109/TCOMM.2003.816976",
language = "English",
volume = "51",
pages = "1451--1455",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

TY - JOUR

T1 - An alternative blind feedforward symbol timing estimator using two samples per symbol

AU - Wang, Yang

AU - Serpedin, Erchin

AU - Ciblat, Philippe

PY - 2003/9

Y1 - 2003/9

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

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

KW - Asymptotic performance analysis

KW - Blind feedforward estimation

KW - Cyclostationarity

KW - Symbol timing estimation

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

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

U2 - 10.1109/TCOMM.2003.816976

DO - 10.1109/TCOMM.2003.816976

M3 - Letter

VL - 51

SP - 1451

EP - 1455

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 9

ER -