PHY 201 (Blum)1 Some basic electronics and truth tables Some material on truth tables can be found in Chapters 3 through 5 of Digital Principles (Tokheim)

Slides:



Advertisements
Similar presentations
Chapter 4 Gates and Circuits.
Advertisements

(CSC 102) Discrete Structures Lecture 5.
Chapter 4 Gates and Circuits.
Chapter 2 Logic Circuits.
PHY 201 (Blum) 1 Adders, Digital to Analog Conversion Ch. 8 in Digital Principles (Tokheim)
Cosc 2150: Computer Organization Chapter 3: Boolean Algebra and Digital Logic.
Boolean Algebra and Logic Gate
Chapter 4 Gates and Circuits.
Logic Gate Level Combinational Circuits, Part 1. Circuits Circuit: collection of devices physically connected by wires to form a network Net can be: –
Boolean Algebra and Truth Table The mathematics associated with binary number system (or logic) is call Boolean: –“0” and “1”, or “False” and “True” –Calculation.
Lecture 3. Boolean Algebra, Logic Gates
PHY 201 (Blum)1 Karnaugh Maps References: Chapters 4 and 5 in Digital Principles (Tokheim) Chapter 3 in Introduction to Digital Systems (Palmer and Perlman)
3. DIGITAL ELECTRONICS..
Lecture 3. Boolean Algebra, Logic Gates Prof. Sin-Min Lee Department of Computer Science 2x.
Chapter 4 Gates and Circuits. 4–2 Chapter Goals Identify the basic gates and describe the behavior of each Describe how gates are implemented using transistors.
Chapter 4 Gates and Circuits.
Binary Codes Computers and other digital systems "work" with binary numbers. I/P & O/P is usually done using decimal numbers, alphabetics, special symbols.
Lecture 3. Error Detection and Correction, Logic Gates Prof. Sin-Min Lee Department of Computer Science 2x.
Computer Science 101 The Boolean System. George Boole British mathematician ( ) Boolean algebra –Logic –Set theory –Circuits –Conditions in if.
Module 3.  Binary logic consists of :  logic variables  designated by alphabet letters, e.g. A, B, C… x, y, z, etc.  have ONLY 2 possible values:
Systems Architecture I1 Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus so that they.
Chapter 4 Gates and Circuits.
1 Fundamentals of Computer Science Propositional Logic (Boolean Algebra)
CPS120: Introduction to Computer Science
PHY 201 (Blum)1 Some basic electronics and truth tables Some material based on Chapters 3 through 5 of Digital Principles (Tokheim)
1 Boolean Algebra & Logic Gates. 2 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple.
LOGIC GATES & TRUTH TABLE – Digital Circuit 1 Choopan Rattanapoka.
Computer Science 210 Computer Organization Introduction to Boolean Algebra.
Karnaugh Maps References:
Binary Numbers. Why Binary? Maximal distinction among values  minimal corruption from noise Imagine taking the same physical attribute of a circuit,
Combinational Logic 1.
PHY 201 (Blum)1 Transistor Odds and Ends. PHY 201 (Blum)2 RTL NOR.
Logic Gates Logic gates are electronic digital circuit perform logic functions. Commonly expected logic functions are already having the corresponding.
LOGIC GATES.
Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
LOGIC GATES AND CIRCUITS Digital systems are said to be constructed by using logic gates. These gates are the AND, OR, NOT, NAND, NOR, EXOR and EXNOR gates.
PHY 202 (Blum)1 Combinations of Resistors Series, Parallel.
Some basic electronics and truth tables Some material on truth tables can be found in Chapter 3 of Digital Principles (Tokheim)
Transistors, Logic Gates and Karnaugh Maps References: Lecture 4 from last.
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs
1 Lect # 2 Boolean Algebra and Logic Gates Boolean algebra defines rules for manipulating symbolic binary logic expressions. –a symbolic binary logic expression.
Standard & Canonical Forms COE 202 Digital Logic Design Dr. Aiman El-Maleh College of Computer Sciences and Engineering King Fahd University of Petroleum.
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
Logic Simplification-Using Boolean Laws Logic Design Laboratory EE 2121 Lectures By Manesh T EE2121-In Charge
Chapter 3 Boolean Algebra and Digital Logic T103: Computer architecture, logic and information processing.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
©2010 Cengage Learning SLIDES FOR CHAPTER 4 APPLICATIONS OF BOOLEAN ALGEBRA MINTERM AND MAXTERM EXPANSIONS Click the mouse to move to the next page. Use.
UNIT 4 APPLICATIONS OF BOOLEAN ALGEBRA MINTERM AND MAXTERM EXPANSIONS Click the mouse to move to the next page. Use the ESC key to exit this chapter. This.
L OGIC G ATES Computer Organization – week 3. W HAT ’ S ALU? 1. ALU stands for: Arithmetic Logic Unit 2. ALU is a digital circuit that performs Arithmetic.
Boolean Algebra & Logic Gates
Morgan Kaufmann Publishers
Department of Preparatory Year, Umm Al Qura University
Logic Gates and Boolean Algebra
Computer Science 210 Computer Organization
Unit 2 Boolean Algebra.
Fundamentals & Ethics of Information Systems IS 201
CS105 Introduction to Computer Concepts GATES and CIRCUITS
CSE 311 Foundations of Computing I
Karnaugh Maps References:
Karnaugh Maps References: Lecture 4 from last semester
Some basic electronics and truth tables
Agenda – 2/12/18 Questions? Readings: CSI 4, P
Chapter 2 Boolean Algebra and Logic Gate
Week 7: Gates and Circuits: PART II
Chapter 2 Introduction to Logic Circuits
Chapter 4 Gates and Circuits.
Some basic electronics and truth tables
XOR Function Logic Symbol  Description  Truth Table 
Presentation transcript:

PHY 201 (Blum)1 Some basic electronics and truth tables Some material on truth tables can be found in Chapters 3 through 5 of Digital Principles (Tokheim)

PHY 201 (Blum)2 Logic  Digital Electronics In Logic, one refers to Logical statements (propositions which can be true or false). What a computer scientist would represent by a Boolean variable. In Electronics, one refers to inputs which will be high or low.

PHY 201 (Blum)3 Boola Boola! The expression (Booleans) and the rules for combining them (Boolean algebra) are named after George Boole ( ), a British mathematician.

PHY 201 (Blum)4

5 Boolean operators AND: when two or more Boolean expressions are ANDed, both must be true for the combination to be true. OR: when two or more Boolean expressions are ORed, if either one or the other or both are true, then the combination is true. NOT: takes one Boolean expression and yields the opposite of it, true  false and vice versa.

PHY 201 (Blum)6 Representations of Standard Boolean Operators Boolean algebra expression Gate symbol NOT AA´A´ A AND BAB A OR BA+B A XOR B ABAB A NOR B(A+B)´ A NAND B(AB)´

PHY 201 (Blum)7 Our Notation NOT is represented by a prime or an apostrophe. A’ means NOT A OR is represented by a plus sign. A + B means A OR B AND is represented by placing the two variables next to one another. AB means A AND B The notation is like multiplication in regular algebra since if A and B are 1’s or 0’s the only product that gives 1 is when A and B are both 1.

PHY 201 (Blum)8 Other Notations Ā means NOT A A means NOT A AB means A OR B A&B means A AND B Tokheim uses the overbar notation for NOT, but we will use the prime notation because it is easier to type.

PHY 201 (Blum)9 Other vocabulary We will tend to refer to A and B as “inputs.” (Electronics) Another term for them is “Boolean variables.” (Programming) Still another term for them is “propositions.” (Logic) And yet another term for them is “predicates.” (Logic and grammar)

PHY 201 (Blum)10 (AB)’  A’B’ ABAB(AB)’ ABA’B’A’B’ Note that the output is different

PHY 201 (Blum)11 A Truth Table A Truth table lists all possible inputs, that is, all possible values for the propositions. For a given numbers of inputs, this is always the same. Then it lists the output for each possible combination of inputs. This varies from situation to situation.

PHY 201 (Blum)12 The true one Traditionally we take a 1 to represent true and a 0 to represent false. This is just a convention. In addition, we will usually interpret a high voltage as a true and a low voltage as a false.

PHY 201 (Blum)13 Generating Inputs The truth-table inputs consist of all the possible combinations of 0’s and 1’s for that number of inputs. One way to generate the inputs for is to count in binary. For two inputs, the combinations are 00, 01, 10 and 11 (binary for 0, 1, 2 and 3). For three inputs, the combinations are 000, 001, 010, 011, 100, 101, 110 and 111 (binary for 0, 1, 2, 3, 4, 5, 6 and 7). For n inputs there are 2 n combinations (rows in the truth table).

PHY 201 (Blum)14 Expressing truth tables Every truth table can be expressed in terms of the basic Boolean operators AND, OR and NOT operators. The circuits corresponding to those truth tables can be build using AND, OR and NOT gates. The input in each line of a truth table can be expressed in terms of AND’s and NOT’s.

PHY 201 (Blum)15 ABA’B’ ABA’B ABAB’ ABAB Note that these expressions have the property that their truth table output has only one row with a 1.

PHY 201 (Blum)16 In a sense, each line has an expression Input AInput B Expression 00 (NOT A) AND (NOT B) A´B´ 01 (NOT A) AND B A´B 10 A AND (NOT B) AB´ 11 A AND B ABAB

PHY 201 (Blum)17 It’s true; it’s true The following steps will allow you to generate an expression for the output of any truth table. Take the true (1) outputs. Write the expressions for that input line (as shown on the previous slide). Then feed all of those expressions into an OR gate. Sometimes we have multiple outputs (e.g. bit addition had a sum output and a carry output). Then each output is treated separately.

PHY 201 (Blum)18 Example: Majority Rules ABCMajority If two or more of the three inputs are high, then the output is high.

PHY 201 (Blum)19 Row Expressions ABCRow expressions 000A’B’C’ 001A’B’C 010A’BC’ 011A’BC 100AB’C’ 101AB’C 110ABC’ 111ABC The highlighted rows correspond to the high outputs.

PHY 201 (Blum)20 Sum of products Each row is represented by the ANDing of inputs and/or inverses of inputs. E.g. A’BC Recall that ANDing is like Boolean multiplication The overall expression for the truth table is then obtained by ORing the expressions for the individual rows. Recall that ORing is like Boolean addition E.g. A’BC + AB’C + ABC’ + ABC This type of expression is known as a sum of products expression.

PHY 201 (Blum)21 Minterm The terms for the rows have a particular form in which every input (or its inverse) is ANDed together. Such a term is known an a minterm.

Minterms PHY 201 (Blum)22

PHY 201 (Blum)23 Majority rules A´BC + AB´C + ABC´ + ABC ANDs NOTs OR

PHY 201 (Blum)24 Majority rules A´BC + AB´C + ABC´ + ABC ANDs NOTs OR

PHY 201 (Blum)25 Another Example ABCOut

PHY 201 (Blum)26 Another Example (Cont.) A ’ B ’ C ’ + A ’ BC ’ + AB ’ C + ABC The expression one arrives at in this way is known as the sum of products. You take the product (the AND operation) first to represent a given line. Then you sum (the OR operation) together those expressions. It ’ s also called the minterm expression.

PHY 201 (Blum)27 Yet Another Example ABCOut

PHY 201 (Blum)28 Yet Another Example 2 (Cont.) A ’ B ’ C + A ’ BC ’ + A ’ BC + AB ’ C ’ + AB ’ C + ABC ’ + ABC But isn ’ t that just the truth table for A+B+C? There is another way to write the expression for truth tables.

PHY 201 (Blum)29 Another Example (Cont.) ABCOut In this approach, one looks at the 0’s instead of the 1’s.

PHY 201 (Blum)30 Another Example (Cont.) One writes expressions for the lines which are 1 everywhere except the line one is focusing on. Then one ANDs those expressions together. The expression obtained this way is known as the product of sums.

PHY 201 (Blum)31 Expressions ABCExpression 000A + B + C 001A + B + C’ 010A + B’ + C 011A + B’ + C’ 100A’ + B + C 101A’ + B + C’ 110A’ + B’ + C 111A’ + B’ + C’ This is not yet a truth table. It has no outputs.

PHY 201 (Blum)32 Return to Example 1 ABCOut

PHY 201 (Blum)33 Return to Example 1 (Cont.) The product of sums expression is (A+B+C ’ )(A+B ’ +C ’ )(A ’ +B+C)(A ’ +B ’ +C) Each term has all of the inputs (or their inverses) ORed together. Such terms are known as maxterms. Another name for the product of sums expression is the maxterm expression.

Maxterm PHY 201 (Blum)34

PHY 201 (Blum)35 Comparing minterm and maxterm expressions ABCMinterm Expression Maxterm Expression 000A’ B’ C’A + B + C 001A’ B’ CA + B + C’ 010A’ B C’A + B’ + C 011A’ B CA + B’ + C’ 100A B’ C’A’ + B + C 101A B’ CA’ + B + C’ 110A B C’A’ + B’ + C 111A B CA’ + B’ + C’

PHY 201 (Blum)36 Venn Diagram A Venn diagram is a pictorial representation of a truth table. Venn diagrams come from set theory. The correspondence between set theory and logic is that either one belongs to a set or one does not, so set theory and logic go together.

PHY 201 (Blum)37 Venn (Cont.) Belongs to set  True Does not belong to set  False

PHY 201 (Blum)38 Overlapping sets A true, but B false B true, but A false A false and B false A and B true The different regions correspond to the various possible inputs of a truth table. The true outputs are represented by shaded regions of the Venn diagram.

PHY 201 (Blum)39 Majority rules Venn Diagram

PHY 201 (Blum)40 Truth Table for (A+B’)’C+BC ABCB’ A+B’(A+B’)’(A+B’)’C BC (A+B’)’C+BC

PHY 201 (Blum)41 Venn Diagram for (A+B’)’C’+BC AB C

PHY 201 (Blum)42 Ohm’s Law V = I R, where V is voltage: the amount of energy per charge. I is current: the rate at which charge flows, e.g. how much charge goes by in a second. R is resistance: the “difficulty” a charge encounters as it moves through a part of a circuit.

PHY 201 (Blum)43 Circuit A circuit is a closed path along which charges flow. If there is not a closed path that allows the charge to get back to where it started (without retracing its steps), the circuit is said to be “open” or “broken.” The path doesn’t have to be unique; there may be more than one path.

Open circuit, closed circuit PHY 201 (Blum)44

PHY 201 (Blum)45 An analogy A charge leaving a battery is like you starting the day after a good night’s rest; you are full of energy. Being the kind of person you are, you will expend all of your energy and collapse utterly exhausted into bed at the end of the day; the charge uses up all of its energy in traversing a circuit.

PHY 201 (Blum)46 Analogy (cont.) You look ahead to the tasks of the day and divide your energy accordingly – the more difficult the task, the more of your energy it requires (resistors in series). The tasks are resistors, so more energy (voltage) is used up working through the more difficult tasks (higher resistances). The higher the resistance, the greater the voltage drop (energy used up) across it.

Resistors in series PHY 201 (Blum)47

PHY 201 (Blum)48 One charge among many You are just one charge among many. If the task at hand is very difficult (the resistance is high), not many will do it (the current is low); V=IR, if R is big, I must be small. If the task is easy, everyone rushes to do it. V=IR, if R is small, I will be large.

PHY 201 (Blum)49 More energetic If we had more energy, more of us would attempt a given task. V=IR, if V is bigger, I is bigger. If we are all tired out, few of us will perform even the most basic task. V=IR, if V is small, I will be small.

PHY 201 (Blum)50 Given the choice Given the choice between a difficult task and an easy task, most will choose the easier task. If there is more than one path, most take the “path of least resistance” (resistors in parallel).

Resistors in parallel PHY 201 (Blum)51

References Chapters 3 through 5 of Digital Principles (Tokheim) m rads/courses/phys202fall96/?D=A PHY 201 (Blum)52