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

Author

Duda, Krzysztof

Author_Institution

Dept. of Meas. & Instrum., AGH Univ. of Sci. & Technol., Kraków, Poland

Volume

60

Issue

3

fYear

2011

fDate

3/1/2011 12:00:00 AM

Firstpage

784

Lastpage

790

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.

Keywords

Chebyshev approximation; discrete Fourier transforms; interpolation; measurement errors; polynomial approximation; DFT interpolation algorithm; Dolph-Chebyshev window; discrete Fourier transform interpolation algorithm; noise sensitivity; noncosine Kaiser-Bessel window; polynomial approximation; systematic error; Discrete Fourier transforms; Frequency estimation; Interpolation; Noise; Polynomials; Systematics; Discrete Fourier transform (DFT); frequency estimation; frequency-domain measurements; interpolated DFT; signal processing; windowing;

fLanguage

English

Journal_Title

Instrumentation and Measurement, IEEE Transactions on

Publisher

ieee

ISSN

0018-9456

Type

jour

DOI

10.1109/TIM.2010.2046594

Filename

5710187