A unified treatment of compact symmetric FFT code generation

• Published in: IEEE transactions on signal processing Vol. 50; no. 11; pp. 2789 - 2797
• Main Author: Seguel, J.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.11.2002; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Applied sciences; Arithmetic; Arrays; Computation; Data flow computing; Discrete Fourier transforms; Exact sciences and technology; Fast Fourier transforms; Flexible printed circuits; Fourier transforms; History; Information, signal and communications theory; Mathematical methods; Matrix representation; Multidimensional systems; Pervasive computing; Preserves; Specifications; Symmetry; Telecommunications and information theory; Code generation; Signal processing; Fast Fourier transformation; Fast algorithm; Discrete Fourier transformation; Symmetry
• ISSN: 1053-587X; 1941-0476
• DOI: 10.1109/TSP.2002.804318

A method for the automatic generation of compact symmetric fast Fourier transforms (FFTs) from high-level specifications is presented. The generated code eliminates all redundant computations induced by the symmetries in the FFT data flow, minimizing storage requirements, input/output and arithmetic operations, and preserves the attractive computational feature of FFT algorithms. The code-generating method can be expressed as a simple and well-structured meta-algorithm whose inputs are the dimension and edge size of the data array and a matrix representation of the data symmetries.