DocumentCode
452036
Title
Boolean Matching Using Generalized Reed-Muller Forms
Author
Tsai, Chien-Chung ; Marek-Sadowska, Malgorzata
Author_Institution
Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA
fYear
1994
fDate
6-10 June 1994
Firstpage
339
Lastpage
344
Abstract
In this paper we present a new method for Boolean matching of completely specified Boolean functions. The canonical Generalized Reed-Muller forms are used as a powerful analysis tool. Input permutation, as well as input and output negation for matching are handled simultaneously. To reduce the search space for input correspondence, we have developed a method that can detect symmetries of any number of inputs simultaneously. Experiments on MCNC benchmark circuits are very encouraging.
Keywords
Boolean functions; Design automation; Displays; Distributed computing; Equations; Machinery; Permission; Poles and zeros; USA Councils;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation, 1994. 31st Conference on
ISSN
0738-100X
Print_ISBN
0-89791-653-0
Type
conf
DOI
10.1109/DAC.1994.204123
Filename
1600396
Link To Document