NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Successive Frequency Domain Minimization for Time Delay Estimation
Published
Author(s)
Ismet Sahin, Marwan A. Simaan, Anthony J. Kearsley
Abstract
Estimating time delays for signal alignment is important for many applications. This paper extends a successful frequency domain cost function minimization algorithm capable of estimating time delays to within a fraction of sampling periods. Since a narrow basin of attraction around the global minimum of is typical for this function, this method often diverges when initial time delay estimates are not sufficiently close to the desired optimal time delays. We propose a second order successive minimization method with reduced sensitivity to initial guesses. Both an analytic expression for the cost function Hessian matrix and a condition guaranteeing positive-definiteness are presented. This condition facilitates the construction of sequentially modified cost functions whose nested minimization increases the basin of attraction around the global minimum. This successive minimization technique is more robust and yields higher accuracy when compared to the original method and the well-known method of Cross Correlator (CC).
Sahin, I.
, Simaan, M.
and Kearsley, A.
(2013),
Successive Frequency Domain Minimization for Time Delay Estimation, Signal Processing, [online], https://doi.org/10.1016/j.sigpro.2013.10.025
(Accessed October 13, 2025)