POLARIS: Polarity Propagation Algorithm for Combinational Logic Synthesis

Abstract

A new algorithm for combinational logic synthesis, POLARIS, is described. POLARIS automatically generates optimized gate level logic from functional level specification described by Boolean expressions. It transforms the Boolean expressions into logical operator trees, and produces a network of physical units or units of physical design by introducing polarity and propagating it along the tree. Experimental results show that more than 96% of gate level logic structures are equal to the logic structures designed by experts.