Fast fourier transforms 2-3-5
1981; Elsevier BV; Volume: 7; Issue: 1 Linguagem: Inglês
10.1016/0098-3004(81)90041-8
ISSN1873-7803
AutoresEvangelos A. Yfantis, Leon E. Borgman,
Tópico(s)Image and Signal Denoising Methods
ResumoSeveral programs based on the Fast Fourier Transform (FFT) Algorithm developed by Cooley and Tukey are available. The Cooley and Tukey algorithm for the FFT requires the number of data N be a power of 2. Along with a subroutine which implements the Cooley and Tukey algorithm, six other new subroutines which are extensions of the Cooley and Tukey algorithm are given in this paper. Some applications to geoscience, along with some examples where the FFT subroutine based on the Cooley and Tukey algorithm is undesirable also are given.
Referência(s)