COMPARISON OF PARAMETERS OF EXPONENTIAL SIGNAL USING DFT AND INTERPOLATED DFT ALGORITHM

Abstract

Distinct Fourier rework (DFT) is maybe the foremost standard signal process tool. Wide DFT use is partially dedicated to quick Fourier rework (FFT) algorithms (Cooley & Tukey, 1965, Oppenheim et al., 1999, Lyons, 2004). DFT can also be with efficiency computed by algorithmic algorithms within the window slippy by one sample (Jacobsen & Lyons, 2003, Duda, 2010). sadly, DFT has 2 main drawbacks that deteriorate signal analysis that square measure (Harris, 1978, Oppenheim et al., 1999): 1) spectral run, and 2) sampling of the continual spectrum of the distinct signal. Spectral run is reduced by correct time windows, and also the frequency bins between DFT bins square measure computed by interpolated DFT(IpDFT) algorithms, totally given during this paper.