Sympathy: Fast Exact Minimization of Fixed Polarity Reed-Muller Expressions for Symmetric Functions (1995)
| Citations: | 7 - 3 self |
BibTeX
@MISC{Drechsler95sympathy:fast,
author = {Rolf Drechsler and Bernd Becker},
title = {Sympathy: Fast Exact Minimization of Fixed Polarity Reed-Muller Expressions for Symmetric Functions},
year = {1995}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. 1 Introduction The high complexity of modern VLSI circuitry has shown an increasing demand for synthesis tools. In the last few years synthesis based on AND/EXOR realizations has gained more and more interest [9], because AND/EXOR realizations are very efficient for large classes of circuits, e.g., arithmetic circuits, error correcting circuits and circuits for tele-communication [15, 16]. For these classes EXOR-circuits derived from Reed-Muller Expressions need less gates for the representation of a Boolean function and drastically r...
