Timing-driven logic bi-decomposition

J. Cortadella
2003 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
An approach for logic decomposition that produces circuits with reduced logic depth is presented. It combines two strategies: logic bi-decomposition of Boolean functions and tree-height reduction of Boolean expressions. It is a technology-independent approach that enables one to find tree-like expressions with smaller depths than the ones obtained by state-of-the-art techniques. The approach can also be combined with technology mapping techniques aiming at timing optimization. Experimental
more » ... ts show that new points in the area/delay space can be explored, with tangible delay improvements when compared to existing techniques.
doi:10.1109/tcad.2003.811447 fatcat:bpejh75tevctfkrr5c4qvoyqeu