On a New Boolean Function with Applications
IEEE Transactions on Computers
Doing two-level logic minimization 100 times faster
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Constructive library-aware synthesis using symmetries
DATE '00 Proceedings of the conference on Design, automation and test in Europe
Fast three-level logic minimization based on autosymmetry
Proceedings of the 39th annual Design Automation Conference
Solving difficult SAT instances in the presence of symmetry
Proceedings of the 39th annual Design Automation Conference
Switching Theory for Logic Synthesis
Switching Theory for Logic Synthesis
Logic Synthesis and Verification Algorithms
Logic Synthesis and Verification Algorithms
Generalized symmetries in boolean functions
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Multiple-Valued Minimization to Optimize PLAs with Output EXOR Gates
ISMVL '99 Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic
DRedSOP: Synthesis of a New Class of Regular Functions
DSD '06 Proceedings of the 9th EUROMICRO Conference on Digital System Design
On Projecting Sums of Products
DSD '08 Proceedings of the 2008 11th EUROMICRO Conference on Digital System Design Architectures, Methods and Tools
A Fast SOP Minimizer for Logic Funcions Described by Many Product Terms
DSD '09 Proceedings of the 2009 12th Euromicro Conference on Digital System Design, Architectures, Methods and Tools
Three-level logic minimization based on function regularities
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A fast algorithm for OR-AND-OR synthesis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Synthesis of SPP three-level logic networks using affine spaces
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Functionally Linear Decomposition and Synthesis of Logic Circuits for FPGAs
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
We define and study a new class of regular Boolean functions called D-reducible. A D-reducible function, depending on all its n input variables, can be studied and synthesized in a space of dimension strictly smaller than n. We show that the D-reducibility property can be efficiently tested, in time polynomial in the representation of f, that is, an initial SOP form of f. A D-reducible function can be efficiently decomposed, giving rise to a new logic form, that we have called DredSOP. This form is shown here to be generally smaller than the corresponding minimum SOP form. Our experiments have also shown that a great number of functions of practical importance are indeed D-reducible, thus validating the overall interest of our approach.