Efficient Verification and Synthesis using Design Commonalities

In this paper we solve the problem of identifying a “matching” between two logic circuits or “networks”. A matching is a functions that maps each gate or “node” in the new circuit into one in the old circuit (if a matching does not exist it maps it to null). We present both an exact and a heuristic way to solve the maximal matching problem. The matching… CONTINUE READING