Global node reduction of linear systems using ratio analysis

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Linear systems are widely used in mathematics and engineering. Constructing a minimal directed acyclic graph (DAG) that corresponds to a given linear system is important in high-level synthesis. It is shown to be NP-complete in this paper. Ratio analysis, a novel multi-step algorithm for constructing a small sized DAG is presented. Ratio analysis attempts to minimize the total number of nodes in a DAG by maximizing the sharing of nodes between equations. The first part of the algorithm considers the ratio of terms in different equations. The second part looks at the difference between these ratios and the final equations. The third part generates the final DAG. Results are shown that illustrate the efficiency of the algorithm as well as the savings which are possible from the algorithm's application.

Original languageEnglish
Title of host publicationProceedings of the IEEE International Symposium on High-Level Synthesis
Editors Anon
PublisherPubl by IEEE
Pages140-145
Number of pages6
ISBN (Print)0818657855
StatePublished - 1994
Externally publishedYes
EventProceedings of the 7th International Symposium on High-Level Synthesis - Niagara-on-the-Lake, Ont, Can
Duration: 18 May 199420 May 1994

Publication series

NameProceedings of the IEEE International Symposium on High-Level Synthesis

Conference

ConferenceProceedings of the 7th International Symposium on High-Level Synthesis
CityNiagara-on-the-Lake, Ont, Can
Period18/05/9420/05/94

Fingerprint

Dive into the research topics of 'Global node reduction of linear systems using ratio analysis'. Together they form a unique fingerprint.

Cite this