In this paper we characterize and study a new class of regular Boolean functions called D-reducible. A Dreducible function, depending on all its n input variables, can be studied and synthesized in a space of dimension strictly smaller than n. A D-reducible function can be efficiently decomposed, giving rise to a new logic form, that we have called DRedSOR This form is often smaller than the corresponding minimum SOP form. Experimental evidence shows that such functions are rather common and D-reducibility can be tested very quickly.
|Titolo:||DRedSOP: synthesis of a new class of regular functions|
|Parole Chiave:||EXOR gates; Logic synthesis; Regular functions|
|Settore Scientifico Disciplinare:||Settore INF/01 - Informatica|
|Data di pubblicazione:||2006|
|Digital Object Identifier (DOI):||10.1109/DSD.2006.46|
|Tipologia:||Book Part (author)|
|Appare nelle tipologie:||03 - Contributo in volume|