Dimension-Reducible Boolean Functions Based on Affine Spaces

作者：Bernasconi Anna^*; Ciriani Valentina

来源：ACM Transactions on Design Automation of Electronic Systems, 2011, 16(2): 13.

DOI：10.1145/1929943.1929945

• Algorithms
• Design
• Automatic synthesis
• Optimization
• logic synthesis
• regular Boolean functions

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.

• 出版日期2011-3