代码搜索：如何学习 FFt？
找到约 10,000 项符合「如何学习 FFt？」的源代码
代码结果 10,000
www.eeworm.com/read/277386/10642931
gel fft.gel
menuitem "FFT: 傅立叶变换控制"
dialog StartFFT(nParam1"Start FFT(1-Yes 0-No):")
{
m_uVideoStatus=nParam1;
}
www.eeworm.com/read/277216/10652788
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/277084/10670162
cpp fft.cpp
//$$ fft.cpp Fast fourier transform
// Copyright (C) 1991,2,3,4,8: R B Davies
#define WANT_MATH
// #define WANT_STREAM
#include "include.h"
#include "newmatap.h"
www.eeworm.com/read/421976/10673443
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/351110/10679553
c fft.c
/*----------------------------------------------------------------------------
fft.c - fast Fourier transform and its inverse (both recursively)
Copyright (C) 2004, Jerome R. Breitenbach. All
www.eeworm.com/read/277006/10688800
pdf fft.pdf
www.eeworm.com/read/421781/10699235
c fft.c
#include "FFT.h"
void FFT(comp *data,int FFTn,int inverse)
{
comp u,w,t;
double temp1,temp2;
double pi;
int i,j,k,l,ip;
int le,le1,m;
pi=3.1415926f;
m=0;
www.eeworm.com/read/421781/10699252
h fft.h
#ifndef _FFT1_H_
#define _FFT1_H_
#include "Complex.h"
//========================================
//功能: 实现FFT
//输入: data[in][out]: 数据指针; FFTn[in]:FFT点数;
// inverse[in]:正反FFT标志位:1,正FFT;-1,逆
www.eeworm.com/read/159044/10699305
txt fft.txt
// fft -- a program to model a Fast Fourier Transform (FFT).
//
// Copyright (C) 2001 John Dalton
//
// This program is free software; you can redistribute it and/or modify
// it under the terms
www.eeworm.com/read/276771/10707677
h fft.h
#include
#include
#include
void FFT(float *X, float *Y)
{
int k, n; // integers for the loops
complex mult; // a complex number
float prod;