Some basic electronics and truth tables

Slides:



Advertisements
Similar presentations
Chapter 4 Gates and Circuits.
Advertisements

Gates and Circuits Nell Dale & John Lewis (adaptation by Erin Chambers and Michael Goldwasser)
Chapter 4 Gates and 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.
Chapter 4 Gates and Circuits.
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.
DIGITAL CIRCUITS Dr. L M Head Sophomore Clinic Fall 2004.
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)
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)
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.
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:
Circuits, Current and Voltage
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)
Karnaugh Maps References:
Binary Numbers. Why Binary? Maximal distinction among values  minimal corruption from noise Imagine taking the same physical attribute of a circuit,
Course contents Chapter 1 - section 1.6 Chapter 2 - all sections Chapter – 4.7, and 4.12 Chapter , Chapter 6 - all sections.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
Some basic electronics and truth tables Some material on truth tables can be found in Chapter 3 of Digital Principles (Tokheim)
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
Digital electronics 4–1 Gates and Circuits SANJAYBHAI RAJGURU COLLEGE OF ENGG.
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.
LOGIC GATES. INTRODUCTION TO LOGIC GATES Boolean functions may be practically implemented by using electronic gates. The following points are important.
Week 1: Introduction and Logic gates IT3002 – Computer Architecture
Logic Gates Unit 16.
Electronics Circuits.
Logic gates.
Boolean Algebra & Logic Gates
Basics of Logic gates - Part 1
Dr.Ahmed Bayoumi Dr.Shady Elmashad
Morgan Kaufmann Publishers
Unit 2 Boolean Algebra.
Introduction Molecules: made up of atoms of individual elements.
Circuits, Current and Voltage
Fundamentals & Ethics of Information Systems IS 201
Circuits, Current and Voltage
Basics Combinational Circuits Sequential Circuits
Practice #Digital Logic Mr. Burleson
Chapter 4 Gates and Circuits.
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Computer Science 210 Computer Organization
Series and Parallel Circuits
Karnaugh Maps References:
Karnaugh Maps References: Lecture 4 from last semester
SOLIDS AND SEMICONDUCTOR DEVICES - IV
Agenda – 2/12/18 Questions? Readings: CSI 4, P
BASIC & COMBINATIONAL LOGIC CIRCUIT
Logic Gates.
Week 7: Gates and Circuits: PART II
Boolean Logic Boolean Logic is considered to be the basic of digital electronics. We know that a computer’s most basic operation is based on digital electronics.
Logic Gates.
SOLIDS AND SEMICONDUCTOR DEVICES - IV
Circuits, Current and Voltage
Binary Numbers.
ECB2212-Digital Electronics Boolean algebra
Logic Gates.
Chapter 4 Gates and Circuits.
Some basic electronics and truth tables
XOR Function Logic Symbol  Description  Truth Table 
Copyright © Cengage Learning. All rights reserved.
SOLIDS AND SEMICONDUCTOR DEVICES - IV
Electric Circuits Chapter 35.
Chapter 3 – Describing Logic Circuits
What are Logic Gates?.
Presentation transcript:

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)

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)

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

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)

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

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)

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)

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)

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

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)

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

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 2n combinations (rows in the truth table). PHY 201 (Blum)

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)

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

In a sense, each line has an expression Input A Input B Expression (NOT A) AND (NOT B) A´B´ 1 (NOT A) AND B A´B A AND (NOT B) AB´ A AND B AB PHY 201 (Blum)

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)

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

Row Expressions A B C Row expressions A’B’C’ 1 A’B’C A’BC’ A’BC AB’C’ A’B’C’ 1 A’B’C A’BC’ A’BC AB’C’ AB’C ABC’ ABC The highlighted rows correspond to the high outputs. PHY 201 (Blum)

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)

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

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)

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

Overlapping sets A true, but B false B true, but A false A and B true A false and B false 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)

Majority rules Venn Diagram PHY 201 (Blum)

Electronics Workbench Where the logic gates are PHY 201 (Blum)

EWB gates chips Be careful above the NAND chip is the NOT gate. PHY 201 (Blum)

NOT Gate and NOT Chip PHY 201 (Blum)

Gates and Chips EWB gates focus purely on the logic (the inputs and outputs). EWB chips, while simulated, are closer to a real-world device Chips need power: VCC must be connected to high (5 volts) and GND must be connected to ground. Another complication is that the NOT chip houses four NOT gates. PHY 201 (Blum)

HELP! (Right click on the item and choose Help from the menu) PHY 201 (Blum)

Connectors: allow up to four wires to meet PHY 201 (Blum)

Resistors: PHY 201 (Blum)

To change an item’s properties: Right click on item and choose Component Properties PHY 201 (Blum)

Value and units Kilo-Ohm: Unit of resistance Value of resistance PHY 201 (Blum)

Switch PHY 201 (Blum)

Battery and ground Battery Ground PHY 201 (Blum)

Voltmeter, ammeter, 7-segment display(s) PHY 201 (Blum)

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 moves through a part of a circuit. PHY 201 (Blum)

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. PHY 201 (Blum)

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)

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. PHY 201 (Blum)

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)

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)

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). PHY 201 (Blum)