A constrained notch Fourier transform

The paper presents a new sliding algorithm for estimating the amplitude and phase of the Fourier coefficients of noise corrupted harmonic signals given a priori knowledge of the signal frequencies. The proposed method is similar in principle to the notch Fourier transform (NFT) technique suggested by Tadokoro et al. [1987] except that it employs an infinite impulse response (IIR) rather than a finite impulse response (FIR) notch filter parameterization. This modification provides bandwidth controlled bandpass (BP) filters whose center frequencies are equally spaced in the frequency spectrum. In this sense, the proposed technique can be regarded as a constrained notch Fourier transform (CNFT). Sliding algorithms have been derived for both the NFT and CNFT for the purpose of estimating the Fourier coefficients of the sinusoidal components. The paper also proposes a similar algorithm to the CNFT for the signals containing sinusoids at arbitrary known frequencies. The main feature of the modified CNFT is that it uses second-order IIR BP filters whose bandwidth and center frequency can be adjusted independently. The bandwidth control aspect provides the user with an efficient means of achieving the required resolution as well as reducing spectral leakage. In general, the proposed approach leads to considerable reduction in terms of computational burden and memory storage