Computing the Fourier transform of real data on a hypercube

Journal Article · Sat Dec 01 04:00:00 EST 1990 · Journal of Scientific Computing; (United States)

DOI:https://doi.org/10.1007/BF01063119· OSTI ID:5386577

Dubey, A; Zubair, M; Grosch, C E ^[1]

---

1. Old Dominion University, Norfolk, VA (USA)

There are two ways, other than the standard FFT algorithm, of computing Fourier transforms of real data, namely: (1) the real fast Fourier transform (RFFT) algorithm, and (2) the fast Hartley transform (FHT) algorithm. On a sequential computer, it has been shown that both the RFFT and the FHT algorithms are faster than the FFT algorithm. However, it is not obvious that the same is true on a parallel machine. The communication requirements of the RFFT and the FHT algorithms, which are critical to the cost of any parallel implementation, are different from those of the FFT algorithm. Efficient implementations of the RFFT and the FHT algorithms on a hypercube machine are presented. Experimental results are given for the implementation of the RFFT and the FHT algorithms on the NCUBE machine. 12 refs.

• OSTI ID: 5386577
• Journal Information: Journal of Scientific Computing; (United States), Journal Name: Journal of Scientific Computing; (United States) Vol. 5; ISSN JSCOE; ISSN 0885-7474
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
COMMUNICATIONS
COMPUTERS
DIFFERENTIAL EQUATIONS
EQUATIONS
FOURIER TRANSFORMATION
HYPERCUBE COMPUTERS
IMPLEMENTATION
INTEGRAL TRANSFORMATIONS
MATHEMATICAL LOGIC
PARALLEL PROCESSING
PARTIAL DIFFERENTIAL EQUATIONS
PERFORMANCE
PROGRAMMING
TRANSFORMATIONS