On the Cooley-Turkey Fast Fourier algorithm for arbitrary factors

Abstract

Atonuje and Okonta in [1] developed the Cooley-Turkey Fast Fourier transform algorithm and its application to the Fourier transform of discretely sampled data points N, expressed in terms of a power y of 2. In this paper, we extend the formalism of [1] Cookey-Turkey Fast Fourier transform algorithm. The method is developed in this paper to guarantee the application of (C-TFFT) algorithm for arbitrary factors say N = P₁P₂



Journal of the Nigerian Association of Mathematical Physics Vol. 8 2004: pp. 121-124