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
|
502211bc6a
|
broken
working towards mixed radix
decomposition seems to work (for 2)
indices scrambled
|
2003-08-16 23:40:14 +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 |
|
Mark Borgerding
|
a962dc2681
|
took utility/test code out of main source file and moved down to sample_code
|
2003-08-10 15:39:15 +00:00 |
|