搜索资源列表
FPGA_4FFT
- 针对高速数字信号处理的要求,提出用FPGA 实现基- 4FFT 算法,并对其整体结构、蝶形单 元进行了分析. 采用蝶算单元输入并行结构和同址运算,能同时提供蝶形运算所需的4 个操作 数,具有最大的数据并行性,能提高处理速度 按照旋转因子存放规则,蝶形运算所需的3 个旋转 因子地址相同,且寻址方式简单 输出采取与输入相似的存储器 运算单元同时采用3 个乘法的 复数运算算法来实现.-In accordance with the requirements of high speed d
Impulse_fft_hw
- ImpulseC Codeveloper fft code. This file implements the hardware portion of a 256 sample FFT using a radix-4 algorithm. This implementation demonstrates that results similar to hand-coded HDL can be achieved using the C language, and without using
RADIXponint
- radix 64 point pipeline fft.in the field of fpga design
RADIX_64
- radix 64 point fft using vhdl design in fpga
FFTRadix235
- a radix-2,3 and 5 FFT, hopefully this is new and helpful :)
radix2
- fft The radix-2 algorithms are the simplest FFT algorithms. The decimation-in-time (DIT) radix-2 FFT recursively partitions a DFT into two half-length DFTs of the even-indexed and odd-indexed time samples. The outputs of these shorter FFTs ar
DIT-radix-2
- decimation in time radix-2 fft document in pdf containing source code in c language
FFT-to-C
- FFT 变换，C源代码。FFT C source code (Simple radix-2)-FFT transform, C source code. FFT C source code (Simple radix-2).
V3I8-0555
- Implementation of radix-2 FFT
proposed_16
- FFT 4 stage radix 2 A fast Fourier transform is an algorithm to compute the discrete Fourier transform and its inverse. A Fourier transform converts time to frequency and vice versa-FFT 4 stage radix 2 A fast Fourier transform is an algorithm to com
Radix-2
- here it gives the 8 point radix 2 fft algorithm
latch
- Abstract—Power is becoming a precious resource in modern VLSI design, even more so than area. This paper proposes a novel architecture for modular, scalable &reusable hybrid constant co-efficient multiplier (KCM) circuit. Comparison is made b
fftr4-16p
- radix 4 fft 16 point
06118316
- Pipelined Radix- Feedforward FFT Architectures