Fast Fourier transform in the spiral honeycomb image algebra

The Fourier transform is one of the most important transformations in image processing. A major component of this influence comes from the ability to implement it efficiently on a digital computer. This paper describes one such efficient implementation and discusses its implications to digital technology as well as biological vision. The significance of the fast Fourier transform (FFT) presented in this paper is that it provides geometrical meaning to the regrouping of a Cooley-Tukey type FFT.