M. C. Pease, An Adaption of the Fast Fourier Transform for Parallel Processing, J. ACM 15 (1968), pp. 252--264. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Optimum Complexity FFT Algorithms for RISC Processors - Karner, Auer, Ueberhuber (1998) (Correct)
....Cooley and Tukey [1] published an algorithm, the fast Fourier transform (FFT) which reduced the computational complexity of the DFT to O(N log N ) Numerous studies have been published on how the FFT can be implemented efficiently on advanced computer systems. The first step was made by Pease [16] in 1968. He introduced an algorithm well suited for implementations on parallel computers. In his pioneering paper, which was not based on the Cooley Tukey variant, Pease used the Kronecker product notation to describe the FFT. This formalism is particularly useful as mathematical formulas ....
....offers a unifying basis for the description of FFT algorithms. Van Loan [20] uses this technique for a state of the art presentation of FFT algorithms in his remarkable book Computational Frameworks for the Fast Fourier Transform . In the twenty five years between the publications of Pease [16] and Van Loan [20] only a few authors used this powerful technique: Temperton [18] and Johnson et al. 9] for FFT implementations on classic vector computers and Norton and Silberger [14] on parallel computers with MIMD architecture. Recently, Gupta [6] 7] and Pitsianis [17] used the Kronecker ....
M. C. Pease, An Adaption of the Fast Fourier Transform for Parallel Processing, Journal of the ACM 15 (1968), pp. 252--264.
Parallel FFT Algorithms with Reduced Communication Overhead - Karner, Ueberhuber (1998) (Correct)
....Cooley and Tukey [6] published an algorithm, the fast Fourier transform (FFT) which reduced the computational complexity of the DFT to O(N log N ) Numerous studies have been published on how the FFT can be implemented efficiently on advanced computer systems. The first step was made by Pease [15] in 1968. He introduced an algorithm well suited for implementations on parallel computers. In his pioneering paper, which was not based on the Cooley Tukey variant, Pease used the Kronecker product notation to describe the FFT. This formalism is particularly useful as mathematical formulas ....
....offers a unifying basis for the description of FFT algorithms. Van Loan [19] uses this technique for a state of the art presentation of FFT algorithms in his remarkable book Computational Frameworks for the Fast Fourier Transform . In the twenty five years between the publications of Pease [15] and Van Loan [19] only a few authors used this powerful technique: Temperton [18] and Johnson et al. 11] for FFT implementations on classic vector computers and Norton and Silberger [14] on parallel computers with MIMD architecture. Recently, Gupta [9] and Pitsianis [16] used the Kronecker ....
M. C. Pease, An Adaption of the Fast Fourier Transform for Parallel Processing, J. ACM 15 (1968), pp. 252--264.
Parallel FFT Algorithms with Reduced Communication Overhead - Karner, Ueberhuber (1998) (Correct)
No context found.
M. C. Pease, An Adaption of the Fast Fourier Transform for Parallel Processing, J. ACM 15 (1968), pp. 252--264.
Low Communication FFTs - Franchetti, Lorenz, Ueberhuber (2002) (Correct)
No context found.
M. C. Pease, An Adaption of the Fast Fourier Transform for Parallel Processing, Journal of the ACM 15 (1968), pp. 252-264.
Optimum Complexity FFT Algorithms for RISC Processors - Karner, Auer, Ueberhuber (1998) (Correct)
No context found.
M. C. Pease, An Adaption of the Fast Fourier Transform for Parallel Processing, Journal of the ACM 15 (1968), pp. 252--264.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC