搜索资源列表
eetop.cn_fft
- 采用全流水线结构,供初学者参考,附有仿真波形图,代码中上有可以改进之处,如蝶形单元中可以将4次乘法简化为3次乘法,不过要预先对旋转因子做处理,第一次上传,如有不妥之处,还请大家指正,谢谢。 -With full pipeline structure, reference for beginners, with a simulation waveform diagram, the code can be on improvement
fftcPP
- 实现FFT的C代码,适合初学者。全部用c语言编程。包含倒序、蝶形运算、数据保存等。 -Implement the FFT C code, suitable for beginners.
FFTbutter
- FFT的旋转因子算法和蝶形处理器VHDL代码实现-The rotation factor FFT butterfly processor algorithm and VHDL code
sim512fft
- 512点FFT程序,分10级蝶形运算完成。-512-point FFT program, sub-10 butterfly to complete.
buffterfly_radix4
- 16点的FFT蝶形运算,用于快速傅里叶变换并行实现,基于verilog语言编写,matlab仿真验证-a method based on 16-point fft butterfly,used to make fast fourier transform,language is verilog.
FFT
- FFT蝶形算法,程序中包含了原创的补零函数,简单的倒位序函数等依照按时间抽取对序列进行FFT计算.-FFT Butterfly operation
Digital-signal
- 给予蝶形运算及其他的数字信号处理课程设计-To give the butterfly and other digital signal processing course design
FFT
- 本程序为FFT的一个蝶形运算单元,输入位4位,输出8位,由于乘法器的原因,分实部与虚部,输出也为实部虚部,对其进行组合可实现FFT变换,其中乘法器为快速的列阵乘法器。-FFT butterfly unit, the input bit 4bit output 8bit, due to the multiplier, divided into real and imaginary parts, the output for the rea
FF
- fft变换 蝶形运算 快速傅立叶变换-discr iption of fft
CVViiterbio
- 卷积码viterbi译码的蝶形算法,能大大大减少卷积码viterbi译码的运算时间 -Viterbi decoding of convolutional codes butterfly algorithm viterbi decoding of convolutional codes, can greatly reduce the computation time
FFT-sources
- FFT快速傅里叶变换的代码及其流程图,里面含有蝶形算法以及倒序的所有源码。-the soucers of FFT
FFT
- 快速傅里叶变换,基四时间抽取快速FFT算法,蝶形运算-Fast Fourier Transform, the base four-time extraction of the fast FFT algorithm, the butterfly
fft
- 复数类,复数的加减乘除,线性卷积,FFT蝶形算法,bit reversal-Complex type, complex addition and subtraction, multiplication and division, linear convolution, FFT butterfly algorithm, bit reversal
DFTaFFT
- 离散傅立叶变换DFT源程序,包括时域离散化,求W算子表,原信号的时域描述和离散频域描述。以及快速傅立叶变换FFT源程序,里面有蝶形算法的循环步骤。适合初学者-Discrete Fourier Transform DFT source, including the time-domain discretization, find the W operator table, the original descr iption of the
CSharp
- 利用蝶形图进行的离数字信号时选和频选的快速傅立叶变换C#设计-design of FFT by C#
FFT
- FFT的经典实现,三重循环的蝶形运算,适合于硬件实现的软件版本,在Xilinx的Vivado仿真器下编译通过-Classic implementation of FFT software version is suitable for hardware implementation in Xilinx Vivado emulator compiled by
fft_describedByCLanguage
- 用C语言描述的快速傅里叶变换,与《算法导论》中描写的蝶形操作一致-C language descr iption of the fast Fourier transform, " Introduction to Algorithms" descr iption of the butterfly operation
FPGA-based-FFT-implementation
- 基于FPGA的FFT算法硬件实现 设计了一 种基于 FPGA 的 1 024点 16位 FFT算法, 采用了基 4蝶形算法和流水线处理方式, 提高了 系统 的处理速度, 改善了系统的性能 -FPGA-based FFT algorithm hardware design of a 1024 16-bit FPGA-based FFT algorithm using a radix-4 butterfly algorithm an
my8ditfft
- 基8-DFT计算,每8点为一蝶形运算单元,4096点计算效率较基2-DFT提高50 -Yl 8-DFT calculation, every 8 points for a butterfly operation unit, the 4096-point computation efficiency than the base 2-DFT increased by 50
fft_1
- matlab实现快速傅里叶变换的原始程序,有助于理解蝶形运算-matlab realize the fast Fourier transform of the original program, help to understand the butterfly operation