By Topic

On design strategies for parallel algorithms in signal processing using graph models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
J. Lenzer ; Technische Hochschule Darmstadt, Darmstadt, FRG ; G. Wieber

To reduce computation time in a multiprocessor environment the efficient configuration and utilization of hardware components is necessary. It requires both a restructuring of the considered algorithms and a reconfiguration of the corresponding machine architectures. A transformation system is presented, which uses computation graphs as a representation of both the algorithmic structure and the processor configuration. The system is able to rewrite the computation graph automatically, dependent on the available hardware resources. In this paper the design strategy for algorithms and machine models is illustrated by the DFT. Several models for the algorithm are discussed. Finally the results of time and hardware complexity with regard to the different graph structures and machine architectures are presented.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '80.  (Volume:5 )

Date of Conference:

Apr 1980