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.
|Titolo:||On projecting sums of products|
|Autori interni:||CORDONE, ROBERTO (Ultimo)|
CIRIANI, VALENTINA (Secondo)
|Parole Chiave:||Logic synthesis; Multi-level synthesis; Projected sums of products|
|Settore Scientifico Disciplinare:||Settore INF/01 - Informatica|
|Data di pubblicazione:||2008|
|Digital Object Identifier (DOI):||10.1109/DSD.2008.105|
|Tipologia:||Book Part (author)|
|Appare nelle tipologie:||03 - Contributo in volume|
File in questo prodotto:
- PubMed Central loading...