A generalized FFT algorithm on transputers

Herman Roebbers, Herman Roebbers, P.H. Welch, Peter Welch, K.C.J. Wijbrans, Klaas Wijbrans

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

8 Downloads (Pure)

Abstract

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 publicationProceedings of the 4th North American Transputer User Group Meeting
Place of PublicationAmsterdam
PublisherIOS Press
Pages-
Number of pages0
ISBN (Print)9051990405
Publication statusPublished - 1 Sep 1990

Publication series

Name
PublisherIOS Press

Fingerprint

Transputers
Fast Fourier transforms
Data storage equipment

Keywords

  • IR-96060
  • METIS-113531

Cite this

Roebbers, H., Roebbers, H., Welch, P. H., Welch, P., Wijbrans, K. C. J., & Wijbrans, K. (1990). A generalized FFT algorithm on transputers. In Proceedings of the 4th North American Transputer User Group Meeting (pp. -). Amsterdam: IOS Press.
Roebbers, Herman ; Roebbers, Herman ; Welch, P.H. ; Welch, Peter ; Wijbrans, K.C.J. ; Wijbrans, Klaas. / A generalized FFT algorithm on transputers. Proceedings of the 4th North American Transputer User Group Meeting. Amsterdam : IOS Press, 1990. pp. -
@inproceedings{f7cfff09112a4beebe60b4047d606921,
title = "A generalized FFT algorithm on transputers",
abstract = "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.",
keywords = "IR-96060, METIS-113531",
author = "Herman Roebbers and Herman Roebbers and P.H. Welch and Peter Welch and K.C.J. Wijbrans and Klaas Wijbrans",
year = "1990",
month = "9",
day = "1",
language = "English",
isbn = "9051990405",
publisher = "IOS Press",
pages = "--",
booktitle = "Proceedings of the 4th North American Transputer User Group Meeting",
address = "Netherlands",

}

Roebbers, H, Roebbers, H, Welch, PH, Welch, P, Wijbrans, KCJ & Wijbrans, K 1990, A generalized FFT algorithm on transputers. in Proceedings of the 4th North American Transputer User Group Meeting. IOS Press, Amsterdam, pp. -.

A generalized FFT algorithm on transputers. / Roebbers, Herman; Roebbers, Herman; Welch, P.H.; Welch, Peter; Wijbrans, K.C.J.; Wijbrans, Klaas.

Proceedings of the 4th North American Transputer User Group Meeting. Amsterdam : IOS Press, 1990. p. -.

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

TY - GEN

T1 - A generalized FFT algorithm on transputers

AU - Roebbers, Herman

AU - Roebbers, Herman

AU - Welch, P.H.

AU - Welch, Peter

AU - Wijbrans, K.C.J.

AU - Wijbrans, Klaas

PY - 1990/9/1

Y1 - 1990/9/1

N2 - 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.

AB - 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.

KW - IR-96060

KW - METIS-113531

M3 - Conference contribution

SN - 9051990405

SP - -

BT - Proceedings of the 4th North American Transputer User Group Meeting

PB - IOS Press

CY - Amsterdam

ER -

Roebbers H, Roebbers H, Welch PH, Welch P, Wijbrans KCJ, Wijbrans K. A generalized FFT algorithm on transputers. In Proceedings of the 4th North American Transputer User Group Meeting. Amsterdam: IOS Press. 1990. p. -