2026-09-22T20:03:30Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/81625 2023-07-11 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Muroga, Saburo Jayasena, v. Sanath Dhammika 2015-09-25T20:19:35Z 2015-09-25T20:19:35Z 10000-01-01 2003 2003 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. Made available in DSpace on 2015-09-25T20:19:35Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3101870.pdf: 5497174 bytes, checksum: 70d1bfa43d21bae1d31684514b21dfa6 (MD5) Previous issue date: 2003 Embargo set by: Seth Robbins for item 82906 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs U of I Only 107 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2003. http://hdl.handle.net/2142/81625 (MiAaPQ)AAI3101870 eng Engineering, Electronics and Electrical Bdd-Based Engineering-Change Logic Synthesis text Computer Science Computer Science University of Illinois at Urbana-Champaign Dissertation Ph.D.