International Journal of Engineering and Management Research (IJEMR)
  • Year: 2016
  • Volume: 6
  • Issue: 6

Implementation of Fast Fourier Transform in Verilog

  • Author:
  • Anup Tiwari1, Samir Pandey2
  • Total Page Count: 6
  • Page Number: 35 to 40

1Assistant Professor, ECE Department, Jharkhand Rai University, Ranchi, Jharkhand, India

2Assistant Professor, Mathematics Dept, XIPT, Ranchi, Jharkhand, India

Online published on 24 October, 2017.

Abstract

The use of FFT is very efficient and vast in the field of Digital signal Processing and Communication. The Discrete Fourier Transform(DFT)can be implemented very fast using Fast Fourier Transform(FFT). It is one of the finest operations in the area of digital signal and image processing. FFT is a luxurious operation in terms of DSP and Communication. To achieve FFT calculation with a many points and with maximum number of samples requirement could not be matched by efficient hardware's like DSP. So a fine solution is to use dedicated hardware processor to perform efficient FFT working out at high sample rate, while the DSP could perform the less concentrated parts of the processing. Verilog implementation of floating point FFT with reduced generation logic is the proposed architecture, where the two inputs and two outputs of any butterfly can be exchangedence all data and addresses in FFT dispensation can be reordered.

Keywords

FFT, DSP, DFT