Date of Award
Fall 1983
Document Type
Thesis
Degree Name
Master of Science (MS)
Department
Electrical & Computer Engineering
Program/Concentration
Electrical Engineering
Committee Director
Meghanad D. Wagh
Committee Member
John W. Stoughton
Committee Member
Sherad Kanetkar
Abstract
This thesis explores the time optimal implementation of computational graphs on a finite register machine. The implementation fully exploits the machine architecture, especially, the number of registers. The derived algorithms allow one to obtain time efficient implementations of a given graph in machines with a known number of registers.
These optimization procedures are applied to digital signal processing graphs. It is shown that the regular structure of these graphs allows one to identify computational kernels which, when used repeatedly, can cover the entire graph. The l- and r-register implementations of Hadamard and Fast Fourier Transforms using various computational kernels are studied for their code sizes and time complexities. The results obtained also allow one to select an optimal hardware devoted to a particular computational application
Rights
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
DOI
10.25777/zkjm-z906
Recommended Citation
Chong, Yong M..
"Design of Efficient Algorithms Through Minimization of Data Transfers"
(1983). Master of Science (MS), Thesis, Electrical & Computer Engineering, Old Dominion University, DOI: 10.25777/zkjm-z906
https://digitalcommons.odu.edu/ece_etds/164