|  | ac2eb527b7 | fftnd now uses forward struct declaration | 2004-02-24 01:38:52 +00:00 |  | 
			
				
					|  | dda6f9638e | replaced void pointers with pointers to forward declared structs | 2004-02-24 01:29:25 +00:00 |  | 
			
				
					|  | 16ac58df93 | : | 2004-02-02 03:51:52 +00:00 |  | 
			
				
					|  | 1d58b0eced | fix for inplace odd rank multi-dimensional ffts | 2004-02-02 01:49:08 +00:00 |  | 
			
				
					|  | b9edc58bad | psdpng does not yet work, but it will create a png | 2004-02-01 22:12:35 +00:00 |  | 
			
				
					|  | 75393dc4fa | *** empty log message *** | 2004-01-31 16:26:42 +00:00 |  | 
			
				
					|  | 366f17e379 | getting ready for 1.1 | 2004-01-31 01:28:21 +00:00 |  | 
			
				
					|  | 9ddb2bb744 | *** empty log message *** | 2004-01-30 03:40:54 +00:00 |  | 
			
				
					|  | 6f99fc129a | impulse response was bass ackwards | 2004-01-30 02:47:35 +00:00 |  | 
			
				
					|  | 9b738dc492 | slight fast fir changes | 2004-01-30 00:17:01 +00:00 |  | 
			
				
					|  | 80eccb4e3c | Trying to decide what to do about real odd FFTs | 2004-01-29 03:26:48 +00:00 |  | 
			
				
					|  | 49a6ad07e0 | little easier to understand (hoepfully) | 2004-01-24 22:13:14 +00:00 |  | 
			
				
					|  | e335546c3e | fast conv filtering cleaner ifc | 2004-01-24 04:25:19 +00:00 |  | 
			
				
					|  | 5005a2a99d | mmap version with flush | 2004-01-24 03:32:21 +00:00 |  | 
			
				
					|  | 58366b55ac | add mmapped version | 2004-01-24 02:45:44 +00:00 |  | 
			
				
					|  | 25e377eaa8 | fast conv filtering small edits 2d files no longer needed with kiss_fftnd | 2004-01-24 01:34:01 +00:00 |  | 
			
				
					|  | ca97282da6 | does no copy fast conv filtering | 2004-01-24 00:46:30 +00:00 |  | 
			
				
					|  | 227c021f39 | extra cleanup | 2004-01-04 23:15:44 +00:00 |  | 
			
				
					|  | 8ffc08b07b | slightly closer, still overflows in some cases | 2004-01-02 22:28:03 +00:00 |  | 
			
				
					|  | 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 |  | 
			
				
					|  | 0243552944 | fast convolution filtering works at least for complex numbers. | 2003-12-31 22:49:14 +00:00 |  | 
			
				
					|  | b468fd96d7 | Added mucho comments. | 2003-12-30 15:18:41 +00:00 |  | 
			
				
					|  | 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 |  | 
			
				
					|  | 10a4a5c46b | 2d fft now uses kiss_fft_stride to avoid buffer copies. | 2003-12-29 21:07:19 +00:00 |  | 
			
				
					|  | 4552a14801 | added stride to fft input -- should simplify multi-dimensional FFTs | 2003-12-29 18:50:13 +00:00 |  | 
			
				
					|  | 604e238834 | split kfc.c into source + header files. Added copyright. | 2003-12-29 17:05:13 +00:00 |  | 
			
				
					|  | 630089ded6 | kfc works | 2003-12-29 16:46:27 +00:00 |  | 
			
				
					|  | cd94cd1ed0 | testing kfc (kiss fft cache) | 2003-12-29 16:38:03 +00:00 |  | 
			
				
					|  | f4961ed74b | fixed a bug with nfft==1 and added utility for more testing | 2003-12-16 03:43:05 +00:00 |  | 
			
				
					|  | 95a7b856d1 | compiles OK under MAC OS X | 2003-12-15 03:53:14 +00:00 |  | 
			
				
					|  | 6b23ebb5c1 | getting ready for v100 | 2003-12-15 03:23:46 +00:00 |  | 
			
				
					|  | 573536f48f | fixed scaling for short real moved fft.py from ./ to sample_code | 2003-12-14 05:13:11 +00:00 |  | 
			
				
					|  | 559c14b49b | changed alloc functions to allow for initialization of user-supplied buffer | 2003-12-14 03:02:30 +00:00 |  | 
			
				
					|  | ef7f8ff6c0 | getting ready to release version 1.0 | 2003-12-11 01:54:42 +00:00 |  | 
			
				
					|  | 09dbf36e97 | kiss_fftr.c gives correct answers for forward | 2003-12-07 04:04:27 +00:00 |  | 
			
				
					|  | 39d2974fe3 | 'make snr' now tests 2d ffts | 2003-12-04 04:08:52 +00:00 |  | 
			
				
					|  | 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 |  | 
			
				
					|  | 206e28f11c | made the factorization a separate routine | 2003-11-12 01:09:35 +00:00 |  | 
			
				
					|  | 140f106743 | benchmark utilities now give memory info | 2003-11-08 02:48:02 +00:00 |  | 
			
				
					|  | e9095a161c | generic butterfly slightly slower -- hmmm | 2003-11-07 02:39:49 +00:00 |  | 
			
				
					|  | cb5312efdc | 2d fft seems to work | 2003-11-06 03:59:31 +00:00 |  | 
			
				
					|  | 4ebf0b5aca | aded a CHANGELOG | 2003-11-04 02:09:53 +00:00 |  | 
			
				
					|  | 6c8049cc75 | slight changes to Makefile | 2003-11-04 01:01:37 +00:00 |  | 
			
				
					|  | 3c0c0431e2 | radix 5 works, but is 6x slower than fftw | 2003-11-03 03:03:16 +00:00 |  | 
			
				
					|  | 85764e6437 | radix 5 doesn't work, but I thik it should. just a checkpoint commit | 2003-11-01 16:48:33 +00:00 |  | 
			
				
					|  | 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 |  | 
			
				
					|  | 28551899e2 | radix 4 faster | 2003-11-01 03:49:53 +00:00 |  | 
			
				
					|  | d4f87befda | re-added radix 3 butterfly | 2003-10-30 02:02:29 +00:00 |  | 
			
				
					|  | ca4c74e07c | Woops, one should not test with input of all zeros | 2003-10-29 04:29:01 +00:00 |  | 
			
				
					|  | 1db3d91ee5 | getting ready for next release | 2003-10-26 04:07:32 +00:00 |  |