代码搜索：FFt 有哪些应用？
找到约 10,000 项符合「FFt 有哪些应用？」的源代码
代码结果 10,000
www.eeworm.com/read/387090/8707564
c fft.c
/**********************************************************
// 函数名: 快速傅立叶变换（来源《C常用算法集》）
// 本函数测试OK,可以在TC2.0,VC++6.0,Keil C51测试通过。
// 如果你的MCS51系统有足够的RAM时,可以验证一下用单片机处理FFT有多么的慢。
//
// 入口参数：
// l:
www.eeworm.com/read/286954/8735325
c fft.c
#include
#include
#include
#define PI 3.14159265358979323846
struct COMPLEX
{
float re;
float im;
} cplx , * Hfield , * S , * R , * w;
www.eeworm.com/read/430124/8765059
c fft.c
#include "FFT.h"
#include
#include
void InitializePoly(poly* p, int m, int* co)
{
int i;
p->MaxExp = m;
p->Coefficient = (int*)malloc(sizeof(int) * (m + 1));
for(i
www.eeworm.com/read/430124/8765064
h fft.h
#define PI 3.141592653589793238
typedef struct POLYNOMAIL
{
int MaxExp;
int* Coefficient;
}poly;
typedef struct COMPLEX_NUMBER
{
double real;
double imagine;
}MyComplex;
void In
www.eeworm.com/read/385934/8778209
c fft.c
//FFT.c C callable FFT function in C
#define PTS 256 //# of points for FFT
typedef struct {float real,imag;} COMPLEX;
extern COMPLEX w[PTS]; //twiddle constants stored in w
v
www.eeworm.com/read/385714/8791415
c fft.c
/**
* FFT(IFFT) - Fast Fourier transform. The length of X must be a
* power of two, for a fast radix-2 fast-Fourier transform algorithm
* is used. spadger@bmy 2007.9.2
www.eeworm.com/read/385428/8805723
pjt fft.pjt
; Code Composer Project File, Version 2.0 (do not modify or remove this line)
[Project Settings]
ProjectName="evm5409_test1"
ProjectDir="F:\EVM-JXXY2\FFT\"
ProjectType=Executable
CPUFamily=TMS3
www.eeworm.com/read/385428/8805730
map fft.map
******************************************************************************
TMS320C54x COFF Linker PC Version 3.83
*******************************************************
www.eeworm.com/read/385428/8805735
paf fft.paf
www.eeworm.com/read/385428/8805747
asm fft.asm
.title "FFT.asm"
.mmregs
.global _MFFT
.text
sine1: .sect "sine1"
.word 0 ,201 ,402 ,603
.word 804 ,1005 ,1205 ,1407
.word 1607 ,1808 ,2009 ,