dc.contributor.author	Lin, Ta-Cheng	en
dc.contributor.committeechair	Cyre, Walling R.	en
dc.contributor.committeemember	Gray, Festus Gail	en
dc.contributor.committeemember	Kafura, Dennis G.	en
dc.contributor.committeemember	Armstrong, James R.	en
dc.contributor.committeemember	Abbott, A. Lynn	en
dc.contributor.department	Electrical and Computer Engineering	en
dc.date.accessioned	2014-03-14T20:06:49Z	en
dc.date.adate	1999-01-21	en
dc.date.available	2014-03-14T20:06:49Z	en
dc.date.issued	1998-12-01	en
dc.date.rdate	1999-01-21	en
dc.date.sdate	1999-01-21	en
dc.description.abstract	The transistor count for todays VLSI technology reaches 40 million transistors on one chip. In order to successfully design a system with such complexity, new computer-aided design (CAD) tools are needed. This dissertation shows approaches for coping with the problem of increasing complexity of VLSI design in three aspects: 1) capturing a higher level of abstraction, 2) using a new target architecture, and 3) using a new optimization technique. The advantage of working at a higher level of abstraction is that the number of objects that designers have to manipulate is reduced so that more complex systems can be delivered in shorter periods of time. The functions that can be used to capture higher levels of abstraction are surveyed and categorized into an is-a hierarchy. A partitioned-bus architecture that consists of complex functional units used to realize complex functions is proposed. The issues of synthesizing the complex functions to the partitioned-bus architecture are addressed. These issues are focused on the functional partitioning problem which is a known NP-complete problem. Algorithms used to optimize several metrics that affect the solution qualities of functional partitioning are presented. The metrics include communication buffer size, register file size, system delay, the number of buses, the number of links, and the number of multiplexers. These metrics are used to form a cost function, which is utilized by the Problem Space Genetic Partitioning algorithm (PSGP) to search for a good solution. Test cases with known optimal solutions are used to evaluate the solution qualities that PSGP can attain under run time and memory space constraints. The experimental results show that PSGP can reach an average about 87% of the optima for two-way partitioning. Another study also shows that PSGP outperforms the widely used Simulated Annealing algorithm.	en
dc.description.degree	Ph. D.	en
dc.identifier.other	etd-012199-181338	en
dc.identifier.sourceurl	http://scholar.lib.vt.edu/theses/available/etd-012199-181338/	en
dc.identifier.uri	http://hdl.handle.net/10919/26021	en
dc.publisher	Virginia Tech	en
dc.relation.haspart	LINVITA.PDF	en
dc.relation.haspart	Contents.pdf	en
dc.relation.haspart	Title.pdf	en
dc.relation.haspart	Toc.pdf	en
dc.rights	In Copyright	en
dc.rights.uri	http://rightsstatements.org/vocab/InC/1.0/	en
dc.subject	Digital System Synthesis	en
dc.subject	Genetic Algorithm	en
dc.subject	Communication Buffer	en
dc.subject	Partitioned-Bus Architecture	en
dc.subject	Complex Functional Unit	en
dc.title	Digital System Synthesis with Complex Functional Units	en
dc.type	Dissertation	en
thesis.degree.discipline	Electrical and Computer Engineering	en
thesis.degree.grantor	Virginia Polytechnic Institute and State University	en
thesis.degree.level	doctoral	en
thesis.degree.name	Ph. D.	en

Digital System Synthesis with Complex Functional Units

Files

Original bundle

Collections