@inproceedings{3194d2da3669446c82e70b5874aa3465,

title = "The fast hartley transform on the hypercube multiprocessors",

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

author = "Xinming Lin and Chart, {Tony F.} and Karplus, {Walter J.}",

year = "1989",

month = jan,

day = "3",

doi = "10.1145/63047.63101",

language = "English (US)",

series = "Proceedings of the 3rd Conference on Hypercube Concurrent Computers and Applications: Architecture, Software, Computer Systems, and General Issues, C3P 1988",

publisher = "Association for Computing Machinery, Inc",

pages = "1451--1454",

editor = "Geoffrey Fox",

booktitle = "Proceedings of the 3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988",

note = "3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988 ; Conference date: 19-01-1988 Through 20-01-1988",

}