On decomposing Boolean functions via extended cofactoring
Proceedings of the Conference on Design, Automation and Test in Europe
Dimension-reducible Boolean functions based on affine spaces
ACM Transactions on Design Automation of Electronic Systems (TODAES)
An approximation algorithm for cofactoring-based synthesis
Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI
Synthesis of P-circuits for logic restructuring
Integration, the VLSI Journal
SOP restructuring by exploiting don't cares
Microprocessors & Microsystems
| Hi-index | 0.03 |
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.