A Comprehensive DFT API for Scientific Computing
The Fast Fourier Transform (FFT) algorithm that calculates the Discrete Fourier Transform (DFT) is one of the major breakthrough in scientific computing and is now an indispensable tool in a vast number of fields. Unfortunately, software that provide fast computation of DFT via FFT differ vastly in functionality as well as uniformity. A widely accepted Applications Programmer Interface (API) for DFT would advance the field of scientific computing significantly. In this paper, we formulate an API for DFT computation that encompasses all the functionality that are offered by a number of popular packages combined, allows easy porting from existing codes, and exhibits a systematic naming convention with relatively short calling sequences.
KeywordsAPI FFT DFT scientific computing.
- E. Oran Brigham, The Fast Fourier Transform and Its Applications, Prentice Hall, New Jersey, 1988.Google Scholar
- Athanasios Papoulis, The Fourier Integral and its Applications, 2nd edition, McGraw-Hill, New York, 1984.Google Scholar
- Charles Van Loan, Computational Frameworks for the Fast Fourier Transform, SIAM, Philadelphia, 1992Google Scholar