diff --git a/source/projects/fiddle_tilde/fft_mayer.proto.h b/source/projects/fiddle_tilde/fft_mayer.proto.h index af8a06e..4519978 100755 --- a/source/projects/fiddle_tilde/fft_mayer.proto.h +++ b/source/projects/fiddle_tilde/fft_mayer.proto.h @@ -1 +1 @@ -void fht(float *fz, int n); void ifft(int n, float *real, float *imag); void realfft(int n, float *real); void fft(int n, float *real, float *imag); void realifft(int n, float *real); \ No newline at end of file + void fht(float *fz, int n); void ifft(int n, float *real, float *imag); void realfft(int n, float *real); void fft(int n, float *real, float *imag); void realifft(int n, float *real); \ No newline at end of file diff --git a/source/projects/fiddle_tilde/trigtbl.h b/source/projects/fiddle_tilde/trigtbl.h index 99672c0..0149db4 100755 --- a/source/projects/fiddle_tilde/trigtbl.h +++ b/source/projects/fiddle_tilde/trigtbl.h @@ -1 +1 @@ -/* ** Please only distribute this with it's associated FHT routine. ** This algorithm is apparently patented(!) and the code copyrighted. ** See the comment with the fht routine for more info. ** -Thanks, ** Ron Mayer */ #ifdef REAL #else #define REAL double #endif #ifdef GOOD_TRIG #else #define FAST_TRIG #endif #if defined(GOOD_TRIG) #define FHT_SWAP(a,b,t) {(t)=(a);(a)=(b);(b)=(t);} #define TRIG_VARS \ int t_lam=0; #define TRIG_INIT(k,c,s) \ { \ int i; \ for (i=2 ; i<=k ; i++) \ {coswrk[i]=costab[i];sinwrk[i]=sintab[i];} \ t_lam = 0; \ c = 1; \ s = 0; \ } #define TRIG_NEXT(k,c,s) \ { \ int i,j; \ (t_lam)++; \ for (i=0 ; !((1<1) \ { \ for (j=k-i+2 ; (1<1) \ { \ for (j=k-i+2 ; (1<