Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 6, NO. 6, JUNE 1995 561 Efficient Fast Hartley Transform Algorithms
 

Summary: IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 6, NO. 6, JUNE 1995 561
Efficient Fast Hartley Transform Algorithms
for Hypercube-Connected Multicomputers
Cevdet Aykanat and Argun Dervig
Abstract- Although fast Hartley transform (FHT) provides
efficient spectral analysis of real discrete signals, the literature
that addressesthe parallelizationof 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 efficientrestructuringfor the
sequentialFHT algorithmwhich brings regularityand symmetry
to the computational structure of the FHT. Then, we propose
an efficient parallel FHT algorithm for medium-to-coarsegrain
hypercube multicomputers by introducing a dynamic mapping
scheme for the restructured FHT. The proposed parallel algo-
rithm achieves perfect load-balance,minimizes both the number
and volume of concurrentcommunications,allows only nearest-
neighborcommunicationsand achievesin-placecomputationand
communication.The proposed algorithmis implementedon a 32-

  

Source: Aykanat, Cevdet - Department of Computer Engineering, Bilkent University

 

Collections: Computer Technologies and Information Sciences