Applicable Algebra in Engineering, Communication and Computing

, Volume 8, Issue 2, pp 143–163

Linear Bijections and the Fast Fourier Transform

  • M. Hegland
  • W. W. Wheeler

DOI: 10.1007/s002000050059

Cite this article as:
Hegland, M. & Wheeler, W. AAECC (1997) 8: 143. doi:10.1007/s002000050059


 Fast Fourier transform algorithms rely upon the choice of certain bijective mappings between the indices of the data arrays. The two basic mappings used in the literature lead to Cooley–Tukey algorithms or to prime factor algorithms. But many other bijections also lead to FFT algorithms, and a complete classification of these mappings is provided. One particular choice leads to a new FFT algorithm that generalizes the prime factor algorithm. It has the advantage of reducing the floating point operation count by reducing the number of trigonometric function evaluations.

A certain equivalence relation is defined on the set of bijections that lead to FFT algorithms, and its connection with isomorphism classes of group extensions is studied. Under this equivalence relation every equivalence class contains bijections leading to an FFT algorithm of the new type.

Keywords: Fast Fourier transformPrime factor algorithmSplitting pair.

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • M. Hegland
    • 1
  • W. W. Wheeler
    • 1
  1. 1.Centre for Mathematics and its Applications, School of Mathematical Sciences, Australian National University, Canberra ACT 0200, AustraliaAU