Description: 离散傅立叶变换的实现,基本功能：构造一个CFourior类的对象。-Discrete Fourier transform realization of the basic functions: to construct a CFourior class object. Platform: |
Size: 9216 |
Author:feierala |
Hits:
Description: 关于DFT的文章，应用FPGA实现傅立叶变换。-Abstract—We present a domain-specific approach to generate
high-performance hardware-software partitioned implementations
of the discrete Fourier transform (DFT). The partitioning
strategy is a heuristic based on the DFT’s divide-and-conquer
algorithmic structure and fine tuned by the feedback-driven
exploration of candidate designs. We have integrated this approach
in the Spiral linear-transform code-generation framework
to support push-button automatic implementation. We present
evaluations of hardware-software DFT implementations running
on the embedded PowerPC processor and the reconfigurable
fabric of the Xilinx Virtex-II Pro FPGA.
In our experiments, the 1D and 2D DFT’s FPGA-accelerated
libraries exhibit between 2 and 7.5 times higher performance
(operations per second) and up to 2.5 times better energy
efficiency (operations per Joule) than the software-only version. Platform: |
Size: 235520 |
Author:李然 |
Hits:
Description: The Fast Fourier Transform (FFT) is one of the
rudimentary operations in field of digital signal and image
processing. Some of the very vital applications of the fast
fourier transform include Signal analysis, Sound filtering, Data
compression, Partial differential equations, Multiplication of
large integers, Image filtering etc.Fast Fourier transform
(FFT) is an efficient implementation of the discrete Fourier
transform (DFT). This paper concentrates on the development
of the Fast Fourier Transform (FFT), based on Decimation-In-
Time (DIT) domain, Radix-2 algorithm, this paper uses VHDL
as a design entity, and their Synthesis by Xilinx Synthesis Tool
on Vertex kit has been done. The input of Fast Fourier
transform has been given by a PS2 KEYBOARD using a
testbench and output has been displayed using the waveforms
on the Xilinx Design Suite 12.1.The synthesis results show that
the computation for calculating the 32-point Fast Fourier
transform is efficient in terms of speed. Platform: |
Size: 305152 |
Author:doggaravi |
Hits:
Search - discrete-time Fourier transform vhdl