Projected Don´t Cares

In this paper we define and study the properties of projected don´t cares, a category of don´t cares dynamically built by the minimization algorithm during the synthesis phase. Our target is to exploit projected don´t cares properties in order to obtain more compact networks. In particular, we show the use of projected don´t care conditions in two synthesis techniques, i.e., using a Boolean and an algebraic algorithm. Experimental results show that in the Boolean case 65% of the considered benchmarks achieve more compact area when implemented using projected don´t cares. The benefit in the algebraic approach is reduced (35% of instances benefit from the proposed technique), even if there are examples with an interesting decrease of the area.