Algorithm 1 TDSTFT

Input: $s(t)$

Output: $\tilde{c}(t),TDSTFT$

1: Initialize:$\tilde{c}(t)=0$; the largest number of iterations: $n=1,00$; convergence threshold $\epsilon$.

2: Calculate:

$TDSTFT={\displaystyle {\int }_{-\infty }^{+\infty }g(u-t)s(u)e^{-i\phi (t)u}{e}^{-i\tilde{c}(t){(u-t)}^2/2}du}$;

$L_t=length(s(t))$;

$P=peak-searching(TDSTFT)$;

$I(t)=polyfit(P)$;

$I(t)=polyfit(P)$;

$I^{\prime }(t)=diff(I(t))$;

3: Iteration:

for $j=1:n$;

$I_i(t)=I(t)$;

$\tilde{c}(t)=I^{\prime }(t)$;

$TDSTFT={\displaystyle {\int }_{-\infty }^{+\infty }g(u-t)s(u)e^{-i\phi (t)u}{e}^{-i\tilde{c}(t){(u-t)}^2/2}du}$;

$P=peak-searching(TDSTFT)$;

$I(t)=polyfit(P)$;

$I^{\prime }(t)=diff(I(t))$;

$\xi =\frac{1}{L_t}{\displaystyle {\int }_0^{L_t}\left|I(t)-I_i(t)\right|}$;

if $\xi <\epsilon$;

breake;

end

end