mirror/kissfft
1
0
Fork 0
mirror of https://github.com/mborgerding/kissfft.git synced 2025-06-04 01:28:23 -04:00
Code Issues Packages Projects Releases Wiki Activity

the path I was taking would only work for prime numbers (Galois fields)

Browse Source
This commit is contained in:
Mark Borgerding 2003-11-08 01:42:15 +00:00
parent e98f9ff29a
commit bd23fe8d23
1 changed files with 20 additions and 53 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

73
kiss_fft.c
View File

@ -287,63 +287,32 @@ void bfly_generic(
int p int p
) )
{ {
int u,q,d,fsm,halfp,mp,uf; int u,k,q1,q;
kiss_fft_cpx * scratch = st->scratch; kiss_fft_cpx * scratch = st->scratch;
kiss_fft_cpx * scratch2 = scratch + p; kiss_fft_cpx * twiddles = st->twiddles;
kiss_fft_cpx * tw = st->twiddles; kiss_fft_cpx t;
kiss_fft_cpx tlo,t3,t4; int Norig = st->nfft;
kiss_fft_cpx *Foutlo,*Fouthi;
fsm = fstride*m;
halfp=p/2;
mp=m*p;
for ( q=1; q<p ; ++q ) {
int twidx = q*fsm;
for ( d=1; d<=halfp;++d) {
tlo = tw[ twidx];
twidx += d*fsm;
if (twidx >= st->nfft)
twidx -= st->nfft;
*scratch2++ = tlo;
}
}
for ( u=0; u<m; ++u ) { for ( u=0; u<m; ++u ) {
scratch[0] = Fout[0]; k=u;
scratch2 = scratch + p; for ( q1=0 ; q1<p ; ++q1 ) {
uf=u*fstride; scratch[q1] = Fout[ k ];
C_FIXDIV(scratch[q1],p);
Foutlo=Fout; k += m;
for ( q=1 ; q<p ; ++q ) {
Foutlo += m;
C_MUL( scratch[q] , *Foutlo , tw[uf*q] );
*Foutlo = scratch[0];
} }
for ( q=1; q<p ; ++q ) { k=u;
C_ADDTO(*Fout , scratch[q] ); for ( q1=0 ; q1<p ; ++q1 ) {
Foutlo=Fout+m; int twidx=0;
Fouthi=Fout+mp; Fout[ k ] = scratch[0];
for (q=1;q<p;++q ) {
do{ twidx += fstride * k;
tlo = *scratch2++; if (twidx>=Norig) twidx-=Norig;
C_MUL(t,scratch[q] , twiddles[twidx] );
t3.r = scratch[q].r * tlo.r; C_ADDTO( Fout[ k ] ,t);
t3.i = scratch[q].r * tlo.i; }
t4.r = scratch[q].i * tlo.i; k += m;
t4.i = - scratch[q].i * tlo.r;
Fouthi -= m;
Foutlo->r += t3.r - t4.r;
Foutlo->i += t3.i - t4.i;
Fouthi->r += t3.r + t4.r;
Fouthi->i -= t3.i + t4.i;
}while( (Foutlo += m) < Fouthi );
} }
++Fout;
} }
} }
@ -369,9 +338,7 @@ void fft_work(
switch (p) { switch (p) {
case 2: bfly2(Fout,fstride,st,m); break; case 2: bfly2(Fout,fstride,st,m); break;
#if 1
case 3: bfly3(Fout,fstride,st,m); break; case 3: bfly3(Fout,fstride,st,m); break;
#endif
case 4: bfly4(Fout,fstride,st,m); break; case 4: bfly4(Fout,fstride,st,m); break;
case 5: bfly5(Fout,fstride,st,m); break; case 5: bfly5(Fout,fstride,st,m); break;
default: bfly_generic(Fout,fstride,st,m,p); break; default: bfly_generic(Fout,fstride,st,m,p); break;