Boolean Matching Using Generalized Reed-Muller Forms

TitleBoolean Matching Using Generalized Reed-Muller Forms
Publication TypeConference Paper
Year of Publication1994
AuthorsTsai, C-C, Marek-Sadowska, M
Conference NameDesign Automation, 1994. 31st Conference on
Date Publishedjune
AbstractIn 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.