Synthesis of the fast Fourier transform algorithm by functional language program transformation

Presents a technique for systematically synthesizing parallel algorithms starting from a high-level specification of the problem to be solved and a functional abstraction of the target architecture. We show how functional language program transformation can be used to generate various algorithms that match the characteristics of the target architecture and demonstrate the technique by synthesizing various fast Fourier transforms for various parallel architectures from a specification of the discrete Fourier transform.<>