Filters

27,904 Hits in 6.8 sec

### The program decision logic approach to predicated execution

David I. August, John W. Sias, Jean-Michel Puiatti, Scott A. Mahlke, Daniel A. Connors, Kevin M. Crozier, Wen-mei W. Hwu
1999 SIGARCH Computer Architecture News
This network is modeled as a Boolean equation and minimized using modified versions of logic synthesis techniques.  ...  After minimization, the more efficient version of the program's original control flow is re-expressed in predicated code.  ...  We would like to express our appreciation to Ron Barnes for his help with the execution of the final experiments.  ...

### A Heuristic Approach to Two Level Boolean Minimization Derived from Karnaugh Mapping [article]

Ethan L. Childerhose, Jingzhou Liu
2020 arXiv   pre-print
The following paper presents a heuristic method by which sum-of-product Boolean expressions can be simplified with a specific focus on the removal of redundant and selective prime implicants.  ...  Existing methods, such as the Karnaugh map and the Quine-McCluskey method [1, 2], fail to scale since they increase exponentially in complexity as the quantity of literals increases, doing as such to ensure  ...  The purpose of this paper is to demonstrate a new heuristic and expandable approach that accomplishes two level Boolean simplification in a more efficient manner than current methods. 1 Given ĀCD + ĀBC  ...

### Optimal Boolean Function Simplification through K-Map using Object-Oriented Algorithm

Arunachalam Solairaju, Rajupillai Periyasamy
2011 International Journal of Computer Applications
Why is the minimization of the Boolean expression needed? By simplifying the logic function, we can reduce the original number of digital components (gates) required to implement digital circuits.  ...  Later Quine and McCluskey reported tabular algorithmic techniques for the optimal Boolean function minimization.  ...  Normally a Boolean expression can be given using two forms: 1 Sum-of-Products (SOP): This is the more common form of Boolean expressions.  ...

### Program decision logic optimization using predication and control speculation

W.-M.W. Hwu, D.I. August, J.W. Sias
2001 Proceedings of the IEEE
This abstraction is then applied to optimize the program's control component, transforming it into a form more amenable to instruction level parallel (ILP) execution.  ...  The mainstream arrival of predication, a means other than branching of selecting instructions for execution, has required compiler architects to reformulate fundamental analyses and transformations.  ...  Puiatti for his help with their initial work in Boolean optimization and Prof. F. Najm for the insight he has provided into the nature of the BDD.  ...

### Optimizing Consistency-Based Design of Context-Sensitive Gene Regulatory Networks

Yufei Xiao, Edward R. Dougherty
2006 IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications
Regarding constrained connectivity, we rephrase it as a lossy coding problem and develop an algorithm to find a best subset of predictors from the full set of predictors with the objective of minimizing  ...  Regarding generalization, we combine connectivity and minimal logical realization to formulate the optimality criterion and propose two algorithms to solve it, the second algorithm guaranteeing a minimally  ...  Theorem 1: [8] Any minimal sum-of-products expression of a Boolean function is equivalent to a sum of prime implicants of .  ...

### تحليل رمزي مستند للجبر البولاني لمعولية النظم المتسقة متعددة الحالات ذات المركبات غير المتجانسة

علي محمد علي رشدي علي محمد علي رشدي
2020 journal of King Abdulaziz University Computing and Information Technology Sciences
Acknowledgement The first-named author (AMR) benefited from (and is grateful for) his earlier collaboration and enlightening discussions with Engineer Mahmoud Rushdi, Munich, Germany.  ...  of and , and the binary expressions 1 , 2 , and 3 are given by their minimal sum-of-products forms in (35) .  ...  These expressions are given as minimal sum-of-products formulas or as probabilityready expressions.  ...

### Synthesis of spp three-level logic networks using affine spaces

V. Ciriani
2003 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Recently defined, three-level logic sum of pseudoproducts (SPP) forms are EXOR-AND-OR networks representing Boolean functions, and are much shorter than standard two-level sum of products (SOP) expressions  ...  In order to validate our approach, the results are compared with those obtained for the major two-and three-level forms using standard metrics.  ...  more compact than two-level, and are often more compact than EX-SOP networks (see Section V); 3) employing EXOR gates often facilitates circuit testing; 4) to our knowledge, SPP minimization is one of  ...

### Page 94 of Journal of Research and Practice in Information Technology Vol. 16, Issue 3 [page]

1984 Journal of Research and Practice in Information Technology
If My > Mp and Mg is odd, then we get two types of tails in S, one with size h(Mz/2) and other with size h(M2/2)—1. Each type can have no more than Mj distinct tails. So p< 2Mp.  ...  Hence, the rest of the 512 — 210 = 302 combinations represent ‘‘don’t care”’ con- ditions and these are selectively used to obtain the minimal sum-of-products expression for S; the minimal expression is  ...

### Optimal Two-Level Boolean Minimization [chapter]

Robert P. Dick
2016 Encyclopedia of Algorithms
Applications Digital computers are composed of precisely two things: (1) implementations of Boolean logic functions and (2) memory elements.  ...  The Quine-McCluskey method is used to permit efficient implementation of Boolean logic functions in a wide range of digital logic devices, including computers.  ...  Problem Definition Find a minimal sum-of-products expression for a Boolean function. Consider a Boolean algebra with elements False and True.  ...

### A fast algorithm for or-and-or synthesis

D. Debnath, Z.G. Vranesic
2003 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Each output of the network realizes a sum-of-complex-terms expression, where a complex term (CT) is similar to a product-of-sums expression.  ...  This paper presents TRIMIN, a fast heuristic algorithm for designing OR-AND-OR networks from sum-of-products expressions.  ...  We have argued in Section III that CTs with a relative cost less than 1.00 are usually more useful than other CTs, but the relative costs of CTs generated by using the Boolean method are sometimes more  ...

### Minimization of Multiple Value function using Quine Mc-Cluskey Technique

Prashant S., Gajanan Sarate
2016 International Journal of Computer Applications
It incorporates all designed rules for ternary logic system design and gives the output in the form of Sum-of-Product (SOP) terms.  ...  The ternary digital system which radix=3 is considered here minimized function of MVL function implemented using decoder and multiplexer and answer is verified using ternary k-map.  ...  A º • Bº (23) of one or more variables may be represented in truth table or K-map form or algebraically in canonical form as a product of sum or sum of product.  ...

### Canonical restricted mixed-polarity exclusive-OR sums of products and the efficient algorithm for their minimisation

L. Csanky, M.A. Perkowski, I. Schäfer
1993 IEE Proceedings E (Computers and Digital Techniques)
The set of CRMP forms is included in the set of exclusive-OR sum-of-product (ESOP) expressions.  ...  The concept of canonical restricted mixed polarity (CRMP) exclusive-OR sum of products forms is introduced.  ...  Introduction It has long been the experience of logic designers that exclusive-OR sum-of-product (ESOP) expressions, AND-EXOR, are more economical than the conventional inclusive sum-of-product (SOP),  ...

### Pseudo-Kronecker expressions for symmetric functions

R. Drechsler
1999 IEEE transactions on computers
AbstractÐPseudo-Kronecker Expressions (PSDKROs) are a class of AND/ EXOR expressions.  ...  Experimental results are given to show the efficiency of the presented approach in comparison to previously published work on AND/EXOR minimization.  ...  ACKNOWLEDGMENTS The author would like to thank Ralph Werchner for inspiring the idea of the proof of Theorem 1.  ...

### Design-of-experiments based design rule optimization

Abde Ali Kagalwalla, Swamy Muddu, Luigi Capodieci, Coby Zelnik, Puneet Gupta, Mark E. Mason
2012 Design for Manufacturability through Design-Process Integration VI
By analyzing the impact of DRs on layout scaling, we propose a novel Boolean minimization based approach to reduce the number of layouts that need to be generated through compaction.  ...  Our methodology results in 10 − 10 5 × reduction in the number of layouts that need to be generated through compaction, and demonstrates the impact of MOL and Metal1 DRs on the area of some standard cell  ...  We can then write a Sum-of-Products form Boolean expression for A t with each DR d i represented as a Boolean variable b i .  ...

### Fuzzy modelling through logic optimization

A.F. Gobi, W. Pedrycz
2007 International Journal of Approximate Reasoning
By recognizing the fundamental links between binary (two-valued) and fuzzy (multi-valued) logic, effective structural learning is achieved through the use of well-established methods of Boolean minimization  ...  The introduced structure along with the learning mechanisms helps achieve high accuracy and interpretability (transparency) of the resulting model.  ...  Pedrycz) and the Natural Sciences and Engineering Research Council (NSERC) is gratefully acknowledged.  ...
« Previous Showing results 1 — 15 out of 27,904 results