Fast fourier transform on hypercube parallel computers

Thesis/Dissertation · Fri Jan 01 00:00:00 EST 1988

OSTI ID:6308055

Chu, C Y

The Fast Fourier Transform appears frequently in scientific computing. Therefore, it is desirable to implement it efficiently on parallel computeres. In this thesis, we investigate several different aspects of parallel Fast Fourier Transform implementation techniques for distributed-memory message-passing systems such as hypercube multiprocessors. Various Fast Fourier Transform algorithms are described using a matrix notation. An error analysis is presented that considers the effect of different methods used in the computation of the Fourier Transform coefficients as well as accumulated roundoff. New implementations of one and two-dimensional Fast Fourier Transforms are presented along with comparisons with existing methods. New algorithms for symmetric transforms are also developed, and the results show excellent speedup when implemented on the Intel iPSC hypercube.

• Research Organization: Cornell Univ., Ithaca, NY (USA)
• OSTI ID: 6308055
• Resource Relation: Other Information: Thesis (Ph. D.)
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
FOURIER TRANSFORMATION
COMPUTER CALCULATIONS
HYPERCUBE COMPUTERS
PARALLEL PROCESSING
ALGORITHMS
ERRORS
IMPLEMENTATION
COMPUTERS
INTEGRAL TRANSFORMATIONS
MATHEMATICAL LOGIC
PROGRAMMING
TRANSFORMATIONS
990210* - Supercomputers- (1987-1989)