Courtesy RK Brayton (UCB) and A Kuehlmann (Cadence) 1 Logic Synthesis Exploiting Don’t Cares in Logic Minimization.
1 Node Minimization Problem:Problem: –Given a Boolean network, optimize it by minimizing each node as much as possible. Note:Note: –The initial network.
SAT J. Gonzalez. Summary Introduction Algorithms for SAT –Splitting and Resolution –Local Search –Integer Programming Method –Global Optimization SAT.
Traditional steps in a CAD system for implementing a digital circuit using PLD
