Description: 针对高速数字信号处理的要求,提出用FPGA 实现基- 4FFT 算法,并对其整体结构、蝶形单
元进行了分析. 采用蝶算单元输入并行结构和同址运算,能同时提供蝶形运算所需的4 个操作
数,具有最大的数据并行性,能提高处理速度 按照旋转因子存放规则,蝶形运算所需的3 个旋转
因子地址相同,且寻址方式简单 输出采取与输入相似的存储器 运算单元同时采用3 个乘法的
复数运算算法来实现.-In accordance with the requirements of high speed digital signal processing , the algorithmof radix
O4 implemented with FPGA and the integrated architecture and butterfly unit are analyzed. With butterfly u2
nit input which is designed by parallel structure and the same address calculation , four operation codes the
butterfly unit needs can be provided simultaneously to have the most data parallel and improve the speed of
calculation. According to the rotation parameters memory regulation , the addresses of three rotation parame2
ters of butterfly unit are the same with simple style of address generation and similar input and output memo2
ries. The operating unit adopted is implemented by three complex calculation algorithm of multiplication si2
multaneously. Platform: |
Size: 360448 |
Author:王晓 |
Hits:
Description: This paper shows the development of a 1024-point
radix-4 FFT VHDL core for applications in hardware signal processing, targeting low-cost FPGA technologies. The developed core is targeted into a Xilinx庐 Spartan鈩?3 XC3S200 FPGA with the inclusion of a VGA display interface and an external 16-bit data acquisition system for performance evaluation purposes. Several tests were performed in order to verify FFT core functionality, besides the time performance analysis highlights the core advantages over commercially available DSPs and Pentium-based PCs. The core is compared with similar third party IP cores targeting resourceful FPGA technologies. The novelty of this work is to provide a lowcost, resource efficient core for spectrum analysis
applications. Platform: |
Size: 456704 |
Author:alex |
Hits:
Description: VLSI implementation of high speed and high resolution FFT algorithm based on Radix 2 for DSP application Platform: |
Size: 247808 |
Author:bonjour |
Hits:
Description: 一个 16点 FFT 用基2蝶形运算单元完成,有测试环境。-16 points FFT with a radix-2 butterfly computation unit is completed and test environment. Platform: |
Size: 21504 |
Author:wei |
Hits:
Description: This book is ERICSSON documentation "FFT, REALIZATION AND IMPLEMENTATION IN FPGA".
Book includes some theoretical information about FFT Radix-2 and Radix-4, and also VHDL and Matlab code. Platform: |
Size: 297984 |
Author:Anta |
Hits:
Description: CFFT is a radix-4 fast Fourier transform (FFT) core with configurable data width and
a configurable number of sample points in the FFT.
Twiddle factors are implemented using the CORDIC algorithm, causing the gain of the
CFFT core to be different from the standard FFT algorithm. This variation in gain
is not important for orthogonal frequency division modulation (OFDM) and demodulation.
The gain can be corrected, to that of a conventional FFT, by applying a constant
multiplying factor.
Platform: |
Size: 183296 |
Author:Nagendran |
Hits:
Description: The VHDL implementation of 8-point FFT in VHDL. Radix 2 Decimation in Frequency-The VHDL implementation of 8-point FFT in VHDL. Radix 2 Decimation in Frequency
It is very good Platform: |
Size: 64512 |
Author:小鸟动人 |
Hits:
Description: The VHDL implementation of 8-point FFT in VHDL. Radix 2 Decimation in Frequency-The VHDL implementation of 64-point FFT in VHDL. Radix 2 Decimation in Frequency
i am found of it.It s really very good! Platform: |
Size: 31744 |
Author:小鸟动人 |
Hits:
Description: Implementing the Radix-4 Decimation
in Frequency (DIF) Fast Fourier
Transform (FFT) Algorithm Using a
TMS320C80 DSP Platform: |
Size: 150528 |
Author:seojinwon |
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: