Compression and technology mapping of logic circuits

This paper presents a new approach to technology mapping. The matching phase is done across several subject trees by identifying functional equivalencies. This affects the cost of mapping a given node by dividing the implementation cost among several subject trees. The covering phase is done by considering the cost of sharing logic among several trees. Some preliminary results are shown for the compression by equivalence checking part of the algorithm.