Note a note on prime factor FFT algorithms-Reference-Cited by-同舟云学术

Note a note on prime factor FFT algorithms

Published:1983-10 Issue:1 Volume:52 Page:198-204
ISSN:0021-9991
Container-title:Journal of Computational Physics
language:en
Short-container-title:Journal of Computational Physics

Author:

Temperton Clive

Publisher

Elsevier BV

Subject

Computer Science Applications,Physics and Astronomy (miscellaneous),Applied Mathematics,Computational Mathematics,Modeling and Simulation,Numerical Analysis

Reference13 articles.

1. An FFT algorithm using base 8 iterations;Bergland;Math. Comp.,1968

2. An algorithm for the machine computation of complex Fourier series;Cooley;Math. Comp.,1965

3. Digital Processing of Signals;Gold,1969

4. The interaction algorithm and practical Fourier analysis;Good;J. Roy. Statist. Soc. Ser. B,1958

5. A prime factor FFT algorithm using high-speed convolution;Kolba;IEEE Trans. Acoust. Speech Signal Process.,1977

Cited by 33 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Simple Implementation of Dynamical Memory Allocation in Old-fashioned Singleton's Mixed-radix Fast Fourier Transformation Code;Journal of the Korean Magnetics Society;2012-04-30

2. Automatic Performance Tuning for Fast Fourier Transforms;The International Journal of High Performance Computing Applications;2004-02

3. Time-dependent interplay between electron emission and fragmentation in the interatomic Coulombic decay;The Journal of Chemical Physics;2003-02

4. Automatic Performance Tuning in the UHFFT Library;Computational Science — ICCS 2001;2001

5. The multiconfiguration time-dependent Hartree (MCTDH) method: a highly efficient algorithm for propagating wavepackets;Physics Reports;2000-01