However, as each entry in the determinant is symbolic, that is, a polynomial in variable(s), this leads to the intermediate expression swell(or explosion) problem in the expansion of determinant.

So in this paper, a new algorithm for the equivalence verification of high-level data paths based on polynomial symbolic algebra is proposed.

An analytical expression for determining singularity configuration which is a polynomial equation is set, and the numeric symbolic manipulating technique is introduced in the paper.