Fig 1 - uploaded by Sudhir Namdeorao Shelke
Content may be subject to copyright.
![16 point Radix-4 FFT DIT algorithm [9]](profile/Sudhir-Shelke/publication/372768390/figure/fig1/AS:11431281178092588@1690790180440/point-Radix-4-FFT-DIT-algorithm-9.jpg)
Source publication
![Fig. 1 16 point Radix-4 FFT DIT algorithm [9]](profile/Sudhir-Shelke/publication/372768390/figure/fig1/AS:11431281178092588@1690790180440/point-Radix-4-FFT-DIT-algorithm-9_Q320.jpg)
The Fast Fourier Transform (FFT) is an efficient algorithm for computing the Discrete Fourier Transform and requires less number of computations than that of direct evaluation of Discrete Fourier Transform (DFT). It has several applications in signal processing. But, because of the complexity of the processing algorithm of FFT, recently various rad...
