File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

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

TitleLow-complexity feedforward symbol timing estimator using conditional maximum-likelihood principle
Authors
KeywordsEstimator
Maximum Likelihood
Timing Delay
Issue Date2004
Citation
Ieee Communications Letters, 2004, v. 8 n. 3, p. 168-170 How to Cite?
AbstractA 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.
Persistent Identifierhttp://hdl.handle.net/10722/155269
ISSN
2015 Impact Factor: 1.291
2015 SCImago Journal Rankings: 0.934
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorWu, YCen_US
dc.contributor.authorSerpedin, Een_US
dc.date.accessioned2012-08-08T08:32:37Z-
dc.date.available2012-08-08T08:32:37Z-
dc.date.issued2004en_US
dc.identifier.citationIeee Communications Letters, 2004, v. 8 n. 3, p. 168-170en_US
dc.identifier.issn1089-7798en_US
dc.identifier.urihttp://hdl.handle.net/10722/155269-
dc.description.abstractA 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.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Communications Lettersen_US
dc.subjectEstimatoren_US
dc.subjectMaximum Likelihooden_US
dc.subjectTiming Delayen_US
dc.titleLow-complexity feedforward symbol timing estimator using conditional maximum-likelihood principleen_US
dc.typeArticleen_US
dc.identifier.emailWu, YC:ycwu@eee.hku.hken_US
dc.identifier.authorityWu, YC=rp00195en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/LCOMM.2004.825694en_US
dc.identifier.scopuseid_2-s2.0-1942488301en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-1942488301&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume8en_US
dc.identifier.issue3en_US
dc.identifier.spage168en_US
dc.identifier.epage170en_US
dc.identifier.isiWOS:000220476600014-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridWu, YC=7406894786en_US
dc.identifier.scopusauthoridSerpedin, E=7003366947en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats