Show simple item record

dc.contributor.authorAykanat, C.en_US
dc.contributor.authorDerviş, A.en_US
dc.date.accessioned2016-02-08T10:52:22Z
dc.date.available2016-02-08T10:52:22Zen_US
dc.date.issued1995en_US
dc.identifier.issn1045-9219
dc.identifier.urihttp://hdl.handle.net/11693/25921en_US
dc.description.abstractAlthough 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 IEEEen_US
dc.language.isoEnglishen_US
dc.source.titleIEEE Transactions on Parallel and Distributed Systemsen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/71.388039en_US
dc.subjectAnceen_US
dc.subjectDigital Signal Processingen_US
dc.subjectFormen_US
dc.subjectLoad Bal-en_US
dc.subjectMulticomputeren_US
dc.subjectNearest-Neighbor Communicationen_US
dc.subjectParallel Computingen_US
dc.subjectComputational Load Balanceen_US
dc.subjectConcurrent Communicationen_US
dc.subjectDynamic Mapping Schemeen_US
dc.subjectFast Hartley Transformen_US
dc.subjectHypercubeen_US
dc.subjectHypercube connected multicomputeren_US
dc.subjectNearest neighbor communicationen_US
dc.subjectReal discrete signalsen_US
dc.subjectComputational complexityen_US
dc.subjectComputational methodsen_US
dc.subjectConcurrency controlen_US
dc.subjectDigital signal processingen_US
dc.subjectInterconnection networksen_US
dc.subjectMathematical transformationsen_US
dc.subjectMultiprocessing systemsen_US
dc.subjectOptimizationen_US
dc.subjectParallel processing systemsen_US
dc.subjectPerformanceen_US
dc.subjectReal Time Systemsen_US
dc.subjectSpectrum Analysisen_US
dc.subjectParallel Algorithmsen_US
dc.titleEfficient fast hartley transform algorithms for hypercube-connected multicomputersen_US
dc.typeArticleen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage561en_US
dc.citation.epage577en_US
dc.citation.volumeNumber6en_US
dc.citation.issueNumber6en_US
dc.identifier.doi10.1109/71.388039en_US
dc.publisherIEEEen_US
dc.identifier.eissn1558-2183


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record