DocumentCode
292859
Title
An improved algorithm for Boolean factoring
Author
Caruso, Giuseppe
Author_Institution
Dipartimento di Ingegneria Elettrica, Palermo Univ., Italy
Volume
1
fYear
1994
fDate
30 May-2 Jun 1994
Firstpage
241
Abstract
This paper is concerned with an algorithm for Boolean factoring. In an earlier paper [1993], the author proposed a new algorithm for Boolean factoring that does not require any minimization step. The technique used for generating Boolean products rests on the notion of elementary rectangle. In this paper, we present two substantial improvements to this algorithm. The first is a new factoring strategy. The second is a new expansion technique. The modified algorithm outperforms the original one both in efficiency and quality of results
Keywords
Boolean functions; logic CAD; multivalued logic; Boolean factoring; Boolean products; algorithm efficiency; elementary rectangle; expansion technique; factoring strategy; logic functions; multilevel logic synthesis; Costs; Logic functions; Minimization methods; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1994. ISCAS '94., 1994 IEEE International Symposium on
Conference_Location
London
Print_ISBN
0-7803-1915-X
Type
conf
DOI
10.1109/ISCAS.1994.408800
Filename
408800
Link To Document