Some basic electronics and truth tables

Slides:



Advertisements
Similar presentations
INTRODUCTION LOGICAL OPERATIONS TRUTH TABLE AND RULES.
Advertisements

Boolean Algebra and Logic Gate
1 Boolean Algebra & Logic Design. 2 Developed by George Boole in the 1850s Mathematical theory of logic. Shannon was the first to use Boolean Algebra.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
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..
Chapter 4 Gates and Circuits.
Logical Circuit Design Week 5: Combinational Logic Circuits Mentor Hamiti, MSc Office ,
Binary Codes Computers and other digital systems "work" with binary numbers. I/P & O/P is usually done using decimal numbers, alphabetics, special symbols.
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:
OCR GCSE Computing © Hodder Education 2013 Slide 1 OCR GCSE Computing Chapter 2: Binary Logic.
PHY 201 (Blum)1 Some basic electronics and truth tables Some material based on Chapters 3 through 5 of Digital Principles (Tokheim)
Computer Science 210 Computer Organization Introduction to Boolean Algebra.
LOGIC GATES.
Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.
Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Boolean Algebra & Logic Prepared by Dr P Marais (Modified by D Burford)
Chapter 3: Digital Logic Dr Mohamed Menacer Taibah University
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
A-Level Computing#BristolMet Session Objectives#6 MUST understand and produce simple logic diagrams using the operations NOT, AND and OR SHOULD explain.
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.
Lecture 4 Introduction to Boolean Algebra. Binary Operators In the following descriptions, we will let A and B be Boolean variables and define a set of.
Boolean Algebra Computer Architecture. Digital Representation Digital is an abstraction of analog voltage –Voltage is a continuous, physical unit Typically.
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.
Logic Gates and Boolean Algebra Introduction to Logic II.
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.
Kirchhoff’s Current Law For a series circuit: In a series circuit there is only one path so the current must be… Kirchhoff’s Current Law For a series.
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.
Computer Architecture & Operations I
Boolean Algebra & Logic Gates
Basics of Logic gates - Part 1
Morgan Kaufmann Publishers
Computer Science 210 Computer Organization
Unit 2 Boolean Algebra.
Introduction Molecules: made up of atoms of individual elements.
Logic Gates.
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Jeremy R. Johnson Wed. Sept. 29, 1999
Fundamentals & Ethics of Information Systems IS 201
Practice #Digital Logic Mr. Burleson
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Computer Science 210 Computer Organization
Karnaugh Maps References:
Karnaugh Maps References: Lecture 4 from last semester
Some basic electronics and truth tables
SOLIDS AND SEMICONDUCTOR DEVICES - IV
Agenda – 2/12/18 Questions? Readings: CSI 4, P
Schematics 201 Lecture Topic: Electrical Symbols
Computer Science 210 Computer Organization
Logic Gates.
Logic Gates.
SOLIDS AND SEMICONDUCTOR DEVICES - IV
KS4 Electricity – Electronic systems
GCSE Computer Science – Logic Gates & Boolean Expressions
Binary Logic.
Chapter 4 Gates and Circuits.
XOR Function Logic Symbol  Description  Truth Table 
Truth tables Mrs. Palmer.
SOLIDS AND SEMICONDUCTOR DEVICES - IV
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Logic Gates AIM: To know the different types of logic gate
What are Logic Gates?.
DIGITAL ELECTRONICS AND LOGIC GATES. ANALOG SIGNAL:- Analog signal is continuous time varying current or voltage signal.
Presentation transcript:

Some basic electronics and truth tables Some material on truth tables can be found in Chapter 1 of Computer Systems Organization & Architecture (Carpinelli)

Logic  Digital Electronics In Logic, one refers to Logical statements (propositions which can be true or false) What a computer scientist would call a Boolean variable In Electronics, one refers to inputs which will be high or low

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

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

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) ´

A Truth Table A Truth table lists all possible inputs, that is, that is all possible values for the statements 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

The true one Traditionally we take a 1 to represent true and a 0 to represent false It is also usual to interpret a high voltage as a true and a low voltage as a false

Generating Inputs Generating the inputs for a truth table is like counting in binary If there are two inputs, the combinations are 00, 01, 10 and 11 If there are three inputs, the combinations are 000, 001, 010, 011, 100, 101, 110, 111 For n inputs there are 2n combinations (rows in the truth table)

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

Line by Line Input A Input B Expression A´B ´ 1 A´B AB ´ AB (Not A) AND (NOT B) A´B ´ 1 (Not A) AND B A´B A AND (NOT B) AB ´ A AND B AB

It’s true; it’s true 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

Example A B C Majority 1

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

Majority rules A´BC + AB´C + ABC´ + ABC NOTs OR ANDs

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

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

Overlapping sets A false and B false B true, but A false A and B true A true, but B false

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

Circuit A circuit is a closed path along which charges flow If there is not a closed path that allows that the charge can 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

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

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

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

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

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)