代码搜索：matlab fft
找到约 10,000 项符合「matlab fft」的源代码
代码结果 10,000
www.eeworm.com/read/169808/9837375
mak fft.mak
# Generated by the VisualDSP++ IDDE
# Note: Any changes made to this Makefile will be lost the next time the
# matching project file is loaded into the IDDE. If you wish to preserve
# changes,
www.eeworm.com/read/169808/9837376
pcf fft.pcf
www.eeworm.com/read/169721/9845120
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/169666/9847006
cpp fft.cpp
#include "dip.h"
void TDipWindow::add(COMPLEX *a,COMPLEX *b,COMPLEX *ret)
{
ret->re = a->re + b->re;
ret->im = a->im + b->im;
}
void TDipWindow::sub(COMPLEX *a,COMPLEX *b,COMPLEX *ret)
{
www.eeworm.com/read/365533/9857997
cpp fft.cpp
/**********************************************************************
FFT.cpp
Dominic Mazzoni
September 2000
This file contains a few FFT routines, including a real-FFT
routine that is
www.eeworm.com/read/365533/9858004
h fft.h
/**********************************************************************
FFT.h
Dominic Mazzoni
September 2000
This file contains a few FFT routines, including a real-FFT
routine that is a
www.eeworm.com/read/365056/9880410
doc fft算法.doc
www.eeworm.com/read/365033/9880947
obj fft.obj
www.eeworm.com/read/169081/9881558
py fft.py
#!/usr/bin/env python2.3
import math
import sys
import random
pi=math.pi
e=math.e
j=complex(0,1)
def fft(f,inv):
n=len(f)
if n==1:
return f
for p in 2,3,5:
if n%p==0: