faster FFT's for prime numbers and real-complex
Showing
- FFTlib/Makefile 1 addition, 0 deletionsFFTlib/Makefile
- FFTlib/genfft.h 1 addition, 1 deletionFFTlib/genfft.h
- FFTlib/kiss_fft.c 405 additions, 0 deletionsFFTlib/kiss_fft.c
- FFTlib/kiss_fft.h 262 additions, 0 deletionsFFTlib/kiss_fft.h
- FFTlib/lib_fft.c 120 additions, 74 deletionsFFTlib/lib_fft.c
- FFTlib/test/Makefile 9 additions, 2 deletionsFFTlib/test/Makefile
- FFTlib/test/cc1loop.c 69 additions, 0 deletionsFFTlib/test/cc1loop.c
- FFTlib/test/rc1loop.c 98 additions, 0 deletionsFFTlib/test/rc1loop.c
- FFTlib/trigtbl.h 4 additions, 0 deletionsFFTlib/trigtbl.h
- extrap/demo/lens.scr 36 additions, 0 deletionsextrap/demo/lens.scr
- include/genfft.h 1 addition, 1 deletioninclude/genfft.h
Loading
Please register or sign in to comment