DocumentCode
627207
Title
FPGA implementation of fast serial 64-points FFT/IFFT block without reordering block
Author
Kasim, Muhammad Firmansyah ; Adiono, Trio ; Fahreza, Muhammad ; Zakiy, M. Fadhli
Author_Institution
Sekolah Teknik Elektro Informatika, Inst. Teknol. Bandung, Bandung, Indonesia
fYear
2013
fDate
17-18 May 2013
Firstpage
1
Lastpage
6
Abstract
There has been many FPGA implementation of serial Fast Fourier Transform (FFT) operation. In the most cases, output of the serial FFT block is in bit-reversed order, so it needs a reordering block to reorder the output. However, some of FFT applications do not require ordered output of FFT, such like Spectral Subtraction method. In this paper, we propose an FPGA implementation of serial FFT and IFFT architecture in one block without reordering block. By not implementing the reordering block, we can save some clock cycles latency and increase speed of the block. The architecture is implemented in Altera DE2-70 board with Cyclone II EP2C35F672C6 FPGA chip. Our 64-points FFT/IFFT block utilizes 2960 logic elements or half of logic elements utilized by Altera MegaFunction´s FFT IP. The block can work in maximum frequency of 84.55MHz and perform 64-points FFT/IFFT operation in 863.4ns.
Keywords
fast Fourier transforms; field programmable gate arrays; Altera DE2-70 board; Altera MegaFunction´s FFT IP; Cyclone II EP2C35F672C6 FPGA chip; FPGA implementation; bit reversed order; clock cycles latency; fast Fourier transform operation; fast serial 64-points FFT-IFFT block; reordering block; spectral subtraction method; Clocks; Computer architecture; Delays; Equations; Field programmable gate arrays; Mathematical model; Random access memory; FFT; FPGA implementation; reordering block;
fLanguage
English
Publisher
ieee
Conference_Titel
Informatics, Electronics & Vision (ICIEV), 2013 International Conference on
Conference_Location
Dhaka
Print_ISBN
978-1-4799-0397-9
Type
conf
DOI
10.1109/ICIEV.2013.6572558
Filename
6572558
Link To Document