A performance lower bound for quadratic timing recovery accounting for the symbol transition density
Visualitza/Obre
Tipus de documentArticle
Data publicació2004-11-30
EditorIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
The symbol transition density in a digitally modulated signal affects the performance of practical synchronization schemes designed for timing recovery. This paper focuses on the derivation of simple performance limits for the estimation of the time delay of a noisy linearly modulated signal in the presence of various degrees of symbol correlation produced by the various
transition densities in the symbol streams. The paper develops high- and low-signal-to-noise ratio (SNR) approximations of the so-called (Gaussian) unconditional Cramér–Rao bound (UCRB),
as well as general expressions that are applicable in all ranges of SNR. The derived bounds are valid only for the class of quadratic, non-data-aided (NDA) timing recovery schemes. To illustrate the validity of the derived bounds, they are compared with the actual performance achieved by some well-known quadratic NDA timing recovery schemes. The impact of the symbol transition
density on the classical threshold effect present in NDA timing recovery schemes is also analyzed. Previous work on performance
bounds for timing recovery from various authors is generalized and unified in this contribution.
CitacióRiba Sagarra, J. A performance lower bound for quadratic timing recovery accounting for the symbol transition density. IEEE Transactions on Signal Processing, 2004, vol 52, núm. 11, p. 3278-3288
ISSN1053-587X
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Riba.pdf | 456,3Kb | Visualitza/Obre |