Good Algorithm Research Articles

Note a note on prime factor FFT algorithms

The author shows that prime factor FFT algorithms offer little improvement over conventional FFT algorithms on computers such as the Cray-1 and Cyber 205 where the multiplications can be performed in parallel with the additions. A very modest gain may be obtained by using Good's algorithm (1958) with conventional small-n transforms. Winograd's technique (1978), despite its impressive reduction in the number of multiplications, is likely to be slower than the conventional algorithm, particularly on the Cray-1, where memory transfers will dominate the computation. 13 references.

Average running time of the fast Fourier transform

We compare several algorithms for computing the discrete Fourier transform of n numbers. The number of “operations” of the original Cooley-Tukey algorithm is approximately 2 n A( n), where A( n) is the sum of the prime divisors of n. We show that the average number of operations satisfies 1 x )∑ n≤x2n A(n) ∼ ( π 2 9 )( x 2 log x ) . The average is not a good indication of the number of operations. For example, it is shown that for about half of the integers n less than x, the number of “operations” is less than n 1.61. A similar analysis is given for Good's algorithm and for two algorithms that compute the discrete Fourier transform in O( n log n) operations: the chirp- z transform and the mixed-radix algorithm that computes the transform of a series of prime length p in O( p log p) operations.