1998 · 43 citations · 9 references
ComputingComputer EngineeringComputer ScienceAlgorithmsDesign ComputationFormal MethodsEquivalence CheckingMatching MethodsVerificationPattern MatchingPolynomial Decomposition
Component reuse requires designers to determine whether or not an e.risting component implements desired fimctionalip. ff a common structure is used to represent components that are described at multiple levels of abstraction, compan.sons between circuit specifications and a libra~of potential implementations can be peflormed quickly. A mechanism is presented for compactly specifying circuit flmctionality as polynomials at the word level. Polynomials can be used to represent circuits that are described at the bit level or arithmetically. Furthermore, in representing components as polynomials, differences in precision behveen potential implementations can be detected and quanti>ed.
9
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text