DocumentCode :
1340646
Title :
Sympathy: fast exact minimization of fixed polarity Reed-Muller expressions for symmetric functions
Author :
Drechsler, Rolf ; Becker, Bernd
Author_Institution :
Inst. of Comput. Sci., Albert-Ludwigs-Univ., Freiburg, Germany
Volume :
16
Issue :
1
fYear :
1997
fDate :
1/1/1997 12:00:00 AM
Firstpage :
1
Lastpage :
5
Abstract :
In this paper, a polynomial time algorithm for the minimization of fixed polarity Reed-Muller expressions (FPRMs) for totally symmetric functions based on ordered functional decision diagrams (OFDDs) is presented. A generalization to partially symmetric functions is investigated. The algorithm has been implemented as the program Sympathy. Experimental results in comparison to previously published methods are given to show the efficiency of the approach
Keywords :
Boolean functions; Reed-Muller codes; VLSI; logic CAD; minimisation of switching nets; multivalued logic circuits; symmetric switching functions; Sympathy; efficiency; exact minimization; fixed polarity Reed-Muller expressions; ordered functional decision diagrams; partially symmetric functions; polynomial time algorithm; symmetric functions; totally symmetric functions; Boolean functions; Central Processing Unit; Circuit synthesis; Circuit testing; Helium; Large-scale systems; Logic; Minimization methods; Polynomials; Very large scale integration;
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/43.559327
Filename :
559327
Link To Document :
بازگشت