Polynomial circuit models for component matching in high-level synthesis
- 1 December 2001
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 9 (6) , 783-800
- https://doi.org/10.1109/92.974892
Abstract
Design reuse requires engineers to determine whether or not an existing block implements desired functionality. If a common high-level circuit model is used to represent components that are described at multiple levels of abstraction, comparisons between circuit specifications and a library of potential implementations can be performed accurately and quickly. A mechanism is presented for compactly specifying circuit functionality 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 between potential implementations can be detected and quantified. We present a mechanism for constructing polynomial models for combinational and sequential circuits. Furthermore, we derive a means of approximating the functionality of nonpolynomial functions and determining a bound on the error of this approximation. These methods have been implemented in the POLYSYS synthesis tool and used to synthesize a JPEG encode block and infinite impulse response filter from a library of complex elements.Keywords
This publication has 9 references indexed in Scilit:
- Object-oriented reuse methodology for VHDLPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- ACV: an arithmetic circuit verifierPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Design methodologies for system level IPPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Implicit manipulation of polynomials using zero-suppressed BDDsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Approximation and decomposition of binary decision diagramsPublished by Association for Computing Machinery (ACM) ,1998
- *PHDD: an efficient graph representation for floating point circuit verificationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- Verification of Arithmetic Circuits with Binary Moment DiagramsProceedings of the 39th conference on Design automation - DAC '02, 1995
- Spectral transforms for large boolean functions with applications to technology mappingPublished by Association for Computing Machinery (ACM) ,1993
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986