Mark Borgerding
|
80eccb4e3c
|
Trying to decide what to do about real odd FFTs
|
2004-01-29 03:26:48 +00:00 |
|
Mark Borgerding
|
49a6ad07e0
|
little easier to understand (hoepfully)
|
2004-01-24 22:13:14 +00:00 |
|
Mark Borgerding
|
e335546c3e
|
fast conv filtering cleaner ifc
|
2004-01-24 04:25:19 +00:00 |
|
Mark Borgerding
|
5005a2a99d
|
mmap version
with flush
|
2004-01-24 03:32:21 +00:00 |
|
Mark Borgerding
|
58366b55ac
|
add mmapped version
|
2004-01-24 02:45:44 +00:00 |
|
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
|
ca97282da6
|
does no copy fast conv filtering
|
2004-01-24 00:46:30 +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
|
8ffc08b07b
|
slightly closer, still overflows in some cases
|
2004-01-02 22:28:03 +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
|
b468fd96d7
|
Added mucho comments.
|
2003-12-30 15:18:41 +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
|
604e238834
|
split kfc.c into source + header files. Added copyright.
|
2003-12-29 17:05: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
|
b880c599ef
|
optimizing
|
2003-12-10 05:20:21 +00:00 |
|
Mark Borgerding
|
b737756abb
|
real fwd and rev fft works
|
2003-12-09 04:10:50 +00:00 |
|
Mark Borgerding
|
14e9b0dce4
|
about to start working on real inverse fft optimzation
|
2003-12-09 01:51:29 +00:00 |
|
Mark Borgerding
|
008d7fd4ea
|
zero case optimized
|
2003-12-09 01:37:48 +00:00 |
|
Mark Borgerding
|
548032e305
|
real optimization
|
2003-12-09 01:25:47 +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
|
72de907478
|
minor doc changes
|
2003-12-05 00:35:25 +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
|
164ab47a25
|
*** empty log message ***
|
2003-11-14 04:20:19 +00:00 |
|
Mark Borgerding
|
63e7df14cf
|
fft prototype code for real fft works
|
2003-11-14 02:11:57 +00:00 |
|
Mark Borgerding
|
968e277f93
|
working on real optimization
|
2003-11-14 01:37:31 +00:00 |
|
Mark Borgerding
|
673c7bafa4
|
real_fft works
|
2003-11-12 02:49:04 +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
|
bd23fe8d23
|
the path I was taking would only work for prime numbers (Galois fields)
|
2003-11-08 01:42:15 +00:00 |
|
Mark Borgerding
|
e98f9ff29a
|
going to bed
|
2003-11-07 03:42:14 +00:00 |
|
Mark Borgerding
|
ae305ca400
|
slightly faster
|
2003-11-07 03:31:59 +00:00 |
|
Mark Borgerding
|
3a5791f203
|
slightly faster
|
2003-11-07 03:23:19 +00:00 |
|
Mark Borgerding
|
1486d89291
|
faster
|
2003-11-07 03:04:52 +00:00 |
|
Mark Borgerding
|
e9095a161c
|
generic butterfly slightly slower -- hmmm
|
2003-11-07 02:39:49 +00:00 |
|
Mark Borgerding
|
a296b09dbf
|
wrong alloc size
|
2003-11-07 01:06:44 +00:00 |
|
Mark Borgerding
|
cb5312efdc
|
2d fft seems to work
|
2003-11-06 03:59:31 +00:00 |
|
Mark Borgerding
|
4c458be5e9
|
checkpoint -- I don't think I've broken anything (yet) adding 2d fft.
|
2003-11-04 23:25: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
|
2788fba0bd
|
added a CHANGELOG
|
2003-11-04 02:09:48 +00:00 |
|
Mark Borgerding
|
8b4e3bacca
|
minor comments and added some primes
|
2003-11-04 02:00:01 +00:00 |
|
Mark Borgerding
|
6c8049cc75
|
slight changes to Makefile
|
2003-11-04 01:01:37 +00:00 |
|
Mark Borgerding
|
7b4de0aa11
|
a little faster
|
2003-11-03 04:30:50 +00:00 |
|
Mark Borgerding
|
ad4ee571aa
|
faster radix5
|
2003-11-03 04:04:01 +00:00 |
|
Mark Borgerding
|
0403fb3e4a
|
radix 5 a little optimized
|
2003-11-03 03:48:34 +00:00 |
|
Mark Borgerding
|
3c0c0431e2
|
radix 5 works, but is 6x slower than fftw
|
2003-11-03 03:03:16 +00:00 |
|
Mark Borgerding
|
85764e6437
|
radix 5 doesn't work, but I thik it should.
just a checkpoint commit
|
2003-11-01 16:48:33 +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
|
471803ca08
|
removed unused macro
|
2003-11-01 04:26:02 +00:00 |
|
Mark Borgerding
|
7b7aefe7c4
|
moved scratch buffer to stack variable
|
2003-11-01 03:59:43 +00:00 |
|
Mark Borgerding
|
28551899e2
|
radix 4 faster
|
2003-11-01 03:49:53 +00:00 |
|
Mark Borgerding
|
d1df249536
|
radix3 fixed point now works
|
2003-10-31 04:01:09 +00:00 |
|
Mark Borgerding
|
b1969544a6
|
radix 3 still doesn't work for fixed
|
2003-10-30 03:00:49 +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
|
97b18f3fef
|
comments
|
2003-10-27 04:02:11 +00:00 |
|
Mark Borgerding
|
d9fcda04b6
|
version 0.2 upload to sf
|
2003-10-26 19:29:36 +00:00 |
|
Mark Borgerding
|
ecb1a76974
|
added zip creation to tarball make target
|
2003-10-26 04:25:18 +00:00 |
|
Mark Borgerding
|
1db3d91ee5
|
getting ready for next release
|
2003-10-26 04:07:32 +00:00 |
|
Mark Borgerding
|
52b4b9ab5c
|
*** empty log message ***
|
2003-10-18 01:45:26 +00:00 |
|
Mark Borgerding
|
c239ba2c1c
|
slight code cleanup, comments
|
2003-10-18 01:39:36 +00:00 |
|
Mark Borgerding
|
bca7fd5151
|
compiles with -ansi -pedantic
|
2003-10-18 01:23:34 +00:00 |
|
Mark Borgerding
|
e2470b3a03
|
*** empty log message ***
|
2003-10-18 00:33:38 +00:00 |
|
Mark Borgerding
|
a3d3217ae6
|
*** empty log message ***
|
2003-10-18 00:32:54 +00:00 |
|
Mark Borgerding
|
6f8bcedc24
|
radix 3 fixed point still broken
|
2003-10-17 02:59:32 +00:00 |
|
Mark Borgerding
|
31d4214f44
|
radix 3 seems to be pretty fast
fixed point broken for some reason
|
2003-10-17 02:34:22 +00:00 |
|
Mark Borgerding
|
73744b908c
|
check point
fixed does not currently work for radix 3
|
2003-10-17 01:26:14 +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
|
d6ae498630
|
took the bitwise and out of the switch case -- may have prevented optimization
|
2003-10-15 03:45:24 +00:00 |
|
Mark Borgerding
|
5f0efe8f17
|
pretty happy with radix 2 and radix 4
next up is radix 3, or maybe 5
|
2003-10-15 03:38:05 +00:00 |
|
Mark Borgerding
|
9504aa79c1
|
Fixed generic mixed radix butterfly
'make test' output:
### testing SNR for 1024 point FFTs
#### DOUBLE
snr_t2f = 296.95
snr_f2t = 317.25
#### FLOAT
snr_t2f = 147.96
snr_f2t = 145.14
#### SHORT
snr_t2f = 52.414
snr_f2t = 22.438
#### timing 10000 x 1024 point FFTs
#### DOUBLE
Elapsed:0:03.56 user:2.63 sys:0.19
#### FLOAT
Elapsed:0:01.35 user:1.07 sys:0.10
#### SHORT
Elapsed:0:01.70 user:1.37 sys:0.06
|
2003-10-15 02:52:34 +00:00 |
|
Mark Borgerding
|
0424734e9d
|
radix 4 now about as fast as original version
'make test' output:
### testing SNR for 1024 point FFTs
#### DOUBLE
snr_t2f = 296.78
snr_f2t = 317.11
#### FLOAT
snr_t2f = 145.28
snr_f2t = 143.51
#### SHORT
snr_t2f = 52.409
snr_f2t = 22.174
#### timing 10000 x 1024 point FFTs
#### DOUBLE
Elapsed:0:03.43 user:2.68 sys:0.25
#### FLOAT
Elapsed:0:01.39 user:1.08 sys:0.11
#### SHORT
Elapsed:0:02.01 user:1.39 sys:0.09
|
2003-10-15 01:52:13 +00:00 |
|
Mark Borgerding
|
f609401471
|
about to make some changes -- just wanted a checkpoint
|
2003-10-15 00:05:50 +00:00 |
|
Mark Borgerding
|
2ae7e0f1f2
|
radix 4 works but slow
|
2003-10-14 02:47:25 +00:00 |
|
Mark Borgerding
|
6b76490456
|
Fixed point works
'make test' output:
### testing SNR for 1024 point FFTs
#### DOUBLE
snr_t2f = 296.51
snr_f2t = 315.25
#### FLOAT
snr_t2f = 146.39
snr_f2t = 142.86
#### SHORT
snr_t2f = 58.077
snr_f2t = 27.897
#### timing 10000 x 1024 point FFTs
#### DOUBLE
Elapsed:0:01.53 user:1.06 sys:0.26
#### FLOAT
Elapsed:0:01.29 user:0.98 sys:0.12
#### SHORT
Elapsed:0:02.08 user:1.65 sys:0.03
|
2003-10-14 01:09:33 +00:00 |
|
Mark Borgerding
|
8460f1f8f5
|
added optimization for radix 2
### testing SNR for 1024 point FFTs
#### DOUBLE
snr_t2f = 296.29
snr_f2t = 314.48
#### FLOAT
snr_t2f = 146.48
snr_f2t = 143.03
#### SHORT
snr_t2f = -30.269
snr_f2t = -60.442
#### timing 10000 x 1024 point FFTs
#### DOUBLE
Elapsed:0:02.77 user:2.22 sys:0.13
#### FLOAT
Elapsed:0:01.65 user:1.35 sys:0.07
#### SHORT
Elapsed:0:02.44 user:2.00 sys:0.06
|
2003-10-14 00:38:58 +00:00 |
|
Mark Borgerding
|
0d6d61cfce
|
reduced calling parameters
negligible performane impact
|
2003-10-11 23:07:16 +00:00 |
|