DocumentCode :
1225822
Title :
Symmetry Detection and Boolean Matching Utilizing a Signature-Based Canonical Form of Boolean Functions
Author :
Abdollahi, Afshin ; Pedram, Massoud
Author_Institution :
Dept. of Electr. Eng., Univ. of California at Riverside, Riverside, CA
Volume :
27
Issue :
6
fYear :
2008
fDate :
6/1/2008 12:00:00 AM
Firstpage :
1128
Lastpage :
1137
Abstract :
A compact canonical form and a computational procedure for solving the Boolean matching problem under permutation and complementation of variables are presented. The proposed approach, which utilizes generalized signatures and variable symmetries, can handle combinational functions with no limitation on the number of input variables. Experimental results demonstrate the generality and effectiveness of the proposed canonical form and the associated Boolean matching algorithm.
Keywords :
Boolean functions; logic circuits; pattern matching; Boolean functions; Boolean matching; combinational functions; signature-based canonical form; symmetry detection; variable symmetries; Boolean functions; Clustering algorithms; Impedance matching; Input variables; Libraries; Matched filters; Network synthesis; Power engineering computing; Table lookup; Boolean matching; canonical form; functional symmetry; signatures; technology mapping;
fLanguage :
English
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0278-0070
Type :
jour
DOI :
10.1109/TCAD.2008.923256
Filename :
4526734
Link To Document :
بازگشت