Efficient fast hartley transform algorithms for hypercube-connected multicomputers
Date
1995Source Title
IEEE Transactions on Parallel and Distributed Systems
Print ISSN
1045-9219
Electronic ISSN
1558-2183
Publisher
IEEE
Volume
6
Issue
6
Pages
561 - 577
Language
English
Type
ArticleItem Usage Stats
257
views
views
245
downloads
downloads
Abstract
Although fast Hartley transform (FHT) provides efficient spectral analysis of real discrete signals, the literature that addresses the parallelization of FHT is extremely rare. FHT is a real transformation and does not necessitate any complex arithmetics. On the other hand, FHT algorithm has an irregular computational structure which makes efficient parallelization harder. In this paper, we propose a efficient restructuring for the sequential FHT algorithm which brings regularity and symmetry to the computational structure of the FHT. Then, we propose an efficient parallel FHT algorithm for medium-to-coarse grain hypercube multicomputers by introducing a dynamic mapping scheme for the restructured FHT. The proposed parallel algorithm achieves perfect load-balance, minimizes both the number and volume of concurrent communications, allows only nearest-neighbor communications and achieves in-place computation and communication. The proposed algorithm is implemented on a 32-node iPSC/21 hypercube multicomputer. High-efficiency values are obtained even for small size FHT problems. © 1995 IEEE
Keywords
AnceDigital Signal Processing
Form
Load Bal-
Multicomputer
Nearest-Neighbor Communication
Parallel Computing
Computational Load Balance
Concurrent Communication
Dynamic Mapping Scheme
Fast Hartley Transform
Hypercube
Hypercube connected multicomputer
Nearest neighbor communication
Real discrete signals
Computational complexity
Computational methods
Concurrency control
Digital signal processing
Interconnection networks
Mathematical transformations
Multiprocessing systems
Optimization
Parallel processing systems
Performance
Real Time Systems
Spectrum Analysis
Parallel Algorithms