Journal ArticleDOI
A segmented FFT algorithm for vector computers
Mike Ashworth,Andrew Lyne +1 more
- Vol. 6, Iss: 2, pp 217-224
Reads0
Chats0
TLDR
A new algorithm designed for large, single transforms is presented, which employs a pair of multiple transforms to perform the single transform.Abstract:
The Fast Fourier Transform algorithm does not readily lend itself to efficient implementation on vector computers, especially on machines where sequential access is important. Several authors have commented that the efficiency of computation is much improved if many transforms are performed simultaneously. We present a new algorithm designed for large, single transforms, which employs a pair of multiple transforms to perform the single transform. The merits of the algorithm are discussed with reference to its implementation on a CDC CYBER 205.read more
Citations
More filters
Journal ArticleDOI
FFTs in external or hierarchical memory
TL;DR: Advanced techniques for computing an ordered FFT on a computer with external or hierarchical memory that require as few as two passes through the external data set, employ strictly unit stride, long vector transfers between main memory and external storage, and are well suited for vector and parallel computation are described.
Book ChapterDOI
FFTC: fastest Fourier transform for the IBM cell broadband engine
David A. Bader,Virat Agarwal +1 more
TL;DR: This paper uses an iterative out-of-place approach to design an efficient parallel implementation of FFT with 1K to 16K complex input samples and attain a single precision performance of 18.6 GFLOP/s on the Cell, believed to be the fastest FFT for this range of complex inputs.
Proceedings ArticleDOI
Optimizing the Fast Fourier Transform on a Multi-core Architecture
TL;DR: It is demonstrated that successful optimization for C64-like large-scale multi-core architectures requires a careful analysis that can identify certain domain-specific features of a target application and match them well with some key multi- core architecture features.
Proceedings ArticleDOI
FFTs in external of hierarchical memory
TL;DR: This paper describes some advanced techniques for computing an ordered FFT on a computer with external or hierarchical memory that require as few as two passes through the external data set, and are well suited for vector and parallel computation.
Journal ArticleDOI
The twenty-fourth fermat number is composite
TL;DR: The rigorous Pepin primality test was performed using independently developed programs running simultaneously on two different, physically separated processors, and it was shown by machine proof that F24 = 2224 + 1 is composite.
References
More filters
Journal ArticleDOI
An algorithm for computing the mixed radix fast Fourier transform
TL;DR: This paper presents an algorithm for computing the fast Fourier transform, based on a method proposed by Cooley and Tukey, and includes an efficient method for permuting the results in place.
Book
Parallel Computers 2: Architecture, Programming and Algorithms
Roger W. Hockney,Chris Jesshope +1 more
TL;DR: From the Publisher: Parallel Computers 2 follows the development of large fast supercomputers and provides a thorough guide to all aspects of the subject; technology, computer architecture, languages and algorithms using successful commercially available products as examples.
Journal ArticleDOI
Self-sorting mixed-radix fast Fourier transforms
Clive Temperton,Clive Temperton +1 more
TL;DR: The implementation of the FFT on vector computers is described, and in the final section it is demonstrated how savings can be achieved in the case of two-dimensional transforms.
Journal ArticleDOI
FFT algorithms for vector computers
TL;DR: Several methods for lengthening vectors are discussed, including the case of multiple and multi-dimensional transforms where M sequences of length N can be transformed as a single sequence of length MN using a 'truncated' FFT.
Journal ArticleDOI
High-radio-frequency survey for young and millisecond pulsars
T. R. Clifton,Andrew Lyne +1 more
TL;DR: In this article, a high-radio-frequency survey for distant pulsars is carried out at Jodrell Bank, where the authors have confirmed 32 new pulsars, including one of period 85 ms and two objects of longer period which both have characteristic ages of the order of 20,000 yr.