1999 · 29 citations · 9 references
ComputingComputer ScienceComputer SystemsAlgorithmsComplex SystemsComputer ArchitectureData-flow AnalysisLookup TablesPolynomial AccelerationPolynomial DecompositionPolynomial ExpansionPolynomial Optimization
Methods for performing component matching by expressing an arithmetic specification and a bit-level description of an implementation as word-level polynomials have been demonstrated for combinational circuits. This representation allows the functionality of a specification and existing implementation to be compared. We present extensions to this basic method that allow polynomial models to be constructed for circuits that employ sequential elements as well as feedback. Furthermore, we derive a means of approximating the functionality of non polynomial functions and determining a bound on the error of this approximation. These methods are used to synthesize an Infinite Impulse Response filter from a library of potential implementations.
9
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text
Approximation and decomposition of binary decision diagrams
Kavita Ravi, Kenneth L. McMillan, Thomas R. Shiple et al. · 1998 · 70 citations · Full text