This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/81625
Description
Title
Bdd-Based Engineering-Change Logic Synthesis
Author(s)
Jayasena, v. Sanath Dhammika
Issue Date
2003
Doctoral Committee Chair(s)
Muroga, Saburo
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Electronics and Electrical
Language
eng
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.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
