DOCSLIB.ORG

Least Sensitive (Most Robust) Fuzzy “Exclusive Or” Operations

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Least Sensitive (Most Robust) Fuzzy “Exclusive Or” Operations Need for Fuzzy . A Crisp \Exclusive Or" . Need for the Least . Least Sensitive For t-Norms and t- . Definition of a Fuzzy . (Most Robust) Main Result Interpretation of the . Fuzzy \Exclusive Or" Fuzzy \Exclusive Or" . Operations Home Page Title Page 1 2 Jesus E. Hernandez and Jaime Nava JJ II 1Department of Electrical and J I Computer Engineering 2Department of Computer Science Page1 of 13 University of Texas at El Paso Go Back El Paso, TX 79968 [email protected] Full Screen [email protected] Close Quit Need for Fuzzy . 1. Need for Fuzzy \Exclusive Or" Operations A Crisp \Exclusive Or" . Need for the Least . • One of the main objectives of fuzzy logic is to formalize For t-Norms and t- . commonsense and expert reasoning. Definition of a Fuzzy . • People use logical connectives like \and" and \or". Main Result • Commonsense \or" can mean both \inclusive or" and Interpretation of the . \exclusive or". Fuzzy \Exclusive Or" . Home Page • Example: A vending machine can produce either a coke or a diet coke, but not both. Title Page • In mathematics and computer science, \inclusive or" JJ II is the one most frequently used as a basic operation. J I • Fact: \Exclusive or" is also used in commonsense and Page2 of 13 expert reasoning. Go Back • Thus: There is a practical need for a fuzzy version. Full Screen • Comment: \exclusive or" is actively used in computer Close design and in quantum computing algorithms Quit Need for Fuzzy . 2. A Crisp \Exclusive Or" Operation: A Reminder A Crisp \Exclusive Or" . Need for the Least . • Fuzzy analogue of a classical logic operation op: For t-Norms and t- . { we know the experts' degree of belief a = d(A) and Definition of a Fuzzy . b = d(B) in statements A and B; Main Result { based on a and b, we want to estimate the degree Interpretation of the . of belief in \A op B", as fop(a; b). Fuzzy \Exclusive Or" . • For op = & , we get an \and"-operation (t-norm). Home Page • For op = _, we get an \or"-operation (t-conorm). Title Page • As usual, the fuzzy \exclusive or" operation must be JJ II an extension of the corresponding crisp operation ⊕. J I • In the traditional 2-valued logic, 0 ⊕ 0 = 1 ⊕ 1 = 0 and Page3 of 13 0 ⊕ 1 = 1 ⊕ 0 = 1. Go Back • Thus, the desired fuzzy \exclusive or" operation f⊕(a; b) Full Screen must satisfy the same properties: Close f⊕(0; 0) = f⊕(1; 1) = 0; f⊕(0; 1) = f⊕(1; 0) = 1: Quit Need for Fuzzy . 3. Need for the Least Sensitivity: Reminder A Crisp \Exclusive Or" . Need for the Least . • One of the main ways to elicit degree of certainty d is For t-Norms and t- . to ask to pick a value on a scale. Example: Definition of a Fuzzy . { on a scale of 0 to 10, an expert picks 8, so we get Main Result d = 8=10 = 0:8; Interpretation of the . { on a scale from 0 to 8, whatever we pick, we cannot Fuzzy \Exclusive Or" . Home Page get 0.8: 6=8 = 0:75 < 0:8; 7=8 = 0:875 > 0:8. { the expert will probably pick 6, with Title Page d0 = 6=8 = 0:75 ≈ 0:8: JJ II • It is desirable: that the result of the fuzzy operation J I not change much if we slightly change the inputs: Page4 of 13 0 0 0 0 jf(a; b) − f(a ; b )j ≤ k · max(ja − a j; jb − b j); Go Back with the smallest possible k. Full Screen • Such operations are called the least sensitive or the Close most robust. Quit Need for Fuzzy . 4. For t-Norms and t-Conorms, the Least Sensi- A Crisp \Exclusive Or" . tivity Requirement Leads to Reasonable Oper- Need for the Least . ations For t-Norms and t- . Definition of a Fuzzy . • Known results: Main Result { There is only one least sensitive t-norm (\and"- Interpretation of the . operation) Fuzzy \Exclusive Or" . f&(a; b) = min(a; b): Home Page { There is also only one least sensitive t-conorm (\or"- Title Page operation) JJ II f_(a; b) = max(a; b): J I • What we do in this presentation: we describe the least Page5 of 13 sensitive fuzzy \exclusive or" operation. Go Back Full Screen Close Quit Need for Fuzzy . 5. Definition of a Fuzzy Exclusive-Or Operation A Crisp \Exclusive Or" . Need for the Least . • Definition: A function f : [0; 1] × [0; 1] ! [0; 1] is For t-Norms and t- . called a fuzzy \exclusive or" operation if Definition of a Fuzzy . f(0; 0) = f(1; 1) = 0 and f(0; 1) = f(1; 0) = 1: Main Result Interpretation of the . • Comment: We could also require other conditions, e.g., Fuzzy \Exclusive Or" . commutativity and associativity. Home Page • However, our main objective is to select a single oper- Title Page ation which is the least sensitive. JJ II • Fact: The weaker the condition, the larger the class of J I operations that satisfy these conditions. Page6 of 13 • Thus: the stronger the result that our operation is the Go Back least sensitive in this class. Full Screen • Conclusion: We select the weakest possible condition to make our result as strong as possible. Close Quit Need for Fuzzy . 6. Main Result A Crisp \Exclusive Or" . Need for the Least . Definition: For t-Norms and t- . • Let F be a class of functions from [0; 1]×[0; 1] to [0; 1]. Definition of a Fuzzy . • We say that a function f 2 F is the least sensitive in Main Result the class F if it satisfies the following two conditions: Interpretation of the . Fuzzy \Exclusive Or" . { for some real number k, the function f satisfies the Home Page condition Title Page jf(a; b) − f(a0; b0)j ≤ k · max(ja − a0j; jb − b0j); JJ II { no other function f 2 F satisfies this condition. J I Theorem: In the class of all fuzzy \exclusive or" opera- Page7 of 13 tions, the following function is the least sensitive: Go Back f⊕(a; b) = min(max(a; b); max(1 − a; 1 − b)): Full Screen Close Quit Need for Fuzzy . 7. Interpretation of the Main Result A Crisp \Exclusive Or" . Need for the Least . • Reminder: the least sensitive operation is For t-Norms and t- . f⊕(a; b) = min(max(a; b); max(1 − a; 1 − b)): Definition of a Fuzzy . Main Result • Fact: in 2-valued logic, \exclusive or" ⊕ can be de- Interpretation of the . scribed in terms of the \inclusive or" operation _ as Fuzzy \Exclusive Or" . a ⊕ b , (a _ b)&:(a & b): Home Page • Natural idea: Title Page { replace _ with the least sensitive \or"-operation JJ II f_(a; b) = max(a; b), J I { replace & with the least sensitive \and"-operation Page8 of 13 f&(a; b) = min(a; b), and Go Back { replace : with the least sensitive negation opera- Full Screen tion f:(a) = 1 − a, Close • Result: we get the expression given in the Theorem. Quit Need for Fuzzy . 8. Proof of the Main Result: 1st Condition A Crisp \Exclusive Or" . Need for the Least . • Reminder: f (a; b) = min(max(a; b); max(1−a; 1−b)). ⊕ For t-Norms and t- . • We need to prove the following two conditions: Definition of a Fuzzy . Main Result { 1st: that this function f⊕(a; b) satisfies the follow- ing condition with k = 1: Interpretation of the . Fuzzy \Exclusive Or" . 0 0 0 0 jf(a; b) − f(a ; b )j ≤ k · max(ja − a j; jb − b j); Home Page { 2nd: that no other \exclusive or" operation satisfies Title Page this property. JJ II • 1st condition: let us prove that for every " > 0, if J I 0 0 ja − a j ≤ " and jb − b j ≤ ", then Page9 of 13 0 0 jf⊕(a; b) − f⊕(a ; b )j ≤ ": Go Back • It is known: that the functions min(a; b), max(a; b), Full Screen and 1 − a satisfy the above condition with k = 1. Close Quit Need for Fuzzy . 9. Proof of the Main Result (cont-d) A Crisp \Exclusive Or" . Need for the Least . 0 0 • Known results: if ja − a j ≤ " and jb − b j ≤ ", then the For t-Norms and t- . following three inequalities hold: Definition of a Fuzzy . 0 0 j max(a; b) − max(a ; b )j ≤ "; Main Result Interpretation of the . j(1 − a) − (1 − a0)j ≤ "; and j(1 − b) − (1 − b0)j ≤ ": Fuzzy \Exclusive Or" . • From the result above, by using the condition for the Home Page max operation, we conclude that Title Page 0 0 j max(1 − a; 1 − b) − max(1 − a ; 1 − b )j ≤ ": JJ II • Now, from the results above, by using the condition for J I the min operation, we conclude that Page 10 of 13 j min(max(a; b); max(1 − a; 1 − b)) Go Back − min(max(a0; b0); max(1 − a0; 1 − b0))j ≤ ": Full Screen • The statement is proven. Close Quit Need for Fuzzy . 10. Fuzzy \Exclusive Or" Operations f(a; b) Which A Crisp \Exclusive Or" . Are the Least Sensitive on Average Need for the Least . For t-Norms and t- . • Idea: select f so that on average, the change in a and b Definition of a Fuzzy . leads to the smallest possible change ∆c in c = f(a; b). Main Result • Assumption: ∆a and ∆b are independent random vari- Interpretation of the . 2 ables with 0 mean and small variance σ . Fuzzy \Exclusive Or" . • Objective: estimate ∆c = f(a + ∆a; b + ∆b) − f(a; b): Home Page • Since ∆a and ∆b are small, we can keep only linear Title Page terms in the Taylor series of ∆c w.r.t.
Load more

Recommended publications
  • Automated Unbounded Verification of Stateful Cryptographic Protocols
    Automated Unbounded Verification of Stateful Cryptographic Protocols with Exclusive OR Jannik Dreier Lucca Hirschi Sasaˇ Radomirovic´ Ralf Sasse Universite´ de Lorraine Department of School of Department of CNRS, Inria, LORIA Computer Science Science and Engineering Computer Science F-54000 Nancy ETH Zurich University of Dundee ETH Zurich France Switzerland UK Switzerland [email protected] [email protected] [email protected] [email protected] Abstract—Exclusive-or (XOR) operations are common in cryp- on widening the scope of automated protocol verification tographic protocols, in particular in RFID protocols and elec- by extending the class of properties that can be verified to tronic payment protocols. Although there are numerous appli- include, e.g., equivalence properties [19], [24], [27], [51], cations, due to the inherent complexity of faithful models of XOR, there is only limited tool support for the verification of [14], extending the adversary model with complex forms of cryptographic protocols using XOR. compromise [13], or extending the expressiveness of protocols, The TAMARIN prover is a state-of-the-art verification tool e.g., by allowing different sessions to update a global, mutable for cryptographic protocols in the symbolic model. In this state [6], [43]. paper, we improve the underlying theory and the tool to deal with an equational theory modeling XOR operations. The XOR Perhaps most significant is the support for user-specified theory can be freely combined with all equational theories equational theories allowing for the modeling of particular previously supported, including user-defined equational theories. cryptographic primitives [21], [37], [48], [24], [35].
    [Show full text]
  • CS 50010 Module 1
    CS 50010 Module 1 Ben Harsha Apr 12, 2017 Course details ● Course is split into 2 modules ○ Module 1 (this one): Covers basic data structures and algorithms, along with math review. ○ Module 2: Probability, Statistics, Crypto ● Goal for module 1: Review basics needed for CS and specifically Information Security ○ Review topics you may not have seen in awhile ○ Cover relevant topics you may not have seen before IMPORTANT This course cannot be used on a plan of study except for the IS Professional Masters program Administrative details ● Office: HAAS G60 ● Office Hours: 1:00-2:00pm in my office ○ Can also email for an appointment, I’ll be in there often ● Course website ○ cs.purdue.edu/homes/bharsha/cs50010.html ○ Contains syllabus, homeworks, and projects Grading ● Module 1 and module are each 50% of the grade for CS 50010 ● Module 1 ○ 55% final ○ 20% projects ○ 20% assignments ○ 5% participation Boolean Logic ● Variables/Symbols: Can only be used to represent 1 or 0 ● Operations: ○ Negation ○ Conjunction (AND) ○ Disjunction (OR) ○ Exclusive or (XOR) ○ Implication ○ Double Implication ● Truth Tables: Can be defined for all of these functions Operations ● Negation (¬p, p, pC, not p) - inverts the symbol. 1 becomes 0, 0 becomes 1 ● Conjunction (p ∧ q, p && q, p and q) - true when both p and q are true. False otherwise ● Disjunction (p v q, p || q, p or q) - True if at least one of p or q is true ● Exclusive Or (p xor q, p ⊻ q, p ⊕ q) - True if exactly one of p or q is true ● Implication (p → q) - True if p is false or q is true (q v ¬p) ●
    [Show full text]
  • Logic, Proofs
    CHAPTER 1 Logic, Proofs 1.1. Propositions A proposition is a declarative sentence that is either true or false (but not both). For instance, the following are propositions: “Paris is in France” (true), “London is in Denmark” (false), “2 < 4” (true), “4 = 7 (false)”. However the following are not propositions: “what is your name?” (this is a question), “do your homework” (this is a command), “this sentence is false” (neither true nor false), “x is an even number” (it depends on what x represents), “Socrates” (it is not even a sentence). The truth or falsehood of a proposition is called its truth value. 1.1.1. Connectives, Truth Tables. Connectives are used for making compound propositions. The main ones are the following (p and q represent given propositions): Name Represented Meaning Negation p “not p” Conjunction p¬ q “p and q” Disjunction p ∧ q “p or q (or both)” Exclusive Or p ∨ q “either p or q, but not both” Implication p ⊕ q “if p then q” Biconditional p → q “p if and only if q” ↔ The truth value of a compound proposition depends only on the value of its components. Writing F for “false” and T for “true”, we can summarize the meaning of the connectives in the following way: 6 1.1. PROPOSITIONS 7 p q p p q p q p q p q p q T T ¬F T∧ T∨ ⊕F →T ↔T T F F F T T F F F T T F T T T F F F T F F F T T Note that represents a non-exclusive or, i.e., p q is true when any of p, q is true∨ and also when both are true.
    [Show full text]
  • Hardware Abstract the Logic Gates References Results Transistors Through the Years Acknowledgements
    The Practical Applications of Logic Gates in Computer Science Courses Presenters: Arash Mahmoudian, Ashley Moser Sponsored by Prof. Heda Samimi ABSTRACT THE LOGIC GATES Logic gates are binary operators used to simulate electronic gates for design of circuits virtually before building them with-real components. These gates are used as an instrumental foundation for digital computers; They help the user control a computer or similar device by controlling the decision making for the hardware. A gate takes in OR GATE AND GATE NOT GATE an input, then it produces an algorithm as to how The OR gate is a logic gate with at least two An AND gate is a consists of at least two A NOT gate, also known as an inverter, has to handle the output. This process prevents the inputs and only one output that performs what inputs and one output that performs what is just a single input with rather simple behavior. user from having to include a microprocessor for is known as logical disjunction, meaning that known as logical conjunction, meaning that A NOT gate performs what is known as logical negation, which means that if its input is true, decision this making. Six of the logic gates used the output of this gate is true when any of its the output of this gate is false if one or more of inputs are true. If all the inputs are false, the an AND gate's inputs are false. Otherwise, if then the output will be false. Likewise, are: the OR gate, AND gate, NOT gate, XOR gate, output of the gate will also be false.
    [Show full text]
  • Boolean Algebra
    Boolean Algebra ECE 152A – Winter 2012 Reading Assignment Brown and Vranesic 2 Introduction to Logic Circuits 2.5 Boolean Algebra 2.5.1 The Venn Diagram 2.5.2 Notation and Terminology 2.5.3 Precedence of Operations 2.6 Synthesis Using AND, OR and NOT Gates 2.6.1 Sum-of-Products and Product of Sums Forms January 11, 2012 ECE 152A - Digital Design Principles 2 Reading Assignment Brown and Vranesic (cont) 2 Introduction to Logic Circuits (cont) 2.7 NAND and NOR Logic Networks 2.8 Design Examples 2.8.1 Three-Way Light Control 2.8.2 Multiplexer Circuit January 11, 2012 ECE 152A - Digital Design Principles 3 Reading Assignment Roth 2 Boolean Algebra 2.3 Boolean Expressions and Truth Tables 2.4 Basic Theorems 2.5 Commutative, Associative, and Distributive Laws 2.6 Simplification Theorems 2.7 Multiplying Out and Factoring 2.8 DeMorgan’s Laws January 11, 2012 ECE 152A - Digital Design Principles 4 Reading Assignment Roth (cont) 3 Boolean Algebra (Continued) 3.1 Multiplying Out and Factoring Expressions 3.2 Exclusive-OR and Equivalence Operation 3.3 The Consensus Theorem 3.4 Algebraic Simplification of Switching Expressions January 11, 2012 ECE 152A - Digital Design Principles 5 Reading Assignment Roth (cont) 4 Applications of Boolean Algebra Minterm and Maxterm Expressions 4.3 Minterm and Maxterm Expansions 7 Multi-Level Gate Circuits NAND and NOR Gates 7.2 NAND and NOR Gates 7.3 Design of Two-Level Circuits Using NAND and NOR Gates 7.5 Circuit Conversion Using Alternative Gate Symbols January 11, 2012 ECE 152A - Digital Design Principles 6 Boolean Algebra Axioms of Boolean Algebra Axioms generally presented without proof 0 · 0 = 0 1 + 1 = 1 1 · 1 = 1 0 + 0 = 0 0 · 1 = 1 · 0 = 0 1 + 0 = 0 + 1 = 1 if X = 0, then X’ = 1 if X = 1, then X’ = 0 January 11, 2012 ECE 152A - Digital Design Principles 7 Boolean Algebra The Principle of Duality from Zvi Kohavi, Switching and Finite Automata Theory “We observe that all the preceding properties are grouped in pairs.
    [Show full text]
  • Exclusive Or. Compound Statements. Order of Operations. Logically Equivalent Statements
    MATH110 Lecturenotes–1 Exclusive or. Compound statements. Order of operations. Logically equivalent statements. Expressing some operations in terms of others. Exclusive or (exclusive disjunction). Exclusive or (aka exclusive disjunction) is an operation denoted by ⊕ and defined by the following truth table: P Q P ⊕ Q T T F T F T F T T F F F So, P ⊕ Q means “either P or Q, but not both.” Compound statements. A compound statement is an expression with one or more propositional vari- able(s) and two or more logical connectives (operators). Examples: • (P ∧ Q) → R • (¬P → (Q ∨ P )) ∨ (¬Q) • ¬(¬P ). Given the truth value of each propositional variable, we can determine the truth value of the compound statement. 1 Order of operations. Just like in algebra, expressions in parentheses are evaluated first. Otherwise, negations are performed first, then conjunctions, followed by disjunctions (in- cluding exclusive disjunctions), implications, and, finally, the biconditionals. For example, if P is True, Q is False, and R is True, then the truth value of ¬P → Q∧(R∨P ) is computed as follows: first, in parentheses we have R∨P is True, next, ¬P is False, then Q ∧ (R ∨ P ) is False, so ¬P → Q ∧ (R ∨ P ) is True. In other words, ¬P → Q ∧ (R ∨ P ) is equivalent to (¬P ) → (Q ∧ (R ∨ P )). Remark. The order given above is the most often used one. Some authors use other orders. In particular, many authors treat ∧ and ∨ equally (so these are evaluated in the order in which they appear in the expression, just like × and ÷ in algebra), and → and ↔ equally (but after ∧ and ∨, like + and − are performed after × and ÷).
    [Show full text]
  • But Not Both: the Exclusive Disjunction in Qualitative Comparative Analysis (QCA)’
    ‘But Not Both: The Exclusive Disjunction in Qualitative Comparative Analysis (QCA)’ Ursula Hackett Department of Politics and International Relations, University of Oxford [email protected] This paper has been accepted for publication and will appear in a revised form, subsequent to editorial input by Springer, in Quality and Quantity, International Journal of Methodology. Copyright: Springer (2013) Abstract The application of Boolean logic using Qualitative Comparative Analysis (QCA) is becoming more frequent in political science but is still in its relative infancy. Boolean ‘AND’ and ‘OR’ are used to express and simplify combinations of necessary and sufficient conditions. This paper draws out a distinction overlooked by the QCA literature: the difference between inclusive- and exclusive-or (OR and XOR). It demonstrates that many scholars who have used the Boolean OR in fact mean XOR, discusses the implications of this confusion and explains the applications of XOR to QCA. Although XOR can be expressed in terms of OR and AND, explicit use of XOR has several advantages: it mirrors natural language closely, extends our understanding of equifinality and deals with mutually exclusive clusters of sufficiency conditions. XOR deserves explicit treatment within QCA because it emphasizes precisely the values that make QCA attractive to political scientists: contextualization, confounding variables, and multiple and conjunctural causation. The primary function of the phrase ‘either…or’ is ‘to emphasize the indifference of the two (or more) things…but a secondary function is to emphasize the mutual exclusiveness’, that is, either of the two, but not both (Simpson 2004). The word ‘or’ has two meanings: Inclusive ‘or’ describes the relation ‘A or B or both’, and can also be written ‘A and/or B’.
    [Show full text]
  • On the Additive Differential Probability of Exclusive-Or
    On the Additive Differential Probability of Exclusive-Or Helger Lipmaa1, Johan Wall´en1, and Philippe Dumas2 1 Laboratory for Theoretical Computer Science Helsinki University of Technology P.O.Box 5400, FIN-02015 HUT, Espoo, Finland {helger,johan}@tcs.hut.fi 2 Algorithms Project INRIA Rocquencourt 78153 Le Chesnay Cedex, France [email protected] Abstract. We study the differential probability adp⊕ of exclusive-or N when differences are expressed using addition modulo 2 . This function is important when analysing symmetric primitives that mix exclusive-or and addition—especially when addition is used to add in the round keys. (Such primitives include idea, Mars, rc6 and Twofish.) We show that adp⊕ can be viewed as a formal rational series with a linear representa- tion in base 8. This gives a linear-time algorithm for computing adp⊕, and enables us to compute several interesting properties like the fraction of impossible differentials, and the maximal differential probability for any given output difference. Finally, we compare our results with the dual results of Lipmaa and Moriai on the differential probability of addition N modulo 2 when differences are expressed using exclusive-or. Keywords. Additive differential probability, differential cryptanalysis, rational series. 1 Introduction Symmetric cryptographic primitives like block ciphers are typically constructed from a small set of simple building blocks like bitwise exclusive-or and addition modulo 2N . Surprisingly little is known about how these two operations interact with respect to different cryptanalytic attacks, and some of the fundamental re- lations between them have been established only recently [LM01,Lip02,Wal03]. Our goal is to share light to this question by studying the interaction of these two operations in one concrete application: differential cryptanalysis [BS91], by studying the differential probability of exclusive-or when differences are ex- pressed using addition modulo 2N .
    [Show full text]
  • Exclusive Or from Wikipedia, the Free Encyclopedia
    New features Log in / create account Article Discussion Read Edit View history Exclusive or From Wikipedia, the free encyclopedia "XOR" redirects here. For other uses, see XOR (disambiguation), XOR gate. Navigation "Either or" redirects here. For Kierkegaard's philosophical work, see Either/Or. Main page The logical operation exclusive disjunction, also called exclusive or (symbolized XOR, EOR, Contents EXOR, ⊻ or ⊕, pronounced either / ks / or /z /), is a type of logical disjunction on two Featured content operands that results in a value of true if exactly one of the operands has a value of true.[1] A Current events simple way to state this is "one or the other but not both." Random article Donate Put differently, exclusive disjunction is a logical operation on two logical values, typically the values of two propositions, that produces a value of true only in cases where the truth value of the operands differ. Interaction Contents About Wikipedia Venn diagram of Community portal 1 Truth table Recent changes 2 Equivalencies, elimination, and introduction but not is Contact Wikipedia 3 Relation to modern algebra Help 4 Exclusive “or” in natural language 5 Alternative symbols Toolbox 6 Properties 6.1 Associativity and commutativity What links here 6.2 Other properties Related changes 7 Computer science Upload file 7.1 Bitwise operation Special pages 8 See also Permanent link 9 Notes Cite this page 10 External links 4, 2010 November Print/export Truth table on [edit] archived The truth table of (also written as or ) is as follows: Venn diagram of Create a book 08-17094 Download as PDF No.
    [Show full text]
  • Combinational Logic Circuits
    CHAPTER 4 COMBINATIONAL LOGIC CIRCUITS ■ OUTLINE 4-1 Sum-of-Products Form 4-10 Troubleshooting Digital 4-2 Simplifying Logic Circuits Systems 4-3 Algebraic Simplification 4-11 Internal Digital IC Faults 4-4 Designing Combinational 4-12 External Faults Logic Circuits 4-13 Troubleshooting Prototyped 4-5 Karnaugh Map Method Circuits 4-6 Exclusive-OR and 4-14 Programmable Logic Devices Exclusive-NOR Circuits 4-15 Representing Data in HDL 4-7 Parity Generator and Checker 4-16 Truth Tables Using HDL 4-8 Enable/Disable Circuits 4-17 Decision Control Structures 4-9 Basic Characteristics of in HDL Digital ICs M04_WIDM0130_12_SE_C04.indd 136 1/8/16 8:38 PM ■ CHAPTER OUTCOMES Upon completion of this chapter, you will be able to: ■■ Convert a logic expression into a sum-of-products expression. ■■ Perform the necessary steps to reduce a sum-of-products expression to its simplest form. ■■ Use Boolean algebra and the Karnaugh map as tools to simplify and design logic circuits. ■■ Explain the operation of both exclusive-OR and exclusive-NOR circuits. ■■ Design simple logic circuits without the help of a truth table. ■■ Describe how to implement enable circuits. ■■ Cite the basic characteristics of TTL and CMOS digital ICs. ■■ Use the basic troubleshooting rules of digital systems. ■■ Deduce from observed results the faults of malfunctioning combina- tional logic circuits. ■■ Describe the fundamental idea of programmable logic devices (PLDs). ■■ Describe the steps involved in programming a PLD to perform a simple combinational logic function. ■■ Describe hierarchical design methods. ■■ Identify proper data types for single-bit, bit array, and numeric value variables.
    [Show full text]
  • (XOR) Using DNA “String Tile” Self-Assembly Hao Yan,* Liping Feng, Thomas H
    Published on Web 10/30/2003 Parallel Molecular Computations of Pairwise Exclusive-Or (XOR) Using DNA “String Tile” Self-Assembly Hao Yan,* Liping Feng, Thomas H. LaBean, and John H. Reif* Department of Computer Science, Duke UniVersity, Durham, North Carolina 27708 Received June 13, 2003; E-mail: [email protected]; [email protected] DNA computing1 potentially provides a degree of parallelism far beyond that of conventional silicon-based computers. A number of researchers2 have experimentally demonstrated DNA computing in solving instances of the satisfiability problems. Self-assembly of DNA nanostructures is theoretically an efficient method of executing parallel computation where information is encoded in DNA tiles and a large number of tiles can be self-assembled via sticky-end associations. Winfree et al.3 have shown that representa- tions of formal languages can be generated by self-assembly of branched DNA nanostructures and that two-dimensional DNA self- assembly is Turing-universal (i.e., capable of universal computa- tion). Mao et al.4 experimentally implemented the first algorithmic DNA self-assembly which performed a logical computation (cu- mulative exclusive-or (XOR)); however, that study only executed two computations on fixed input. To further explore the power of computing using DNA self-assembly, experimental demonstrations of parallel computations are required. Here, we describe the first parallel molecular computation using DNA tiling self-assembly in which a large number of distinct input are simultaneously processed. The experiments described here are based on the “string tile” model proposed by Winfree et al.,5 where they investigated Figure 1. Parallel computing of pairwise XOR by self-assembly of DNA tiles.
    [Show full text]
  • Quadruple 2-Input Exclusive-OR Gate Datasheet
    74AC11086 QUADRUPLE 2-INPUT EXCLUSIVE-OR GATE SCAS081A – NOVEMBER 1989 – REVISED APRIL 1996 D Center-Pin VCC and GND Configurations D OR N PACKAGE Minimize High-Speed Switching Noise (TOP VIEW) D EPIC (Enhanced-Performance Implanted 1A 1B CMOS) 1-µm Process 1 16 1Y 2 15 2A D 500-mA Typical Latch-Up Immunity at 2Y 3 14 2B 125°C GND 4 13 V D CC Package Options Include Plastic GND 5 12 VCC Small-Outline (D) Packages and Standard 3Y 6 11 3A Plastic 300-mil DIPs (N) 4Y 7 10 3B 4B 8 9 4A description This device contains four independent 2-input exclusive-OR gates. It performs the Boolean function Y = A ⊕ B = AB + AB in positive logic. A common application is as a true/complement element. If one of the inputs is low, the other input is reproduced in true form at the output. If one of the inputs is high, the signal on the other input is reproduced inverted at the output. The 74AC11086 is characterized for operation from –40°C to 85°C. FUNCTION TABLE (each gate) INPUTS OUTPUT A B Y L L L L HH H LH H H L logic symbol† 1 1A =1 2 16 1Y 1B 15 2A 3 14 2Y 2B 11 3A 6 10 3Y 3B 9 4A 7 8 4Y 4B † This symbol is in accordance with ANSI/IEEE Std 91-1984 and IEC Publication 617-12. Please be aware that an important notice concerning availability, standard warranty, and use in critical applications of Texas Instruments semiconductor products and disclaimers thereto appears at the end of this data sheet.
    [Show full text]