• MARTHA ESTHER
• K.PADMA PRIYA
• G.GAURAV GUPTA

FFT (fast Fourier transform) is the fundamental algorithm in digital information processing that samples a signal over a period of time and divides into its frequency components. FFT can be of 2-point,4-point,8-point,. . .2^r-point on computation. Net computational complexity increases with increase in 'r'. FFT is used to minimize the complex multiplications and computes DFT (Discrete Fourier Transform) much faster than any other algorithm.FFT for 13569 elements will be implemented on FPGA using Questasim 10.3b software for simulation and Precision RTL2014 software for synthesis using verilog HDL(Hardware Description Language). High radiX FFT are used in receiver module of AIS (Automatic Identification Systems).

FFT, SRFFT, DFT, 4-POINT FFT, 2-POINT FFT.

"IMPLEMENTATION OF HIGH RADIX FFT", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.716-719, June 2019, Available :http://www.jetir.org/papers/JETIR1907F97.pdf

"IMPLEMENTATION OF HIGH RADIX FFT", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp716-719, June 2019, Available at : http://www.jetir.org/papers/JETIR1907F97.pdf