Let g be a function defined upon R, with values in C and G its Fourier transform. Let

be the distribution upon R defined by

where

and δ
αis the Dirac function at abscissa α.

is a discrete "time window" and its Fourier transform is a periodic function

of the frequency (period N/T). Taking the Fourier transform of the product of

by g, we obtain
![F[\\nabla _{g}] = F [\\nabla ] \\ast F[g] = \\Gamma \\ast G](/images/tex/14869.gif)
(* means convolution product).
![F[\\nabla _{g}]](/images/tex/14870.gif)
is also a periodic function of the frequency (period N/T) and
![F[\\nabla _{g}] (frac{j}{T}) = \\sum \\min{k=0}\\max {N-1} \\gamma \\kappa \\cdot g\\kappa \\cdot \\exp - 2i\\pi frac{jk}{N}](/images/tex/14871.gif)
where
](/images/tex/14872.gif)
for j=0,..., N-1 is obtained very efficiently using the FFT algorithm of Cooley and Tukey. Cleverly choosing the weights
|^{2}](/images/tex/14873.gif)
for j = -N/2, ..., N/2-1 is a good estimator of the power spectrum of g. The vector γ (with components

) that maximize the ratio

gives us an optimal discrete window. Then γ is the eigenvector corresponding to the greatest eigenvalue λ
0of a matrix M defined by

The method for calculating this eigenvector is shown for large values of N (N = 2048).