DocumentCode
3440838
Title
An algorithm for the algebraic factorization of Boolean functions
Author
Caruso, Giuseppe
Author_Institution
Dipartimento di Ingegneria Elettrica, Palermo Univ., Italy
fYear
1991
fDate
13-16 May 1991
Firstpage
587
Lastpage
590
Abstract
A procedure is presented that attempts to reduce the number of literals in a Boolean expression by merging products. The author has compared a previous version of the algorithm to a version of it which includes the new procedure. Results relating to this comparison are summarized
Keywords
Boolean algebra; Boolean functions; merging; Boolean functions; algebraic factorization; literals; product merging; single output functions; Boolean functions; Heuristic algorithms; Kernel; Logic; Merging;
fLanguage
English
Publisher
ieee
Conference_Titel
CompEuro '91. Advanced Computer Technology, Reliable Systems and Applications. 5th Annual European Computer Conference. Proceedings.
Conference_Location
Bologna
Print_ISBN
0-8186-2141-9
Type
conf
DOI
10.1109/CMPEUR.1991.257454
Filename
257454
Link To Document