Sympathy: fast exact minimization of fixed polarity Reed-Muller expressions for symmetric functions

Authors:
R. Drechsler;B. Becker
Affiliations:
Inst. of Comput. Sci., Albert-Ludwigs-Univ., Freiburg;-
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2006

Citing 0
Cited 3

Using PVM for Distributed Logic Minimization in a Network of Computers

Proceedings of the 6th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Symmetry detection for incompletely specified functions

Proceedings of the 41st annual Design Automation Conference
TED+: a data structure for microprocessor verification

Proceedings of the 2005 Asia and South Pacific Design Automation Conference

Quantified Score

Hi-index	0.03

Visualization

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