代码搜索：DSP FFT
找到约 10,000 项符合「DSP FFT」的源代码
代码结果 10,000
www.eeworm.com/read/162730/10278876
txt fft.txt
void FFT(double fr[], double fi[], int n, int flag)
{
int mp,arg,cntr,p1,p2;
int i,j,a,b,k;
double sign,pr,pi,harm,t;
double* ca=new double[n],*sa=new double[n];
j=0;
if(flag!=0)
{
s
www.eeworm.com/read/280774/10292660
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:
www.eeworm.com/read/162411/10307874
wks fft.wks
www.eeworm.com/read/162159/10331674
asm fft.asm
******************************************************************
*** N(8-1024) points FFT Program ***
****************************************************************
www.eeworm.com/read/162159/10331706
cmd fft.cmd
fft.obj
-o fft.out
-m fft.map
-e start
MEMORY
{
PAGE 0:
EPROM: org=0E000h, len=1000h
VECS : org=0FF80h, len=0080h
PAGE 1:
SPRAM: org=0060h, len=0020h
www.eeworm.com/read/162091/10336283
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/425498/10350864
c fft.c
/*
*
* FFT.c
*
* Based on FFT.cpp from Audacity, which contained the following text:
*
* This file contains a few FFT routines, including a real-FFT
* routine that is almost twice as fa
www.eeworm.com/read/279847/10383498
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/424842/10407425
obj fft.obj
www.eeworm.com/read/424842/10407449