Mark Borgerding
|
25e377eaa8
|
fast conv filtering small edits
2d files no longer needed with kiss_fftnd
|
2004-01-24 01:34:01 +00:00 |
|
Mark Borgerding
|
227c021f39
|
extra cleanup
|
2004-01-04 23:15:44 +00:00 |
|
Mark Borgerding
|
c80f0cafb7
|
test code for avoiding buffer copies of output in fast conv filtering
|
2004-01-04 06:32:25 +00:00 |
|
Mark Borgerding
|
e749a114cb
|
real fast convolution filtering works mostly, sometimes it does not
make all the samples ( obeserved with ./fastfir.py -n 1024 -r -l 100000 )
|
2004-01-01 18:51:17 +00:00 |
|
Mark Borgerding
|
0243552944
|
fast convolution filtering works at least for complex numbers.
|
2003-12-31 22:49:14 +00:00 |
|
Mark Borgerding
|
212ec326e0
|
prototype code for fast convolution filtering
|
2003-12-31 04:06:24 +00:00 |
|
Mark Borgerding
|
ec3b64a62e
|
added test code for kiss_fftnd
FFTs can now have an arbitrary # of dimensions
Also, buffer copies are eliminated.
|
2003-12-30 05:56:50 +00:00 |
|
Mark Borgerding
|
377ac796f0
|
streamlined
|
2003-12-30 03:08:56 +00:00 |
|
Mark Borgerding
|
22ff70b71d
|
n-dimensional FFT works
|
2003-12-30 02:50:45 +00:00 |
|
Mark Borgerding
|
5e6199c868
|
no real change
|
2003-12-30 00:09:50 +00:00 |
|
Mark Borgerding
|
62ecf69446
|
added prototyping for N-dimensional FFT
|
2003-12-29 23:05:45 +00:00 |
|
Mark Borgerding
|
10a4a5c46b
|
2d fft now uses kiss_fft_stride to avoid buffer copies.
|
2003-12-29 21:07:19 +00:00 |
|
Mark Borgerding
|
4552a14801
|
added stride to fft input -- should simplify multi-dimensional FFTs
|
2003-12-29 18:50:13 +00:00 |
|
Mark Borgerding
|
630089ded6
|
kfc works
|
2003-12-29 16:46:27 +00:00 |
|
Mark Borgerding
|
cd94cd1ed0
|
testing kfc (kiss fft cache)
|
2003-12-29 16:38:03 +00:00 |
|
Mark Borgerding
|
0bd304429d
|
file to cache fft cfg objects for ease of use.
|
2003-12-26 03:59:46 +00:00 |
|
Mark Borgerding
|
f4961ed74b
|
fixed a bug with nfft==1
and added utility for more testing
|
2003-12-16 03:43:05 +00:00 |
|
Mark Borgerding
|
95a7b856d1
|
compiles OK under MAC OS X
|
2003-12-15 03:53:14 +00:00 |
|
Mark Borgerding
|
6b23ebb5c1
|
getting ready for v100
|
2003-12-15 03:23:46 +00:00 |
|
Mark Borgerding
|
573536f48f
|
fixed scaling for short real
moved fft.py from ./ to sample_code
|
2003-12-14 05:13:11 +00:00 |
|
Mark Borgerding
|
559c14b49b
|
changed alloc functions to allow for initialization of user-supplied buffer
|
2003-12-14 03:02:30 +00:00 |
|
Mark Borgerding
|
ab32979a47
|
*** empty log message ***
|
2003-12-11 01:56:18 +00:00 |
|
Mark Borgerding
|
ef7f8ff6c0
|
getting ready to release version 1.0
|
2003-12-11 01:54:42 +00:00 |
|
Mark Borgerding
|
8a992d0e98
|
better, reduced mutliply in real fft
|
2003-12-10 05:48:42 +00:00 |
|
Mark Borgerding
|
b737756abb
|
real fwd and rev fft works
|
2003-12-09 04:10:50 +00:00 |
|
Mark Borgerding
|
db56a8b1e2
|
little better, faster
|
2003-12-09 01:19:08 +00:00 |
|
Mark Borgerding
|
09dbf36e97
|
kiss_fftr.c gives correct answers for forward
|
2003-12-07 04:04:27 +00:00 |
|
Mark Borgerding
|
c2eaab8606
|
*** empty log message ***
|
2003-12-05 03:51:33 +00:00 |
|
Mark Borgerding
|
aaa04d9b60
|
script to make test vectors using Python and the FFT module
|
2003-12-05 03:40:53 +00:00 |
|
Mark Borgerding
|
39d2974fe3
|
'make snr' now tests 2d ffts
|
2003-12-04 04:08:52 +00:00 |
|
Mark Borgerding
|
f3c4a9e9ca
|
internal checkpoint
split kiss_fft.c into multiple files. It seems the best approach, all things considered.
|
2003-12-04 02:38:50 +00:00 |
|
Mark Borgerding
|
206e28f11c
|
made the factorization a separate routine
|
2003-11-12 01:09:35 +00:00 |
|
Mark Borgerding
|
140f106743
|
benchmark utilities now give memory info
|
2003-11-08 02:48:02 +00:00 |
|
Mark Borgerding
|
e9095a161c
|
generic butterfly slightly slower -- hmmm
|
2003-11-07 02:39:49 +00:00 |
|
Mark Borgerding
|
ee3094a0e4
|
benchmark utilities
|
2003-11-04 02:11:00 +00:00 |
|
Mark Borgerding
|
4ebf0b5aca
|
aded a CHANGELOG
|
2003-11-04 02:09:53 +00:00 |
|
Mark Borgerding
|
6c8049cc75
|
slight changes to Makefile
|
2003-11-04 01:01:37 +00:00 |
|
Mark Borgerding
|
3c0c0431e2
|
radix 5 works, but is 6x slower than fftw
|
2003-11-03 03:03:16 +00:00 |
|
Mark Borgerding
|
8ac63adc77
|
modified time benchmark to repeat same buffer over and over to avoid IO bottlenecks and get more consistent numbers.
|
2003-11-01 04:44:50 +00:00 |
|
Mark Borgerding
|
28551899e2
|
radix 4 faster
|
2003-11-01 03:49:53 +00:00 |
|
Mark Borgerding
|
d4f87befda
|
re-added radix 3 butterfly
|
2003-10-30 02:02:29 +00:00 |
|
Mark Borgerding
|
ca4c74e07c
|
Woops, one should not test with input of all zeros
|
2003-10-29 04:29:01 +00:00 |
|
Mark Borgerding
|
1db3d91ee5
|
getting ready for next release
|
2003-10-26 04:07:32 +00:00 |
|
Mark Borgerding
|
bca7fd5151
|
compiles with -ansi -pedantic
|
2003-10-18 01:23:34 +00:00 |
|
Mark Borgerding
|
6f8bcedc24
|
radix 3 fixed point still broken
|
2003-10-17 02:59:32 +00:00 |
|
Mark Borgerding
|
317f11e66e
|
starting point for radix 3
'make test' output
### testing SNR for 2187 point FFTs
#### DOUBLE
snr_t2f = 292.51
snr_f2t = 304.97
#### FLOAT
snr_t2f = 143.46
snr_f2t = 138.03
#### SHORT
snr_t2f = 49.257
snr_f2t = 16.294
#### timing 10000 x 2187 point FFTs
#### DOUBLE
Elapsed:0:05.05 user:3.60 sys:0.54
#### FLOAT
Elapsed:0:02.41 user:1.85 sys:0.23
#### SHORT
Elapsed:0:04.02 user:3.13 sys:0.08
|
2003-10-17 00:11:19 +00:00 |
|
Mark Borgerding
|
c9ff98b2c9
|
pick the peak frequency from a stereo input
|
2003-08-14 00:48:51 +00:00 |
|
Mark Borgerding
|
4add8dbbb6
|
simplified testing
|
2003-08-13 01:54:58 +00:00 |
|
Mark Borgerding
|
1cd00ce9f5
|
simplified testing (hopefully)
|
2003-08-13 01:54:21 +00:00 |
|
Mark Borgerding
|
b095bec02d
|
NFFT is configurable
|
2003-08-12 23:28:01 +00:00 |
|