Title
Implementation of split-radix Fast Fourier Transform on FPGA
Date Issued
15 July 2010
Access level
metadata only access
Resource Type
conference paper
Abstract
Nowadays, portable systems are developed especially for signal processing, where the principal challenge is to find circuits with less area and power consumption. One of the most powerful tools in the area of Signal Processing is the Fast Fourier Transform (FFT). Many algorithms have been developed to improve its computation time; one of them is the Split Radix Fast Fourier Transform (SRFFT) which reduces the number of complex computation. Therefore, a new architecture is proposed to compute the SRFFT. Although the runtime of this design is high, it has some important profits like a flexible number of inputs N=2P; few resources required such as combinational functions, logic registers and memory. © 2010 IEEE.
Start page
167
End page
170
Language
English
OCDE Knowledge area
Ingeniería eléctrica, Ingeniería electrónica
Scopus EID
2-s2.0-77954450404
Resource of which it is part
6th Southern Programmable Logic Conference, SPL 2010 - Proceedings
ISBN of the container
9781424470891
Conference
6th Southern Programmable Logic Conference, SPL 201024 March 2010through 26 March 2010
Sponsor(s)
IEEEIEEE Circuits and Systems SocietyThe Ministry of Education of BrazilCoordenacao de Aperfeicoamento de Pessoal de Nivel SuperiorFund. Apoio Ciecia Tecnol. Estado Pernamb. (FACEPE)
Sources of information: Directorio de Producción Científica Scopus