High Speed FFT computation using optimized Radix 8 Algorithm

  • C. Priyanka, S.N. Lakshmi Malluvalasa, A.Samhitha, Y.Syamala, V.Bhanu Teja

Abstract

In the digital world, communication is one of the important aspects in connecting people. Power consumption, time, speed and accuracy plays a major role. Conversion of time domain to frequency domain is the highest priority in receiving end. Butterfly Radix conversion is used for Fast Fourier Transform (FFT) and in Inverse Fast Fourier Transform (IFFT). Here it is discussed about radix 2, radix 4 and radix 8 algorithms comparing accordingly. In this paper, we discuss about the optimized radix 8 algorithm implementation and computation. This provides good result in reducing area and power. The implementation is carried using Xilinx 14.5 IDE tool for obtaining simulation result. 

 

Keywords: FFT, DFT, Radix, Butterfly diagrams, CSA, RCA, area, delay

Published
2020-06-06
How to Cite
C. Priyanka, S.N. Lakshmi Malluvalasa, A.Samhitha, Y.Syamala, V.Bhanu Teja. (2020). High Speed FFT computation using optimized Radix 8 Algorithm. International Journal of Advanced Science and Technology, 29(04), 6307 - 6312. Retrieved from http://sersc.org/journals/index.php/IJAST/article/view/27322
Issue
Vol. 29 No. 04 (2020): Vol 29 No. 4 (2020)
Section
Articles