| C. Temperton, "A generalized prime factor FFT algorithm for |
....include the Sun Performance Library version 1.2 (SUNPERF) public domain code by T. Ooura (Fortran, 1996) J. Green (C, 1996) and R. H. Krukar (C, 1990) the Fortran FFTPACK library [11] a Fortran split radix FFT by Sorensen [12] a Fortran FFT by Singleton [13] Temperton s Fortran GPFA code [14]; Bailey s 4 step FFT implementation [15] Sitton s QFT code [16] and the four1 routine from [17] NRF) We get similar numbers on other machines. For example, on an IBM RS 6000, FFTW ranges from 55 faster than IBM s ESSL library for N = 64, to 12 slower for N = 16384, to again 7 faster for ....
C. Temperton, "A generalized prime factor FFT algorithm for
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC