An Exact Minimization of AND-EXOR Expressions Using Encoded MRCF

Hiroyuki OCHI  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E79-A   No.12   pp.2131-2133
Publication Date: 1996/12/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Section on VLSI Design and CAD Algorithms)
Category: 
Keyword: 
logic cptimization,  exact minimization of AND-EXOR expressions,  Helliwell equation,  O-suppressed binary decision diagrams,  

Full Text: PDF>>
Buy this Article




Summary: 
In this paper, an exact-minimization method for an AND-EXOR expression (ESOP) using O-suppressed binary decision diagrams (ZBDDs) is considered. The proposed method is an improvement of Sasao's MRCF-based method. From experimental results, it is shown that required ZBDD size is reduced to 1/3 in the best case compared with the MRCF-based method.