A generalized FFT algorithm on transputers

H.W. Roebbers, P.H. Welch, K.C.J. Wijbrans

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    37 Downloads (Pure)


    A generalized algorithm has been derived for the execution of the Cooley-Tukey FFT algorithm on a distributed memory machine. This algorithm is based on an approach that combines a large number of butterfly operations into one large process per processor. The performance can be predicted from theory. The actual algorithm has been implemented on a transputer array, and the performance of the implementation has been measured for various sizes of the complex input vector. It is shown that the algorithm scales linearly with the number of transputers and the problem size.
    Original languageEnglish
    Title of host publicationTransputer research and applications 4
    Subtitle of host publicationNATUG-4, proceedings of the Fourth Conference of the North American Transputer Users Group, October 11-12, 1990, Ithaca, NY
    EditorsDaniel L. Fielding
    Place of PublicationAmsterdam
    Number of pages0
    ISBN (Print)978-90-5199-040-9
    Publication statusPublished - 1 Sept 1990
    Event4th North American Transputer User Group Meeting, NATUG 1990 - Ithaca, United States
    Duration: 11 Oct 199012 Oct 1990
    Conference number: 4

    Publication series

    NameTransputer and occam engineering series
    PublisherIOS Press


    Conference4th North American Transputer User Group Meeting, NATUG 1990
    Abbreviated titleNATUG-4
    Country/TerritoryUnited States


    Dive into the research topics of 'A generalized FFT algorithm on transputers'. Together they form a unique fingerprint.

    Cite this