An in-order, partially in-place mixed radix FFT algorithm

This correspondence describes a modified version of the Burrus and Rothweiler prime factor FFT algorithm for the powers of prime length. It allows a much wider selection of transform sizes, and calculates the DFT in order. Speed measurements show that the resulting program can be faster than Singleton´s algorithm for some specific transform length.