Abstraction of word-level polynomial function from waveform polynomial descriptions

According to Boolean process, waveform polynomials are able to describe the function and timing of a circuit component, however, waveform polynomials are bit level description with too many variables and unable to describe high-level models. This paper presented an approach to abstract the word-level functionality of a circuit component from its waveform polynomial description. The presented approach can be particularly useful for component matching and reuse, and it provides an efficient way to determine whether different descriptions are equivalent, so it can be effectively use to realize functional verification across design levels.