Introduction of permissible bridges with application to logic optimization after technology mapping

This paper introduces the concept of a permissible bridge and a permissible bridge pair. A bridge is a logic node with two inputs and one output. A bridge or a bridge pair are called permissible if they can be inserted into a Boolean network without changing its behavior at primary outputs. There are a total of 255 types of bridges that can be considered between any pair of wires in the network. We discuss a subset of such bridges and present three theorems related to permissible bridges for pairwise detectability, distinguishability and conditional equivalence. Experimental results show that relatively many bridges are permissible in each circuit. In this paper, we exploit the conditional equivalence of wire pairs and show that even after technology mapping, we can significantly reduce the active area as well as the wiring of many designs