The fast Hartley transform on the hypercube multiprocessors

Authors:
X. Lin;T. F. Chan;W. J. Karplus
Affiliations:
Computer Science Department, University of California, Los Angeles;Mathematics Department, University of California, Los Angeles;Computer Science Department, University of California, Los Angeles
Venue:
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Year:
1989

Citing 1
Cited 2

The Hartley transform

The Hartley transform

What have we learnt from using real parallel machines to solve real problems?

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Efficient Fast Hartley Transform Algorithms for Hypercube-Connected Multicomputers

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Fast Hartley Transform is a promising alternative to the Fast Fourier Transform when the processed data are real numbers. The hypercube implementation of the FHT is largely dependent on the way the computation is partitioned. A partitioning algorithm is presented which generates evenly-loaded tasks on each node and demands only a regular communication topology — the Hartley graph. Mapping from the Hartley graph to the Gray graph (binary n-cube) is straightforward, since the Hartley graph has a similar structure as the Gray graph. However, the communication is not always between the nearest neighbors and thus may take some extra time. Moreover, the slowness of the communication in the presently available architectures imposes a limitation on the speedup when a large number of processors are used.