搜索资源列表
verilog fft_64_12
- radix-4,利用cordic算法实现复乘单元
MultiSort
- Merge, Insertion, Radix, Heap, Bucket, Quick, Counting排序算法-Sort Algorithm about Merge, Insertion, Radix, Heap, Bucket, Quick, Counting
Blackfin_FftDct General algorithms for Radix-2 and
- 用于数字信号处理快速傅立叶变换的程序--Program for quick Fourier conversion in handling digital signals.
fft_基2基4_2d3d
- 基2基4的2d、3d的fft快速算法，代码写的很规范，效率很高。-Radix-2-4 of the 2d, 3d of fft fast algorithm, code written in a very standardized, high efficiency.
fft_基2基4基8
- 基2基4基8以及分裂基的fft算法，代码效率很高。是难得一见的好代码。应用范围很广。-Radix-2-4-based 8 and split fft-based algorithm, a high code efficiency. Is a rare good code. Application of a very wide scope.
Floating-point-complex-radix-2-decimation-in-time-
- 浮点复数基2时分FFT完成适当的FFT，输出改写输入缓冲器。-floating-point complex FFT-based two hours to complete the FFT output rewritten input buffer.
c32
- GENERIC PROGRAM FOR A FAST LOOPED-CODE RADIX-2 DIT FFT-GENERIC PROGRAM FOR A FAST LOOPED-CODE RAD IX-2 DIT FFT
fix_fft
- 定点基2FFT，并且具有将定点FFT与浮点FFT比对的功能-sentinel radix 2 FFT, and will be positioned with floating-point FFT and FFT functions to the
all_Radix_FFT
- 此程式具有三种FFT演算法,分别是radix-2 radix-4 radix-8,可选择其中一种演算法,接着输入FFT点数,程式就会执行FFT/IFFT,可以藉此知道是否正确-This program has three FFT algorithms are radix-2 radix-4 radix-8, can choose one algorithm, and then enter the FFT points, the prog
MRELFFT
- 利用分裂基算法求实序列的DFT,虚部赋值为零,这些程序是用C来实现的-Split-radix algorithm for the use of realistic sequence of DFT, the imaginary part of the assignment of zero, these procedures are used to achieve the C
myfft2
- 改写的fft基２的算法，压缩包中含有data数据，程序中直接调用。-Rewrite the fft radix-2 algorithm, compressed packet data contains data, the procedure call directly.
C_fft_code
- 该程序是用C写的FFT的程序，适用于基2任意点数计算复利也变换，经过测试，结果正确。-The program is written in C using FFT procedures, applicable to arbitrary point radix-2 calculation of compound interest also transform, tested and the results correctly.
MCMPFFT
- 利用经典的Cooley-Tukey基2算法求复序列x（n）的DFT X（k）-Use of the classic Cooley-Tukey radix-2 algorithm for complex sequence x (n) of the DFT X (k)
fft_radix2
- 用FFT 计算离散傅里叶变化，时间抽取（DIT）基2算法。-Calculated using FFT Discrete Fourier changes, the time taken (DIT) radix-2 algorithm.
FFT
- FFT算法应用与C6000系列，基2算法。需要使用CCS-FFT algorithm application and C6000 series, radix-2 algorithm. Need to use the CCS
FFT
- 基于dsp的fft算法，是基2按时间抽取快速fft，对于想熟悉fft算法的朋友很有帮助-Based on the dsp of the fft algorithm, is extracted by time radix-2 fast fft, for want of a friend familiar with the fft algorithm helpful
fft
- FFT算法的基本原理是把长序列的DFT逐次分解为较短序列的DFT。按照抽取方式的不同可分为DIT-FFT（按时间抽取）和DIF-FFT（按频率抽取）算法。按照蝶形运算的构成不同可分为基2、基4、基8以及任意因子（2n,n为大于1的整数），基2、基4算法较为常用。-FFT algorithm is the basic principle of DFT successive long sequence is broken down into
fft
- 基2快速傅立叶变换 库里-图基算法 基2快速傅立叶变换 库里-图基算法-Radix-2 FFT Cooley-Tukey algorithm
cf_fft
- FFT using C and VHDL. can compute upto 1K, 2K and 4K in radix 2.
FFT_r2
- Radix 2 DIF FFT function for TMS320C6713 made by asura and general fucntion