The discrete Fourier transform (DFT) has always been an important analytical tool in many areas of science and engineering. However, it was not until the development of the fast Fourier transform (FFT) that the DFT became widely used. This is because the DFT requires O(N2) computations, while the FFT only requires O(Nlog2N) operations.
Oracle Developer Studio Performance Library contains a set of routines that computes the FFT, related FFT operations, such as convolution and correlation, and trigonometric transforms.
This chapter is divided into the following three sections.
Forward and Inverse FFT Routines
Sine and Cosine Transforms
Convolution and Correlation
Each section includes examples that show how the routines might be used.
% man -s 3P sfftcFor an overview of the FFT routines:
% man -s 3P fft