Files in this item



application/pdf3101870.pdf (5MB)Restricted to U of Illinois
(no description provided)PDF


Title:Bdd-Based Engineering-Change Logic Synthesis
Author(s):Jayasena, v. Sanath Dhammika
Doctoral Committee Chair(s):Muroga, Saburo
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Subject(s):Engineering, Electronics and Electrical
Abstract:Next, the problem of covering an incompletely-specified negative function by a completely-specified negative function efficiently is investigated. This problem arises during the synthesis of MOS networks. A necessary step towards solving this is to obtain irredundant disjunctive and conjunctive forms, both of which are negative. We use BDDs for efficient computation of these expressions. Our algorithm is based on computing the maximum and minimum vectors of a BDD. Previous algorithms for this problem were based on inefficient enumeration of input vectors. The number of vectors to be enumerated is reduced to a small number in our method. Experimental results show our new covering method is quite fast and produces reasonably good results.
Issue Date:2003
Description:107 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2003.
Other Identifier(s):(MiAaPQ)AAI3101870
Date Available in IDEALS:2015-09-25
Date Deposited:2003

This item appears in the following Collection(s)

Item Statistics