• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Efficient fast hartley transform algorithms for hypercube-connected multicomputers

      Thumbnail
      View / Download
      1.8 Mb
      Author(s)
      Aykanat, Cevdet
      Derviş, A.
      Date
      1995
      Source 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
      Article
      Item Usage Stats
      242
      views
      196
      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
      Ance
      Digital 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
      Permalink
      http://hdl.handle.net/11693/25921
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/71.388039
      Collections
      • Department of Computer Engineering 1510
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 2976
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy