Minimization of AND-EXOR expressions using rewrite rules

Conditions for generating optimal two-level AND-EXOR representations using rewrite rules are considered. Four results are presented. First, it is shown that a necessary condition for obtaining minimality is a temporary increase in the size of expressions during minimization. Second, a sufficient con...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE Trans. Comput Jg. 42; H. 5; S. 568 - 576
Hauptverfasser:	Brand, D., Sasao, T.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY IEEE 01.05.1993 Institute of Electrical and Electronics Engineers (IEEE) Institute of Electrical and Electronics Engineers
Schlagworte:	Applied sciences Circuit testing Computer science Computer science; control theory; systems Exact sciences and technology Logic Minimization methods Modules (abstract algebra) Programming theory Sufficient conditions Theoretical computing Red-Muller expansion Nondeterministic algorithm Logic minimization Rewriting Programming Two level representation Rewrite rull Programming theory
ISSN:	0018-9340
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!