This paper introduces a new bounded multi-level algebraic form, called Projected Sum of Products (P-SOP), based on projections of minimal SOP forms onto subsets of the Boolean space. After a standard two-level logic minimization, this technique can be used as a very fast postprocessing step for further minimizing the circuit area, increasing the depth of the network by only a constant value. The proposed synthesis algorithms have been implemented and tested with interesting results, which show how about 75% of standard Espresso benchmarks benefit from this postprocessing phase.
On projecting sums of products / A. Bernasconi, V. Ciriani, R. Cordone - In: 11. Euromicro conference on digital system design : architectures, methods and tools : september 3-5 2008, Parma, Italy : proceedings / [a cura di] L. Fanucci. - Los Alamitos : IEEE computer society, 2008. - ISBN 9780769532776. - pp. 787-794 (( Intervento presentato al 11. convegno EUROMICRO Conference on Digital System Design Architectures, Methods and Tools (DSD) tenutosi a Parma nel 2008 [10.1109/DSD.2008.105].
On projecting sums of products
V. CirianiSecondo
;R. CordoneUltimo
2008
Abstract
This paper introduces a new bounded multi-level algebraic form, called Projected Sum of Products (P-SOP), based on projections of minimal SOP forms onto subsets of the Boolean space. After a standard two-level logic minimization, this technique can be used as a very fast postprocessing step for further minimizing the circuit area, increasing the depth of the network by only a constant value. The proposed synthesis algorithms have been implemented and tested with interesting results, which show how about 75% of standard Espresso benchmarks benefit from this postprocessing phase.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
