![]() |
CiteULike | ![]() |
saeeed's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
FPGA implementation of Radix-2<sup>2</sup>pipelined FFT processorIn WAV'09: Proceedings of the 3rd WSEAS international symposium on Wavelets theory and applications in applied mathematics, signal processing & modern science (2009), pp. 109-114.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractThe Fast Fourier Transform (FFT) is very important algorithm in signal processing, software-defined radio, and wireless communication. This paper explains the realization of radix-2 2 single-path delay feedback pipelined FFT processor. This architecture has the same multiplicative complexity as radix-4 algorithm, but retains the simple butterfly structure of radix-2 algorithm. The implementation was made on a Field Programmable Gate Array (FPGA) because it can achieve higher computing speed than digital signal processors (DSPs), and also can achieve cost effectively ASIC-like performance with lower development time, and risks. The processor has been developed using hardware description language VHDL and simulated up to 465 MHz on an Xilinx xc5vsx35t for transformation length 256-point.
BibTeX record
RIS record