A method to extract the cubes of the Generalized Reed-Muller form (GRM) of a Boolean function with a given polarity is presented. The method does not require exponential space and time complexity and it achieves the lower bound time complexity. The proof o
Minimization of Fixed-Polarity AND/XOR Canonical
Networks
ABSTRACT
A method to extract the cubes of the Generalized Reed-Muller form (GRM) of a Booleanfunction with a given polarity is presented. The method does not require exponential space andtime complexity and it achieves the lower bound time complexity. The proof of the method’s cor-rectness constitutes the rst half of this paper. Also, a separate heuristic algorithm to nd the op-timal polarity that requires the least number of cubes in the GRM representation is proposed. Thealgorithm is fast and derives the polarity for variables and extracts all cubes simultaneously. It isbased on the concept of a Boolean center for vertices, which emulates the center of gravity con-cept in geometry. The experimental results for the heuristic algorithm agree strongly with our ob-servations and analysis.
1 Introduction
It has been known [1-2][4-8][10-11][13-17][20,21] that for arithmetic functions and error-correcting circuits the best realizations include XOR gates. High testability of the AND/XORdesigns makes them additionally attractive [12]. However, popular logic synthesis tools cannottake the XOR into consideration. Perhaps one reason for low popularity of XOR gates is that, inearlier technologies, such gates were much larger and slower than AND/NAND/OR/NOR blocks.This is no longer true with the present technologies. Hence, incorporation of XOR into logic syn-thesis becomes a technologically feasible and important issue. Recent developments in symmetrydetection [18] and Boolean matching [19] utilize the XOR representations as a tool to analyzeBoolean functions. These new applications make it critical that we investigate and derive moreef cient methods to obtain the XOR representation of Boolean functions.
The foundations of XOR representation are based on the well-known Reed-Muller (RM)Form. In an RM form, each Boolean function can be represented by the XOR sum of a unique setof cubes, in which every variable is in the positive polarity. A Generalized Reed-Muller (GRM)form allows each variable to be in either positive or negative polarity, but not both, in the forms.
Exact Minimization of Fixed Polarity Reed-Muller Expressions for Incompletely ...Muller expression (FPRM) is one of the canonical AND-EXOR expressions [15...
Chapter Twenty Cost Minimization Cost Minimization A firm is a cost-minimizer if it produces any given output level y ≥ 0 at smallest possible total ...
1 Derivation of Point-to-Plane Minimization Consider the Chen-Medioni (point-to-plane) framework for ICP. Assume we have a collection of points (pi ...
Minimization of nonreson... 暂无评价 15页 免费 The emergence of spin el... 暂无评价 11页 1财富值 Spin light of electron i... 暂无评价 5页 免费...
1 arXiv:0809.0199v1 [cs.IT] 1 Sep 2008 Dense Error Correction via 1 -Minimization John Wright, Student Member, and Yi Ma, Senior Member. J. ...
Minimization of Fuzzy Finite Generalized Automata_专业资料。维普资讯 http://www.cqvip.com Ma.o6r2o Junlfetoi cec n ehooyoChn ora Elcrnc...
MINIMIZATION OF ENTROPY FUNCTIONALS ? CHRISTIAN LEONARD arXiv:0710.1462v1 [math.OC] 8 Oct 2007 Abstract. Entropy functionals (i.e. convex integral ...
Cultural Algorithm for Minimization of Binary Decision Diagram and Its Application in Crosstalk_专业资料。ItrainlJunlo tmainadCouignenta ora foAuoto n mpt n ...
The principle of minimization of the equivalent load for design of launching vertical shiplift_材料科学_工程科技_专业资料。The p rinciple of minimization ...
Airflow adjustment and minimization of the air power of ventilation network_专业资料。JoURNAL0FCOALSENCE&ENGI CINEERING (CHINA)P 3—4 P27—22 DOI1.07s...
热门文档