Synthesis of P-Circuits for logic restructuring

Boolean functional decomposition techniques built on top of Shannon cofactoring are applied to obtain specialized 4-level formscalled Projected Circuits, or P-circuits. We describe their minimization by heuristic and guaranteed approximation algorithmsexploiting structural don't care conditions, and prove properties for special cases about cost estimation and testability. A specificapplication is synthesis for minimum switching activity, with small area penalty, where the decomposition moves toward theoutput critical signals with the highest switching activity. We report encouraging experiments for decomposition targeting powerconsumption or simply area.