Location:
Search - fft 128
Search list
Description: 128点DIT FFT,能实现128点的快速傅里叶变换，对在校的大学生学习，试验很有帮助！-DIT FFT 128 points, 128 points to achieve the fast Fourier transform, to the college students study, test helpful!
Platform: |
Size: 1059 |
Author: 王京 |
Hits:
Description: 本人因项目开发需要（基于dsp2812），根据FFT算法原理，用C自编了个FFT程序，可进行64点，128点，256点FFT运算，只要输入对应的参数便可，使用方便灵活！强烈推荐
Platform: |
Size: 1262 |
Author: liuwenye_1 |
Hits:
Description: 利用汇编语言和TMS320F2812芯片实现FFT的算法，该算法对128点和256点很有效，使用过程中要考虑信号值不能太小
Platform: |
Size: 24248 |
Author: yang196 |
Hits:
Description: 128点DIT FFT,能实现128点的快速傅里叶变换，对在校的大学生学习，试验很有帮助！-DIT FFT 128 points, 128 points to achieve the fast Fourier transform, to the college students study, test helpful!
Platform: |
Size: 1024 |
Author: 王京 |
Hits:
Description: 利用汇编语言和TMS320F2812芯片实现FFT的算法，该算法对128点和256点很有效，使用过程中要考虑信号值不能太小-use of assembly language and TMS320F2812 chip FFT algorithm for 128 points and 256 points very effective, the process used to be considered too small signal value can not
Platform: |
Size: 1024 |
Author: 王乾坤 |
Hits:
Description: 傅立叶变换的c语言源代码
128点DIT FFT函数：
/* 采样来的数据放在dataR[ ]数组中，运算前dataI[ ]数组初始化为0 */
void FFT(float dataR[],float dataI[])
-Fourier Transform c language source code DIT 128 point FFT function :/* Sample data on the dataR [] array, Operational before dataI [] array initialization to 0*/void FFT (float dataR [], float dataI [])
Platform: |
Size: 3072 |
Author: 郑超 |
Hits:
Description: F2812 标准FFT算法,128点,256点,512点,1024点FFT算法,具体做法为将库含数FFT.LIB加入的目标项目,加入对应的C含数和头文件,特别注意的FFT算法缓冲去一定要存放在0X8000H中的内部缓冲区中!!!切记,本人调试时就走了很多弯路啊-F2812 standard FFT algorithm, 128, 256, 512, 1024-point FFT algorithm, the specific approach to the library will join with several FFT.LIB goals, joined counterparts with the number of C header files, pay special attention to the FFT algorithm to buffer must 0X8000H stored in the internal buffer! ! ! remember, I debug away many detours ah
Platform: |
Size: 23552 |
Author: 孙玉海 |
Hits:
Description: 128点fft的IP核vhdl源代码，另有其控制代码。-128 point fft s IP core VHDL source code, while its control code.
Platform: |
Size: 7168 |
Author: 戈立军 |
Hits:
Description: 用VC编写的一个128点的快速傅里叶变换（FFT）算法。-VC prepared using a 128-point fast Fourier transform (FFT) algorithm.
Platform: |
Size: 33792 |
Author: 欧欧 |
Hits:
Description: 单片机能实现的FFT算法。128点快速傅氏变换-Single-chip to realize the FFT algorithm. 128-point fast Fourier transform
Platform: |
Size: 2048 |
Author: 王伟刚 |
Hits:
Description: FFT子程序，用于AVR单片机上，为7级128点的FFT-FFT Subroutine for AVR Single Chip, for the seven 128-point FFT
Platform: |
Size: 1024 |
Author: 张海增 |
Hits:
Description: 用c实现FFT算法，通过修改该程序可实现32点，64点，128点的FFT运算-With c realize FFT algorithm, by modifying the program to achieve 32 points, 64 points, 128 points FFT computation
Platform: |
Size: 14336 |
Author: xiuxiu |
Hits:
Description: // 入口参数：
// l: l = 0, 傅立叶变换 l = 1, 逆傅立叶变换
// il: il = 0,不计算傅立叶变换或逆变换模和幅角；il = 1,计算模和幅角
// n: 输入的点数，为偶数，一般为32，64，128，...,1024等
// k: 满足n=2^k(k>0),实质上k是n个采样数据可以分解为偶次幂和奇次幂的次数
// pr[]: l=0时，存放N点采样数据的实部
// l=1时, 存放傅立叶变换的N个实部
// pi[]: l=0时，存放N点采样数据的虚部
// l=1时, 存放傅立叶变换的N个虚部
//
// 出口参数：
// fr[]: l=0, 返回傅立叶变换的实部
// l=1, 返回逆傅立叶变换的实部
// fi[]: l=0, 返回傅立叶变换的虚部
// l=1, 返回逆傅立叶变换的虚部
// pr[]: il = 1,i = 0 时，返回傅立叶变换的模
// il = 1,i = 1 时，返回逆傅立叶变换的模
// pi[]: il = 1,i = 0 时，返回傅立叶变换的辐角
// il = 1,i = 1 时，返回逆傅立叶变换的辐角-err
Platform: |
Size: 1024 |
Author: bluefeifei |
Hits:
Description: 在proteus下仿真的FFT试验！！！所得出的频谱波形在LCD12864 上显示-Under the simulation in Proteus FFT test! ! ! The resulting spectrum waveform shown in LCD12864
Platform: |
Size: 23552 |
Author: 左仪 |
Hits:
Description: for(k=j k<128 k=k+2*b) /* for (3) */
{ TR=dataR[k] TI=dataI[k] temp=dataR[k+b]
dataR[k]=dataR[k]+dataR[k+b]*cos_tab[p]+dataI[k+b]*sin_tab[p]
dataI[k]=dataI[k]-dataR[k+b]*sin_tab[p]+dataI[k+b]*cos_tab[p]
dataR[k+b]=TR-dataR[k+b]*cos_tab[p]-dataI[k+b]*sin_tab[p]
dataI[k+b]=TI+temp*sin_tab[p]-dataI[k+b]*cos_tab[p]
} -fft
Platform: |
Size: 1024 |
Author: wangqikun |
Hits:
Description: FFT算法实现
Radix2 可以计算 4，8，16，32, 64，128, 256....点FFT
Radix4 可以计算 4，16, 64, 256, 1024...点FFT
FFT_DIT_general.c 实现了 Radix2 和Radix4 的配合使用，可以计算Radix2可以计算的所有FFT，但效率比Radix2高。-FFT can be calculated Radix2 algorithm 4,8,16,32, 64,128, 256 .... can calculate the FFT Radix4 points 4,16, 64, 256, 1024-point FFT FFT_DIT_general.c ... Radix2 and Radix4 achieved with the use of Radix2 can calculate can calculate all the FFT, but Radix2 high efficiency.
Platform: |
Size: 2048 |
Author: liuxiaoxiao |
Hits:
Description: FFT,128,256,512,1024点均可以-FFT, 128,256,512,1024 points can be
Platform: |
Size: 931840 |
Author: laozhiguai |
Hits:
Description: 电子设计大赛中430写的FFT变换程序，总共128个点，如果需要更多的点可自己设定-Electronic Design Competition FFT transformation process 430 to write a total of 128 points, if you need more points to set their own
Platform: |
Size: 78848 |
Author: 陈俊涵 |
Hits:
Description: vhdl code and verilog code for an 128 point fft processor which has to be executed in xlinx software as needed for course project
Platform: |
Size: 364544 |
Author: tejaswini |
Hits:
Description: c语言编写的求1,2,4,8,16,32,64,128,256,512,1024,2048点fft 通用程序-c language of the general program requirements 1,2,4,8,16,32,64,128,256,512,1024,2048 point fft
Platform: |
Size: 15360 |
Author: ws |
Hits: