DocumentCode
1822247
Title
Sympathy: fast exact minimization of fixed polarity Reed-Muller expressions for symmetric functions
Author
Drechsler, Rolf ; Becker, Bernd
Author_Institution
Dept. of Comput. Sci., Frankfurt Univ., Germany
fYear
1995
fDate
6-9 Mar 1995
Firstpage
91
Lastpage
97
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
Reed-Muller codes; VLSI; logic CAD; minimisation of switching nets; Sympathy program; VLSI; fixed polarity Reed-Muller expressions; logic synthesis; ordered functional decision diagrams; partially symmetric functions; polynomial time algorithm; totally symmetric functions; Arithmetic; Boolean functions; Circuit synthesis; Circuit testing; Computer science; Error correction; Field programmable gate arrays; Minimization methods; Polynomials; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
European Design and Test Conference, 1995. ED&TC 1995, Proceedings.
Conference_Location
Paris
Print_ISBN
0-8186-7039-8
Type
conf
DOI
10.1109/EDTC.1995.470414
Filename
470414
Link To Document