A generalized FFT algorithm on transputers

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

A generalized FFT algorithm on transputers

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

104 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 language	English
Title of host publication	Transputer research and applications 4
Subtitle of host publication	NATUG-4, proceedings of the Fourth Conference of the North American Transputer Users Group, October 11-12, 1990, Ithaca, NY
Editors	Daniel L. Fielding
Place of Publication	Amsterdam
Publisher	IOS
Number of pages	0
ISBN (Print)	978-90-5199-040-9
Publication status	Published - 1 Sept 1990
Event	4th North American Transputer User Group Meeting, NATUG 1990 - Ithaca, United States Duration: 11 Oct 1990 → 12 Oct 1990 Conference number: 4

Publication series

Name	Transputer and occam engineering series
Publisher	IOS Press

Conference

Conference	4th North American Transputer User Group Meeting, NATUG 1990
Abbreviated title	NATUG-4
Country/Territory	United States
City	Ithaca
Period	11/10/90 → 12/10/90

Access to Document

Roebbers1990generalizedAccepted author version, 116 KB

Cite this

@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.",

author = "H.W. Roebbers and P.H. Welch and K.C.J. Wijbrans",

year = "1990",

month = sep,

day = "1",

language = "English",

isbn = "978-90-5199-040-9",

series = "Transputer and occam engineering series",

publisher = "IOS",

editor = "Fielding, \{Daniel L.\}",

booktitle = "Transputer research and applications 4",

address = "Netherlands",

note = "4th North American Transputer User Group Meeting, NATUG 1990, NATUG-4 ; Conference date: 11-10-1990 Through 12-10-1990",

}

Roebbers, HW, Welch, PH & Wijbrans, KCJ 1990, A generalized FFT algorithm on transputers. in DL Fielding (ed.), Transputer research and applications 4: NATUG-4, proceedings of the Fourth Conference of the North American Transputer Users Group, October 11-12, 1990, Ithaca, NY. Transputer and occam engineering series, IOS, Amsterdam, 4th North American Transputer User Group Meeting, NATUG 1990, Ithaca, New York, United States, 11/10/90.

A generalized FFT algorithm on transputers. / Roebbers, H.W.; Welch, P.H.; Wijbrans, K.C.J.
Transputer research and applications 4: NATUG-4, proceedings of the Fourth Conference of the North American Transputer Users Group, October 11-12, 1990, Ithaca, NY. ed. / Daniel L. Fielding. Amsterdam: IOS, 1990. (Transputer and occam engineering series).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - A generalized FFT algorithm on transputers

AU - Roebbers, H.W.

AU - Welch, P.H.

AU - Wijbrans, K.C.J.

N1 - Conference code: 4

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.

M3 - Conference contribution

SN - 978-90-5199-040-9

T3 - Transputer and occam engineering series

BT - Transputer research and applications 4

A2 - Fielding, Daniel L.

PB - IOS

CY - Amsterdam

T2 - 4th North American Transputer User Group Meeting, NATUG 1990

Y2 - 11 October 1990 through 12 October 1990

ER -

A generalized FFT algorithm on transputers

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this