Abstraction of Polynomial Functions from Arithmetic Transform for Fixed-Size Arithmetic Datapath

This paper presented an approach to abstract the polynomial function of a fixed-size arithmetic datapath from its pseudo-Boolean function 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.