A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions

Abstract

Modified reconstructability analysis (MRA), a novel decomposition technique within the framework of set‐theoretic (crisp possibilistic) reconstructability analysis, is applied to three‐variable NPN‐classified Boolean functions. MRA is superior to conventional reconstructability analysis, i.e. it decomposes more NPN functions. MRA is compared to Ashenhurst‐Curtis (AC) decomposition using two different complexity measures: log‐functionality, a measure suitable for machine learning, and the count of the total number of two‐input gates, a measure suitable for circuit design. MRA is superior to AC using the first of these measures, and is comparable to, but different from AC, using the second.

Citation

Al‐Rabadi, A.N., Perkowski, M. and Zwick, M. (2004), "A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions", Kybernetes, Vol. 33 No. 5/6, pp. 933-947. https://doi.org/10.1108/03684920410533985