A class of data-aided timing-recovery schemes

Bergmans, J.W.M.; Wong-Lam, H.W.

doi:10.1109/26.380233

Cited by 31 publications

(12 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Consider the single-user complex baseband model for the received signal (1) where is an attenuated and delayed version of the data modulated signal transmitted by the user (2) Note that is a superposition of delayed and scaled versions of the signaling waveform , which is assumed to be a known PN code. For simplicity, it is assumed that the period of the PN code is equal to the data symbol time interval .…”

Section: Observation Modelmentioning

confidence: 99%

“…Therefore, an optimal receiver that jointly estimates the nuisance parameters as well as the data symbols is sought in order to achieve better performance. A considerable amount of research has gone into improving the performance of the basic PLL and DLL synchronization techniques, e.g., by using decision feedback in a data-aided loop (DAL) [2], [23], a decision-directed receiver [22], or by deriving optimal nondata-aided estimation structures [27]. More recently, digital implementations of pseudo-noise (PN) code tracking algorithms using the extended Kalman filter have been proposed [21].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A maximum likelihood digital receiver using coordinate ascent and the discrete wavelet transform

Sharfer

Hero²

1999

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

Abstract-In this paper, a maximum likelihood (ML) method is presented for joint estimation of amplitude, phase, time delay, and data symbols in a single-user direct-sequence spreadspectrum communication system. Since maximization of the likelihood function is analytically intractable, a novel coordinate ascent algorithm is used to obtain sequential updates of the data symbols and all unknown nuisance parameters. The novelty of the algorithm is due to the use of a multiresolution expansion of the received signal and the use of polynomial rooting in the complex plane in place of a line search over the signal delay parameter. The multiresolution structure of the algorithm is exploited to reduce sensitivity to impulsive noise via wavelet thresholding. Computer simulations of the single-user system show that the algorithm has fast convergence, and comparison with theoretical lower bounds establishes that the algorithm achieves nearly optimal error performance.Index Terms-Bit synchronization, carrier phase recovery, impulsive noise mitigation, sequence estimation, wireless communications.

show abstract

Section: Observation Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A maximum likelihood digital receiver using coordinate ascent and the discrete wavelet transform

Sharfer

Hero²

1999

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

show abstract

“…Manuscript The MM-TED has been comprehensively used in many TR systems. In [4], Bergmans et al developed a class of data-aided zero forcing (ZF) TR scheme. It correlates the error signal with a clear reference signal, and the timing loop will adjust the voltage controlled oscillator (VCO) until the inter-symbol-interference (ISI) terms approach zero.…”

Section: Introductionmentioning

confidence: 99%

A Novel Baud-Rate Timing Error Detector Design for Baseband Transmission System Using Tomlinson-Harashima Precoder

Chien

Mao

Tsao

2008

IEEE Signal Process. Lett.

View full text Add to dashboard Cite

Extraction of correct timing error information is very important for high-speed digital transmission systems. In this letter, a novel effective-data-sequence-based timing error detector (EDS-TED) is presented for a baseband transmission system using nonlinear Tomlinson-Harashima precoding (THP), such as 10GBASE-T. The key idea of our TED is to minimize the mean square error between the received and desired EDS, rather than between the transmitted data signals. This formulation can exploit the autocorrelation between the EDS signals and extract the timing information embedded in the received signal. Moreover, the proposed architecture can lead to a simple and feasible circuit implementation. Simulation results show that a timing loop based on the proposed EDS-TED achieves a superior performance over traditional TED in terms of the peak-to-peak jitter and the TED gain.Index Terms-10GBASE-T, effective data sequence (EDS), timing error detector (TED), Tomlinson-Harashima precoding (THP).

show abstract

“…To this aim, we assume in this section that noise statistics are known and fixed during the transmission of the symbols . The DA ML estimate of the phase-error is obtained by maximizing the likelihood function, i.e., (5) over all possible phase-errors , where the likelihood function is the joint probability density function of the received samples conditioned on the transmitted symbols and on the phase-error .…”

Section: Maximum-likelihood Timing-error Detectormentioning

confidence: 99%

“…This problem has been a subject of investigation for many decades. Among the existing solutions [1], data-aided (DA) timing recovery schemes, e.g., [2]- [5], are known to be more powerful. DA schemes use the transmitted data sequence as side information to facilitate timing recovery.…”

Section: Introductionmentioning

confidence: 99%

Data-Aided Timing Recovery for Recording Channels With Data-Dependent Noise

et al. 2006

Self Cite

View full text Add to dashboard Cite

In high-density data storage systems, noise becomes highly correlated and data dependent as a result of media noise, channel nonlinearities, and front-end filters. In such environments, conventional timing recovery schemes will exhibit large residual timing jitter and, especially, data-dependent timing jitter. This paper presents a new data-aided timing recovery algorithm for data storage systems with data-dependent noise. We derive a maximum-likelihood timing recovery scheme based on a data-dependent Gauss-Markov model of the noise. The timing recovery algorithm incorporates data-dependent noise prediction parameters in the form of linear prediction filters and prediction error variances. Moreover, because noise can be nonstationary in practice, we propose an adaptive algorithm to estimate and track the noise prediction parameters. Simulation results, for an idealized optical storage channel incorporating a simple model of media noise, illustrate the merits of our algorithm.

show abstract

A class of data-aided timing-recovery schemes

Cited by 31 publications

References 19 publications

A maximum likelihood digital receiver using coordinate ascent and the discrete wavelet transform

A maximum likelihood digital receiver using coordinate ascent and the discrete wavelet transform

A Novel Baud-Rate Timing Error Detector Design for Baseband Transmission System Using Tomlinson-Harashima Precoder

Data-Aided Timing Recovery for Recording Channels With Data-Dependent Noise

Contact Info

Product

Resources

About