Change search
ReferencesLink to record
Permanent link

Direct link
Systolic FFT Algorithms on Boolean Cubes
KTH, School of Computer Science and Communication (CSC), Centres, Centre for High Performance Computing, PDC. (Parallelldatorcentrum)
1988 (English)Conference paper (Refereed)
Abstract [en]

A description is given of a systolic Cooley-Tukey fast Fourier transform algorithm for Booleann-cubes with a substantial amount of storage per cube node. In mapping a Cooley-Tukey type FFT to such a network, the main concerns are effective use of the high connectivity/bandwidth of the Booleann-cube, the computational resources, the storage bandwidth, if there is a storage hierarchy, and the pipelines should the arithmetic units have such a feature. Another important consideration in a multiprocessor, distributed storage architecture is the allocation and access to coefficients, if they are precomputed. FFT algorithms are described that use both the storage bandwidth and the communication system optimally and require storage ofP+nNcoefficients for a transform onP⩾Ndata elements. A complex-to-complex FFT on 16 million points is predicted to require about 1.5 s on a Connection Machine model CM-2

Place, publisher, year, edition, pages
1988. 151-162 p.
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-65574DOI: 10.1109/ARRAYS.1988.18056OAI: diva2:483503
International Conference on Systolic Arrays
NR 20140805Available from: 2012-01-25 Created: 2012-01-25Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Johnsson, Lennart
By organisation
Centre for High Performance Computing, PDC
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 23 hits
ReferencesLink to record
Permanent link

Direct link