Logic Gates - Introduction

Similar documents
Ex: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.

Combinational Logic. By : Ali Mustafa

MODULAR CIRCUITS CHAPTER 7

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits

Boolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.

MC9211 Computer Organization

Chapter 3 Combinational Logic Design

Cs302 Quiz for MID TERM Exam Solved

Exam for Physics 4051, October 31, 2008

Experiment 7: Magnitude comparators

EEE130 Digital Electronics I Lecture #4

CSE 140L Spring 2010 Lab 1 Assignment Due beginning of the class on 14 th April

Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary

Chapter 2 Combinational Logic Circuits

Z = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table

Systems I: Computer Organization and Architecture

Gates and Flip-Flops

Chapter 2 Combinational Logic Circuits

EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits)

Outline. EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) Combinational Logic (CL) Defined

CS/COE0447: Computer Organization and Assembly Language

Unit 3 Session - 9 Data-Processing Circuits

XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.

Additional Gates COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals

Number System conversions

Karnaugh Maps for Combinatorial Logic CS 64: Computer Organization and Design Logic Lecture #12

Logic Gate Level. Part 2

Philadelphia University Student Name: Student Number:

EGC221: Digital Logic Lab

NAND, NOR and XOR functions properties

Homework Assignment #1 Solutions EE 477 Spring 2017 Professor Parker

ELCT201: DIGITAL LOGIC DESIGN

Lab 1 starts this week: go to your session

Introduction to Computer Engineering ECE 203

COSC 243. Introduction to Logic And Combinatorial Logic. Lecture 4 - Introduction to Logic and Combinatorial Logic. COSC 243 (Computer Architecture)

Review. EECS Components and Design Techniques for Digital Systems. Lec 06 Minimizing Boolean Logic 9/ Review: Canonical Forms

King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department

DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA

1 Boolean Algebra Simplification

( c) Give logic symbol, Truth table and circuit diagram for a clocked SR flip-flop. A combinational circuit is defined by the function

In Module 3, we have learned about Exclusive OR (XOR) gate. Boolean Expression AB + A B = Y also A B = Y. Logic Gate. Truth table

Fundamentals of Digital Design

Digital Logic. Lecture 5 - Chapter 2. Outline. Other Logic Gates and their uses. Other Logic Operations. CS 2420 Husain Gholoom - lecturer Page 1

Chapter 2: Switching Algebra and Logic Circuits

XOR - XNOR Gates. The graphic symbol and truth table of XOR gate is shown in the figure.

Total Time = 90 Minutes, Total Marks = 50. Total /50 /10 /18

Sample Test Paper - I

Schedule. ECEN 301 Discussion #25 Final Review 1. Date Day Class No. 1 Dec Mon 25 Final Review. Title Chapters HW Due date. Lab Due date.

Digital Logic (2) Boolean Algebra

Digital Logic: Boolean Algebra and Gates. Textbook Chapter 3

UNIVERSITI TENAGA NASIONAL. College of Information Technology

CS1800 Discrete Structures Final Version A

Reg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering

CprE 281: Digital Logic

Roger L. Tokheim. Chapter 8 Counters Glencoe/McGraw-Hill

CHAPTER 7 MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES

CSE 20 DISCRETE MATH. Fall

Boolean Algebra & Digital Logic

Digital Systems and Information Part II

Chapter 2. Boolean Algebra and Logic Gates

ENG2410 Digital Design Combinational Logic Circuits

ELCT201: DIGITAL LOGIC DESIGN

CSE140: Components and Design Techniques for Digital Systems. Midterm Information. Instructor: Mohsen Imani. Sources: TSR, Katz, Boriello & Vahid

Vidyalankar S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution

Fundamentals of Boolean Algebra

Lecture A: Logic Design and Gates

Midterm Examination # 1 Wednesday, February 25, Duration of examination: 75 minutes

Class Website:

Floating Point Representation and Digital Logic. Lecture 11 CS301

CSC9R6 Computer Design. Practical Digital Logic

BOOLEAN LOGIC. By- Neha Tyagi PGT CS KV 5 Jaipur II Shift, Jaipur Region. Based on CBSE curriculum Class 11. Neha Tyagi, KV 5 Jaipur II Shift

Digital Logic Appendix A

Chapter 2: Boolean Algebra and Logic Gates

Lecture (02) NAND and NOR Gates

Digital Electronics Final Examination. Part A

Combinational Logic Design Principles

Computer Organization I. Lecture 13: Design of Combinational Logic Circuits

Binary Logic and Gates. Our objective is to learn how to design digital circuits.

Chapter 2 Boolean Algebra and Logic Gates

Computer organization

KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE

Every time has a value associated with it, not just some times. A variable can take on any value within a range

ELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN VALUES

Chapter 7 Logic Circuits

10/14/2009. Reading: Hambley Chapters

Boolean Algebra and Logic Gates

Logic Design I (17.341) Fall Lecture Outline

DE58/DC58 LOGIC DESIGN DEC 2014

Digital Circuit And Logic Design I. Lecture 4

Unit II Chapter 4:- Digital Logic Contents 4.1 Introduction... 4

Boolean Logic Prof. James L. Frankel Harvard University. Version of 3:20 PM 29-Aug-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved.

DIGITAL LOGIC CIRCUITS

Boolean Algebra and Digital Logic 2009, University of Colombo School of Computing

EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive

CHAPTER 7. Exercises 17/ / /2 2 0

ECE 342 Electronic Circuits. Lecture 34 CMOS Logic

mith College Computer Science CSC270 Spring 16 Circuits and Systems Lecture Notes Week 2 Dominique Thiébaut

CMSC 313 Lecture 17. Focus Groups. Announcement: in-class lab Thu 10/30 Homework 3 Questions Circuits for Addition Midterm Exam returned

Chapter 1: Logic systems

Boolean Algebra. Digital Logic Appendix A. Postulates, Identities in Boolean Algebra How can I manipulate expressions?

Transcription:

Logic Gates - Introduction Page 1

Overview Introduction Page 2 Digital Design underpins the creation of the myriad of imaginative digital devices that surround us Computers Calculators Phones Digital watches Microwave ovens Robots Really Everything

Digital Design Organizing an arrays of simple switches into a discrete system that performs transformations on two-level (Binary) information in a meaningful and predictable way Page 3

Page 4 See Appendix A, for Licensing Attribution information by-nc-sa-3.0 https://creativecommons.org/licenses/by-nc-sa/3.0/ https://creativecommons.org/faq/#what-does-some-rights-reserved-mean

What You Will Know Prior Knowledge Binary Numbers How to count in binary How to Add in Binary How to Multiply in Binary How What You Will Know Be Able To Do Explain the difference between AND, OR, NOT logic gates Read and fill out a Truth Table Convert a Logical Expression in to Gate Diagram Convert a Logical Expression in to a Truth Table Page 5

New Words Binary Page 6

Review Binary Numbers Take 10 minutes and review binary numbers Binary Number Systems Binary Digits Page 7

How To Convert From Binary or Decimal Binary is as easy as 01, 10, 11 Computer Humor Convert the Following Binary Numbers: 0011 =? 1x2 + 1x1 = 3 1011 =? 1x8 + 0x4 + 1x2 + 1x1 = 11 Place Values 10101 =? 1x16 + 0x8 + 1x4 + 0x2 + 1x1 = 21 110011 =? 1x32 + 1x16 + 0x8 + 0x4 + 1x2 + 1x1 = 51 Page 8

Binary Quiz https://docs.google.com/forms/d/e/1faipqlsc82cmm tqfs0cj7iw1a_svz7n6egzl64mbaljmrdc6zndfypw/vi ewform?usp=sf_link Page 9

Adding Binary Numbers 110 + 101 Rule 1 0 + 0 = 0 Rule 2 0 + 1 = 1 Rule 3 1 + 0 = 1 } Just like decimal addition Rule 4 1 + 1 = 10 Surprise! 1011 Since 0 + 1 =1 Since 1 + 1 = 10 Since 1 + 0 = 1 Page 10 https://www.quickanddirtytips.com/education/math/how-to-add-binary-numbers?page=1

Multiplying Binary Numbers 110 * 101 1 1 0 0 0 0 0 1 1 0 0 0 11110 Rule 1 0 * 0 = 0 Rule 2 0 * 1 = 0 Rule 3 1 * 0 = 0 Rule 4 1 * 1 = 1 } Just like decimal multiplication Page 11 https://www.quickanddirtytips.com/education/math/how-to-add-binary-numbers?page=1

Adding and Multipying in Binary Adding Binary Numbers Adding in binary Applying mathematical reasoning Multiplying Binary Numbers Multiplying in binary Applying mathematical reasoning Page 12

B Binary Logic Deals with binary variables that take 2 discrete values (0 and 1), and with logic operations Three basic logic operations: AND, OR, NOT Binary/logic variables are typically represented as letters: A,B,C,,X,Y,Z Page 13

Basic Logic Operators AND OR NOT Binary Unary F(a,b) = a b, F is 1 if and only if a=b=1 G(a,b) = a+b, G is 1 if either a=1 or b=1 H(a) = a, H is 1 if a=0 Page 14

Binary Logic Function F(var) = expression This is a set of Binary variables Defines the set of Inputs Ex: F(a,b) = (a b) + b a b Operators ( +,, ) Variables Constants ( 0, 1 ) Groupings (parenthesis) F= (a b) + b Page 15 F(a,b,c) = a ((b+c )+(b +c))

Basic AND OR Logic Operators 1-bit logic AND resembles binary multiplication: Page 16 0 0 = 0 0 1 = 0 1 0 = 0 1 1 = 1 A B F= A B 1-bit logic OR resembles binary addition, except for one operation: A B 0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 1 + 1 = 1 ( 10 2 ) F= A + B

Combinational Logic Gates Outputs depend directly on their inputs Outputs are generated asynchronously and instantaneous* Do not require a clock or other synchronous signals Let s call them Logic Gates Page 17

Logic Gates Logic gates are abstractions of electronic circuit components that operate on one or more input signals to produce an output signal a b AND F= a b a b F= a + b OR a a INV Page 18

AND Gate This AND gate has two inputs and an output Output is zero unless both Inputs are 1 s The AND operation is mathematically defined as the product of two Boolean values Page 19 Truth table: tabular form that uniquely represents the relationship between the input variables of a function and its output a b AND F= a b 2-Input AND A B F=A B 0 0 0 0 1 0 1 0 0 1 1 1

OR Gate This OR gate has two inputs and an output Output is 1 if any of the Inputs are 1 s The OR operation is mathematically defined as the summation of two Boolean values Page 20 Truth table: tabular form that uniquely represents the relationship between the input variables of a function and its output a b OR F= a + b 2-Input OR A B F=A+B 0 0 0 0 1 1 1 0 1 1 1 1

NOT (Inverter) Gate This NOT gate has one input and one output This is an inverter function Output is 1 if the Input is 0, and 0 if the Input is 1 a INV F= a (Inverter) NOT a F= a 0 1 1 0 Page 21 Truth table: tabular form that uniquely represents the relationship between the input variables of a function and its output

Truth Tables for logic operators Truth table: tabular form that uniquely represents the relationship between the input variables of a function and its output Page 22 2-Input AND A B F=A B 0 0 0 0 1 0 1 0 0 1 1 1 2-Input OR A B F=A+B 0 0 0 0 1 1 1 0 1 1 1 1 NOT A F=A 0 1 1 0

Truth Tables Check for Understanding Truth table: tabular form that uniquely represents the relationship between the input variables of a function and its output Page 23 2-Input AND A B F=A B 0 0 0 1 1 0 1 1 2-Input OR A B F=A+B 0 0 0 1 1 0 1 1 NOT A F=A 0 1

Truth Tables Check for Understanding Q: Let a function F() depend on n variables. How many rows are there in the truth table of F(a,b) = (a+b)? Page 24 What about F(a,b,c) = (a+b+c)? What about F(a,b,c,d) = (a+b+c+d)? A: 2 n rows, since there are 2 n possible binary patterns / combinations for the n variables A B F=A+B 0 0 0 0 1 1 1 0 1 1 1 1

Check Out This Logic Link Learning about Logic Gates and Circuits https://logic.ly/lessons/ Page 25

Logic GAtes Check for Understanding What are the outputs for each of these gates with the specified inputs values? 1 0 AND F=? 1 1 AND F=? 0 0 AND F=? Page 26

Logic GAtes Check for Understanding What are the outputs for each of these gates with the specified inputs values? 0 1 OR F=? 0 0 OR F=? 1 1 OR F=? Page 27

AND Gate + Inverter This NAND gate has two inputs and an output Output is 1 unless both Inputs are 1 s, then it s 0 2-Input NAND A B F=A B 0 0 1 0 1 1 1 0 1 1 1 0 a b NAND c = a b F= c = a b NAND F= a b Page 28

NAND Gate This NAND gate has two inputs and an output Output is 1 unless both Inputs are 1 s, then it s 0 The NAND operation is mathematically defined as the product of two Boolean values Page 29 Truth table: tabular form that uniquely represents the relationship between the input variables of a function and its output a b NAND F= a b 2-Input NAND A B F=A B 0 0 1 0 1 1 1 0 1 1 1 0

NOR Gate This NOR gate has two inputs and an output Output is 0 if any of the Inputs are 1 s The NOR operation is mathematically defined as the summation of two Boolean values Page 30 Truth table: tabular form that uniquely represents the relationship between the input variables of a function and its output a b F= a + b NOR 2-Input NOR A B F=A+B 0 0 1 0 1 0 1 0 0 1 1 0

XOR Gate This XOR gate has two inputs and an output Output is 1 if the Inputs are different The XOR operation is mathematically defined as the summation of two Boolean values if they are different Page 31 Truth table: tabular form that uniquely represents the relationship between the input variables of a function and its output a b XOR F= a ^ b 2-Input XOR A B F=A^B 0 0 0 0 1 1 1 0 1 1 1 0

Reference Slides Page 32

Learning Domain, CTE Standards and Stuff like that Learning Domain [ ] cognitive [ ] affective[ ] psychomotor What are some cognitive skills required for success in your pathway? What are some affective skills required for success in your pathway? What are some psychomotor skills required for success in your pathway? Time: Lecture Lab Standards CTE CCSS NCSS Page 33

Resources Materials Needed Page 34

Logic Gates Page 35

Logic Gates Page 36

Links that I may use https://www.youtube.com/watch?v=ejhmvlzh_9q Page 37

Appendix Page 38

Appendix A: License Attribution This interpretation is primarily the Intellectual Property of Jim Burnham, Top STEAM Clown, at STEAMClown.org This presentation and content is distributed under the Creative Commons License CC-by-nc-sa-3.0 My best attempt to properly attribute, or reference any other sources or work I have used are listed in Appendix B Page 39

Appendix B: Attribution for Sources Used Power Point Logic Gates Symbols Oliver Mannay Slide Share Logic Gates PPT from Michigan Tech EE 4271 Page 40