By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Drechsler, R. ; Inst. of Comput. Sci., Albert-Ludwigs-Univ., Freiburg, Germany ; Becker, B.

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

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:16 ,  Issue: 1 )