DFT Interpolation Algorithm for Kaiser–Bessel and Dolph–Chebyshev Windows

This paper describes the discrete Fourier transform (DFT) interpolation algorithm for arbitrary windows and its application and performance for optimal noncosine Kaiser-Bessel and Dolph-Chebyshev windows. The interpolation algorithm is based on the polynomial approximation of the window´s spectrum that is computed numerically. Two- and three-point (2p and 3p) interpolations are considered. Systematic errors and noise sensitivity are analyzed for the chosen Kaiser-Bessel and Dolph-Chebyshev windows and compared with Rife-Vincent class I windows.