DocumentCode :
2999710
Title :
A method for concurrent decomposition and factorization of Boolean expressions
Author :
Vasudevamurthy, J. ; Rajski, J.
Author_Institution :
Dept. of Electr. Eng., McGill Univ., Montreal, Que., Canada
fYear :
1990
fDate :
11-15 Nov. 1990
Firstpage :
510
Lastpage :
513
Abstract :
Efficient algorithms are described for decomposition and factorization of Boolean expressions. The method uses only two-literal single-cube divisors and double-cube divisors considered concurrently with their complementary expressions. It is demonstrated that these objects, despite their simplicity, provide a very good framework to reason about common algebraic divisors and the duality relations between expressions. The algorithm was implemented and excellent results on several benchmark circuits illustrate its efficiency and effectiveness.<>
Keywords :
Boolean algebra; duality (mathematics); Boolean expressions; benchmark circuits; common algebraic divisors; decomposition; double-cube divisors; duality; factorization; single-cube divisors; Automatic logic units; Circuit synthesis; Councils; Digital circuits; Kernel; Laboratories; Logic circuits; Logic functions; Microelectronics; Network synthesis;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer-Aided Design, 1990. ICCAD-90. Digest of Technical Papers., 1990 IEEE International Conference on
Conference_Location :
Santa Clara, CA, USA
Print_ISBN :
0-8186-2055-2
Type :
conf
DOI :
10.1109/ICCAD.1990.129967
Filename :
129967
Link To Document :
بازگشت