Indexing in the Good–Thomas Fast Fourier Transform Algorithm

A simple principle is described for the formation of input and output indexing of arrays in the fast Good–Thomas algorithm for implementing the discrete Fourier transform. Specific examples are used to show how its superposition with a fast algorithm of constant structure can be constructed. A generalization of the algorithm to three or more coprime factors is considered.