Implementation of the in-order prime factor transform for variable sizes

This paper describes a modified version of Burrus´ prime factor fast Fourier transform program. The modifications produce a general-purpose program which implements the in-place, in-order algorithm for variable transform sizes. Speed tests show the resulting program to be faster than a program using a separate reordering pass.