Implementation of 2-D DFT algorithms on a loosely-coupled parallel system

Author

Rayfield, James T. ; Silverman, Harvey F.

Author_Institution

Div. of Eng., Brown Univ., Providence, RI, USA

fYear

1988

fDate

11-14 Apr 1988

Firstpage

1997

Abstract

An implementation of the two-dimensional (2-D) discrete Fourier transform (DFT) on the Armstrong Multiprocessor System is presented. Armstrong is a loosely coupled parallel processing system made up of a large number of identical processing nodes and is currently operational. The system utilizes a reconfigurable point-to-point network for communication, thus allowing researchers to experiment with different communication topologies for a given application. The 2-D DFT implementation is discussed, and its performance is analyzed under variations in DFT size, network topology, and processing-node count

Keywords

fast Fourier transforms; parallel processing; 2-D DFT algorithms; Armstrong Multiprocessor System; DFT size; communication topologies; discrete Fourier transform; loosely-coupled parallel system; network topology; parallel processing system; processing nodes; reconfigurable point-to-point network; Connectors; Coprocessors; DRAM chips; Discrete Fourier transforms; EPROM; Hardware; Kernel; Network topology; Random access memory; Systems engineering and theory;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on

Conference_Location

New York, NY

ISSN

1520-6149

Type

conf

DOI

10.1109/ICASSP.1988.197017

Filename

197017