Logic Circuits In today’s lesson we will look at: the symbols for NOT, AND, OR and EOR using truth tables to represent logic circuits two new operators.

Slides:



Advertisements
Similar presentations
Logic Gates A logic gate is an elementary building block of a digital circuit Most logic gates have two inputs and one output At any given moment, every.
Advertisements

Logic Gates.
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
1 COMP541 Combinational Logic Montek Singh Jan 16, 2007.
Logic Gates.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
Propositional Calculus Math Foundations of Computer Science.
Boolean Logic & Truth Tables In today’s lesson we will look at: a reminder about truth values and NOT, AND, OR and EOR truth tables operator precedence.
In this module you will learn: What the various logic gates do. How to represent logic gates on a circuit diagram. The truth tables for the logic gates.
Logic Gates Circuits to manipulate 0’s and 1’s. 0’s and 1’s used for numbers Also to make decisions within the computer. In that context, 1 corresponds.
Simple One and Two Input Logic Gates Truth Tables and Function Tables Based Upon TTL Levels.
Think about the following expression If the number entered is greater than 15 but less than 25 or the number is 100 and the letter chosen is after p but.
Systems Architecture I1 Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus so that they.
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
Transistors and Logic Circuits. Transistor control voltage in voltage out control high allows current to flow -- switch is closed (on) control low stops.
Lecture 17: Digital Design Today’s topic –Intro to Boolean functions Reminders –HW 4 due Wednesday 10/8/2014 (extended) –HW 5 due Wednesday 10/15/2014.
DeMorgan Theorem, Computer Simulation Exercises
Computer Organization 1 Logic Gates and Adders. Propositions –Venn Diagrams.
1 DIGITAL ELECTRONICS. 2 OVERVIEW –electronic circuits capable of carrying out logical (boolean) and arithmetic operations on information stored as binary.
Company LOGO DKT 122/3 DIGITAL SYSTEM 1 WEEK #7 COMBINATIONAL LOGIC ANALYSIS.
1 Boolean Algebra & Logic Gates. 2 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple.
Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.
Combinational Logic 1.
LOGIC GATES.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Exclusive OR Gate. Logically, the exclusive OR (XOR) operation can be seen as either of the following operations:exclusive OR (XOR) 1. A AND NOT B OR.
Logic Gates. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.
Boolean and Sequential Logic Last week – Basic Gates AND OR NOT NOR XOR NAND.
1 GCSE Computing Binary Logic. GCSE Computing 2 Candidates should be able to understand and produce simple logic diagrams using the operations NOT, AND,
CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.
CEC 220 Digital Circuit Design SOP and POS forms Friday, Sept 11 CEC 220 Digital Circuit Design Slide 1 of 17.
NAND, NOR, and EXOR (more primitive logical gates) CS Computer Architecture David Mayer.
Logic Gates and Boolean Algebra Introduction to Logic II.
4–1. BSCS 5 th Semester Introduction Logic diagram: a graphical representation of a circuit –Each type of gate is represented by a specific graphical.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
LOGIC GATES. INTRODUCTION TO LOGIC GATES Boolean functions may be practically implemented by using electronic gates. The following points are important.
Logic Gates Learning Objectives Learn that there is a one-to-one relationship between logic gates and Boolean expressions Learn how logic gates are combined.
Truth Table to Statement Form
Logic Gates and Boolean Algebra
Logic Gates.
Logic Gates Practical Objective: to develop an understanding of logic circuits and truth tables.
Transistors and Logic Circuits
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
EI205 Lecture 5 Dianguang Ma Fall 2008.
Exclusive OR Gate.
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Digital Signals Digital Signals have two basic states:
Jeremy R. Johnson Wed. Sept. 29, 1999
Computer Science 210 Computer Organization
Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan
SOLIDS AND SEMICONDUCTOR DEVICES - IV
3.4 Computer systems Boolean logic Lesson 2.
For OCR GCSE Computing Unit 1 - Theory
JC Technology Logic Gates.
Boolean Algebra.
Logic Gates.
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.
SOLIDS AND SEMICONDUCTOR DEVICES - IV
KS4 Electricity – Electronic systems
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
GCSE Computer Science – Logic Gates & Boolean Expressions
Binary Logic.
XOR Function Logic Symbol  Description  Truth Table 
Department of Electronics
SOLIDS AND SEMICONDUCTOR DEVICES - IV
Combinational Logic Circuit
Presentation transcript:

Logic Circuits In today’s lesson we will look at: the symbols for NOT, AND, OR and EOR using truth tables to represent logic circuits two new operators – NAND and NOR using equivalence to simplify circuits the “half-adder” circuit

Logic Circuits You might sometimes see diagrams that look like electrical circuits, but which contain symbols for Boolean operators – these are called logic circuits. Each logical operation has its own symbol: NOT

Example Circuit Symbols are combined and inputs labelled: Output can be shown using truth tables: D NOT AND OR ABCD

NAND and NOR With logic circuits, there are two new operators that you might come across – NAND and NOR: Their names are short for NOT AND and NOT OR, which reminds us what they do. NAND behaves like AND with a NOT after it, and NOR behaves like an OR with a NOT after it - i.e. the results are the opposite of a normal AND and OR.

Truth Table - NOR The NOR operator gives a false result if any of the input values is true, e.g. aba OR b a NOR b

Truth Table - NAND The NAND operator gives a false result if both of the input values are true, e.g. aba AND b a NAND b

Why Use NAND and NOR? Remember DeMorgan’s Duals from last week? –NOT(a OR b) = NOT a AND NOT b –NOT(a AND b) = NOT a OR NOT b The left-hand part of those equivalences are NOR and NAND, so they can be used to make logic circuits simpler. Also, NAND is easy to manufacture because a single transistor behaves like a NAND gate, so circuits using NAND can be both logically and physically simpler and more efficient.

Simplification Look at this circuit – it uses three components: It represents the operation Y = NOT A OR NOT B However, from the previous slide, we know that: NOT(a AND b) = NOT a OR NOT b We also know that NOT(a AND b) is the same as a NAND b, so the whole circuit can be simplified to a single NAND gate: Y B A

Another Example ABCOutput AND NAND OR What is the output of this logic circuit?

Half-Adder ABDESC What is the output of this circuit? This circuit performs binary addition (C = carry) It also has a simpler equivalent: