抽象的な

Discrete Fourier Transform: Approach To Signal Processing

Anant G. Kulkarni, Dr. M. F. Qureshi, Dr. Manoj Jha

There are three different way to calculate DFT. First method is using formula of DFT or simultaneous equation. Second is Correlation technique and third one is using Fast Fourier Transform (FFT). First method is useful for understanding of basic idea of DFT, but it is not fit for practical and application purpose. In second method is based on detecting known waveform in another signal. It is used for some specified application. This method is used, when DFT has less than about 32 points. Third method is genius method, where FFT algorithm decomposes a DFT with N points, into N DFTs each with single point It is faster than DFT. These all three methods produce an identical output. Here we focused on FFT. This paper described about of DFT using FFT and its MATLAB implementation. The FFT spectrums for the outputs are analysed.