A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Filters
The program decision logic approach to predicated execution
1999
SIGARCH Computer Architecture News
Preserved Fulltext
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. ...
doi:10.1145/307338.300997
fatcat:6ixu72lsfbdttcehwqcklbvazq
A Heuristic Approach to Two Level Boolean Minimization Derived from Karnaugh Mapping
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
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 ...
arXiv:2008.09307v3
fatcat:gbnhni7awvamte4vk2ns432wza
Optimal Boolean Function Simplification through K-Map using Object-Oriented Algorithm
2011
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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. ...
doi:10.5120/1959-2621
fatcat:w3j3hsk3qjaunaoqoz65i2q6yu
Program decision logic optimization using predication and control speculation
2001
Proceedings of the IEEE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
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. ...
doi:10.1109/5.964444
fatcat:oqa25wd7yffunn4knvvszqvueq
Optimizing Consistency-Based Design of Context-Sensitive Gene Regulatory Networks
2006
IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
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 . ...
doi:10.1109/tcsi.2006.883883
fatcat:v2btrngm5nhcpgrurxewmdhdpe
تحليل رمزي مستند للجبر البولاني لمعولية النظم المتسقة متعددة الحالات ذات المركبات غير المتجانسة
2020
journal of King Abdulaziz University Computing and Information Technology Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
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. ...
doi:10.4197/comp.9-2.1
fatcat:r7uci45zhreaph2goerq6zslkm
Synthesis of spp three-level logic networks using affine spaces
2003
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
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 ...
doi:10.1109/tcad.2003.818121
fatcat:4jzdi2ej3fekjap6c2hd7wy2r4
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
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
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]
2016
Encyclopedia of Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
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. ...
doi:10.1007/978-1-4939-2864-4_446
fatcat:xkxy4fmw35dwjiyakzmt5nbhuu
A fast algorithm for or-and-or synthesis
2003
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
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 ...
doi:10.1109/tcad.2003.816216
fatcat:5xp3byt7fzgrfnz653h4tgsq54
Minimization of Multiple Value function using Quine Mc-Cluskey Technique
2016
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
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. ...
doi:10.5120/ijca2016910257
fatcat:p6k4t2gxhvetjlf2fyiwpl3x3u
Canonical restricted mixed-polarity exclusive-OR sums of products and the efficient algorithm for their minimisation
1993
IEE Proceedings E (Computers and Digital Techniques)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
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), ...
doi:10.1049/ip-e.1993.0009
fatcat:st5giylrznhyzmgrau5k6q5exu
Pseudo-Kronecker expressions for symmetric functions
1999
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
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. ...
doi:10.1109/12.795226
fatcat:f6qdtggghzc65hxr575h7yqq5u
Design-of-experiments based design rule optimization
2012
Design for Manufacturability through Design-Process Integration VI
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
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 . ...
doi:10.1117/12.918067
fatcat:7uebhnh2szcrnmysg45v7secqi
Fuzzy modelling through logic optimization
2007
International Journal of Approximate Reasoning
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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. ...
doi:10.1016/j.ijar.2006.06.026
fatcat:2ejpeknpuffffor3wrs3k7qig4
« Previous
Showing results 1 — 15 out of 27,904 results