Unordered parallel distance-1 and distance-2 FFT algorithms of radix 2 and (4-2)

Mahn Ling Woo, Rosemary Renaut

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Algorithms for unordered Parallel Fast Fourier transform (PFFT) pairs with radices 2 and mixed radix (4-2) for distributed memory machines are presented. Distributed memory versions using distance one and distance two communications are derived. Theoretical estimates of the computation costs in each case demonstrate that the higher-radix FFT is more efficient for parallel implementation. Furthermore, distance-Two communication strategies can minimise com-munication cost, when certain architecture dependent parameters are satisfied.

Original languageEnglish (US)
Title of host publicationProceedings of the 1994 ACM Symposium on Applied Computing, SAC 1994
PublisherAssociation for Computing Machinery
Pages504-509
Number of pages6
VolumePart F129433
ISBN (Electronic)0897916476
DOIs
StatePublished - Apr 6 1994
Event1994 ACM Symposium on Applied Computing, SAC 1994 - Phoenix, United States
Duration: Mar 6 1994Mar 8 1994

Other

Other1994 ACM Symposium on Applied Computing, SAC 1994
CountryUnited States
CityPhoenix
Period3/6/943/8/94

Keywords

  • Complexity analysis
  • Mixed-radix (4-2) FFT
  • Parallel FFT algorithms
  • Radix-2 FFT

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Unordered parallel distance-1 and distance-2 FFT algorithms of radix 2 and (4-2)'. Together they form a unique fingerprint.

  • Cite this

    Woo, M. L., & Renaut, R. (1994). Unordered parallel distance-1 and distance-2 FFT algorithms of radix 2 and (4-2). In Proceedings of the 1994 ACM Symposium on Applied Computing, SAC 1994 (Vol. Part F129433, pp. 504-509). Association for Computing Machinery. https://doi.org/10.1145/326619.326903