Searching for the best Cooley-Tukey FFT algorithms

The Cooley-Tukey input and output maps are used to developed the general topology of an FFT algorithm for a given length. Within this algorithm the twiddle factors can be placed in a nearly uncountable number of arrangements. From a given machine architecture one can choose a optimality criteria for the algorithm. With this optimality criteria the set of possible algorithms can be search for the best one. A exhaustive search is intractable for reasonable length algorithms. Thus, the search space has been hueristically reduced to make the problem tractable. An example of a length 32 minimum number of multiplies is included.