rather cryptic doc below, please DON'T ask me questions about the code ! Joerg Arndt You got this document from http://www.jjj.de/ --------------------------------------------- From pavo.csi.cam.ac.uk!uknet!mcsun!uunet!cs.utexas.edu!rutgers!mcclb0.med.nyu.edu!smith Fri Sep 11 11:25:31 1992 Article: 606 of sci.image.processing Path: pavo.csi.cam.ac.uk!uknet!mcsun!uunet!cs.utexas.edu!rutgers!mcclb0.med.nyu.edu!smith From: smith@mcclb0.med.nyu.edu Newsgroups: sci.image.processing Subject: Favorite FFTs (was 'Re: 2d dft phase info') Message-ID: <1992Sep9.083621.7140@mcclb0.med.nyu.edu> Date: 9 Sep 92 13:36:21 GMT References: <9209011949.AA19843@hp-and.an.hp.com> <1992Sep2.194306.2275@mpifr-bonn.mpg.de> <1992Sep7.110102.25536@bnr.co.uk> <1992Sep8.232448.14932@mpifr-bonn.mpg.de> Organization: NYU Medical Center, New York, NY 10016, USA Lines: 19 > > My favourite Fourier transform package is a Radix-8 FFT that does > 512x512 float -> 256x512 complex in 4.3 sec on a DECStation 5000/200, > and was written by myself (that's why it is my favourite ;-), and > doesn't contain a Hartley transform. Now that we are on to 'favourite FFTs', mine is Lynn ten Eykes multi-radix FFT which does FFTs of any sized multi-dimensioned array with dimensions that have prime factors less than 49 (X must be even, however) the output of a 200x200 array of reals is 101x200 complex. It is very fast, due to special code to handle factors of 2,3,4,5 & 8, in addition to the primes to 49. We have ported it to IBM, VMS, Ultix and UNICOS (Cray). Its good... (less than 3 secs for 512x512 reals on a DECstation 5000/240) +----------------------------------------------------------------------------+ |Ross Smith, Research Computing Resource, Department of Cell Biology, NYU-MC| |550 First Ave., NYC, 10016-6402. Phone: (212) 263-5356: FAX: (212) 263-8139| |E-Mail: SMITH@NYUMED.BITNET (BITNET), SMITH@MCCLB0.MED.NYU.EDU (Internet)| +----------------------------------------------------------------------------+ The following message is a courtesy copy of an article that has been posted as well. >>>>> On 26 Jul 1995 03:46:46 GMT, beale@jumpjibe.stanford.edu (John Beale) said: > Anyone know about or used Lynn ten Eykes fortran FFT code, and do you know > where I might find documentation? Thanks. Ten Eyck's fft stuff (public domain) is particularly specialised to crystallography (especially 3D) and as such is available with various crsytallographic packages e.g. ftp://ccp4.dl.ac.uk/pub/ccp4/ccp4/{lib/src/fftlib.f, doc/fftlib.doc} although that doc isn't so useful. Ten Eyck apparently has a more recent version available and it has has also been worked on for better in-core performance etc. at Cambridge -- the original design and/or use was partly out-of-core. I can supply some more info if it's of interest. f2c will grok these if necessary. However, caveat emptor for other compilers since, like the Numerical Recipes code, they use illegal Fortran -- though Ten Eyck disputes this -- in this case in an effort to optimise for old compilers (which also led to a byzantine structure). I suspect hacks appropriate in the early 70s now are not optimal... > multi-radix FFT which does FFTs of any sized multi-dimensioned > array with dimensions that have prime factors less than 49 (X must ^^ 19 in the canonical version referenced above. ---------------------------------------------