Abstract:The Fast Fourier Transform (FFT)is a basic algorithm in digital signal processing (DSP) and communication systems, and it is a computationally very efficient algorithm for calculating the Discrete Fourier Transform (DFT). A DFT has a time complexity of O (N2) while an FFT has time complexity O (N log N). DFT is an integral part of FFT. The Very Large Scale Integration (VLSI) implementation of the FFT is extremely computationally efficient by optimizing parameters like power, speed and area. Different FFT architectures employ different radix methods, such as Radix.......
Keywords: DFT, FFT, Radix 2, Radix 4, Split Radix, VLSI, Verilog
[1]
L. Santhosh And A. Thomas, "Implementation Of Radix 2 And Radix 22 Fft Algorithms On Spartan6 Fpga," In 2013 Fourth International Conference On Computing, Communications And Networking Technologies (Icccnt), Tiruchengode: Ieee, Jul. 2013, Pp. 1–4. Doi: 10.1109/Icccnt.2013.6726840[2]
P. Duhamel, "Implementation Of 'Split-Radix' Fft Algorithms For Complex, Real, And Real-Symmetric Data," Ieee Trans. A Coust. Speech Signal Process., Vol. 34, No. 2, Pp. 285–295, Apr. 1986, Doi: 10.1109/Tassp.1986.1164811.
[3]
R. Barma Venkata And N. Fazal, "Fpga Implementation Of Optimized Radix 4 And Radix 8 Booth Algorithm," Int. J. Perform. Eng., Vol. 17, No. 6, P. 552, 2021, Doi: 10.23940/Ijpe.21.06.P8.552558.
[4]
M. Butorac And M. Vucic, "Fpga Implementation Of Simple Digital Signal Processor," In 2012 19th Ieee International Conference On Electronics, Circuits, And Systems (Icecs 2012), Seville, Seville, Spain: Ieee, Dec. 2012, Pp. 137–140.
Doi: 10.1109/Icecs.2012.6463781.
[5]
F. D. Nunes And J. M. N. Leitao, "Signal Processing Aspects Of Fusion Plasma Broadband Reflectometry," Ieee Trans. Signal Process., Vol. 47, No. 2, Pp. 378–388, Feb. 1999, Doi: 10.1109/78.740123..
