Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.