Implementing 2-d and 3-d Discrete Hartley Transforms on a Massively Parallel Simd Mesh Computer
نویسندگان
چکیده
Discrete Hartley transform (DHT) is known to outperform fast Fourier transform (FFT) on sequential machines. Here we investigate parallel algorithms and implementations of twoand three-dimensional DHT in order to determine if the advantage of Hartley transforms over Fourier transforms carries over to parallel environment as well. Our extensive empirical study of the performances of DHT and FFT on a massively parallel SIMD mesh computer (MasPar MP-1), leads us to the following inescapable conclusion: Because of complex computation graphs inherent in Hartley transforms, the inter-processor communication overheads for parallel DHT are excessive, rendering it unsuitable for ne-grained parallelism.
منابع مشابه
2 Fractal Image Compression - the Encoding Phase 2
In this work we introduce and analyze algorithms for fractal image compression on massively parallel SIMD arrays. The diierent algorithms discussed diier signiicantly in terms of their communication and computation structure. Therefore the most suited algorithm for a given architecture may be selected according to our investigations. Experimental results compare the performance of the algorithm...
متن کاملMulti-Resolution Wavelet Decomposition on the MasPar Massively Parallel System
Wavelet transforms have started to receive increasing attention due to their wide applications in image and signal processing, and due to the recent discovery of a fast sequential algorithm for discrete wavelet transforms by Mallat[Mal89]. In this paper we present a mapping of the wavelet operations onto the MasPar massively parallel single instruction multiple data (SIMD) computer [Bla90], [Ma...
متن کاملMassively Parallel Simulation of Structured Connectionist Networks: An Interim Report
We map structured connectionist models of knowledge representation and reasoning onto existing general purpose massively parallel architectures with the objective of developing and implementing practical, realtime knowledge base systems. Shruti, a connectionist knowledge representation and reasoning system which attempts to model reflexive reasoning, will serve as our representative connectioni...
متن کاملA survey of architectures for the discrete and continuous wavelet transforms
Wavelet transforms have proven to be useful tools for several applications, including signal analysis, signal coding, and image compression. This paper surveys the VLSI architec-tures that have been proposed for computing the Discrete and Continuous Wavelet Transforms for 1-D and 2-D signals. The proposed architectures range from SIMD arrays to folded architectures such as systolic arrays and p...
متن کاملCompiling Rewriting onto SIMD and MIMD/SIMD Maschines
We present compilation techniques for Simple Maude, a declarative programming language based on Rewriting Logic which supports term, graph, and object-oriented rewriting. We show how to compile various constructs of Simple Maude onto SIMD and MIMD/SIMD massively parallel architectures, and in particular onto the Rewrite Rule Machine, a special purpose MIMD/SIMD architecture for rewriting. We sh...
متن کامل