Digital Systems: Logic Gates and Boolean Algebra

Slides:



Advertisements
Similar presentations
Digital Systems: Logic Gates and Boolean Algebra Wen-Hung Liao, Ph.D.
Advertisements

Logic Gates.
Chapter 3 Logic Gates and Boolean Algebra – Part 1
Chap. 3 Logic Gates and Boolean Algebra
Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR
Chapter 2 Logic Circuits.
Boolean Algebra and Combinational Logic
CS 151 Digital Systems Design Lecture 7 More Logic Functions: NAND, NOR, XOR.
Boolean Algebra and Logic Gates
Digital Systems Logic Gates and Boolean Algebra
Logic Gate Level Combinational Circuits, Part 1. Circuits Circuit: collection of devices physically connected by wires to form a network Net can be: –
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.
Digital Systems Presented by Prof Tim Johnson
Logical Circuit Design Week 5: Combinational Logic Circuits Mentor Hamiti, MSc Office ,
DeMorgan Theorem, Computer Simulation Exercises
Digital Systems: Boolean Algebra and Logic Gates
LOGIC GATES & TRUTH TABLE – Digital Circuit 1 Choopan Rattanapoka.
EE2420 – Digital Logic Summer II 2013 Hassan Salamy Ingram School of Engineering Texas State University Set 4: Other Gates.
Combinational Logic 1.
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.
Introduction to Chapter 3  Now that we understand the concept of binary numbers, we will study ways of describing how systems using binary logic levels.
Logic Gates and Boolean Algebra Wen-Hung Liao, Ph.D. 11/2/2001.
Basic Gates 3.1 Basic Digital Logic: NAND and NOR Gates ©Paul Godin Created September 2007 Last Update Sept 2009.
CH51 Chapter 5 Combinational Logic By Taweesak Reungpeerakul.
Using De’Morgan’s On of the most useful principles in boolean algebra is De’Morgan’s Theorem, which allows one to switch between ANDs and NORs and ORs.
1 EG 32 Digital Electronics Thought for the day You learn from your mistakes..... So make as many as you can and you will eventually know everything.
Basic Digital Logic: NAND and NOR Gates Technician Series ©Paul Godin Last Update Dec 2014.
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
CEC 220 Digital Circuit Design Boolean Algebra Friday, January 17 CEC 220 Digital Circuit Design Slide 1 of 22.
Chapter-3: BOOLEAN ALGEBRA & LOGIC GATES Analysis and logical design.
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,
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
Chapter 5 Boolean Algebra and Reduction Techniques 1.
Minute Paper 4/4/04 Z=50+j86.7=100
1 Ch.3 Logic Gates and Boolean Algebra – Part 1
CSE 461. Binary Logic Binary logic consists of binary variables and logical operations. Variables are designated by letters such as A, B, C, x, y, z etc.
CHAPTER 2 Boolean algebra and Logic gates
Boolean Constants and Variables Boolean 0 and 1 do not represent actual numbers but instead represent the state, or logic level. Closed switchOpen switch.
DATA REPRESENTATION IN COMPUTER MEMORY.  Describe the coding system:  Sign and magnitude  1’s Complement and 2’s Complement  Binary Coded Decimal.
Logic gates.
Boolean Algebra & Logic Gates
CHAPTER 7 MULTI-LEVEL GATE CIRCUITS / NAND AND NOR GATES
Eng. Mai Z. Alyazji October, 2016
Logic Gates and Boolean Algebra
Chapter 3 Notes – Part II Review Questions
Logic Gates.
De Morgan’s Theorem,.
Unit 2 Boolean Algebra.
Logic Gates and Boolean Algebra
CS 105 Digital Logic Design
CHAPTER 2 Boolean Algebra
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
Boolean Algebra and Combinational Logic
Digital Logic Design م . م غيث عبد الودود تقي الكلية التقنية الهندسية / بغداد Assistant Lecturer Ghaith A. Taki
Boolean Algebra.
Boolean Algebra & Logic Circuits
Universal gates.
Digital Logic & Design Lecture 05
Logic Gates.
Chapter 2 Introduction to Logic Circuits
Digital Logic Chapter-2
Digital Logic Chapter-2
Introductory Concepts
Department of Electronics
Chap. 3 Describing Logic Circuits
Boolean Algebra and Gate Networks
Chapter 3 – Describing Logic Circuits
Presentation transcript:

Digital Systems: Logic Gates and Boolean Algebra Wen-Hung Liao, Ph.D.

Objectives Perform the three basic logic operations. Describe the operation of and construct the truth tables for the AND, NAND, OR, and NOR gates, and the NOT (INVERTER) circuit. Draw timing diagrams for the various logic-circuit gates. Write the Boolean expression for the logic gates and combinations of logic gates. Implement logic circuits using basic AND, OR, and NOT gates. Appreciate the potential of Boolean algebra to simplify complex logic circuits.

Objectives (cont’d) Use DeMorgan's theorems to simplify logic expressions. Use either of the universal gates (NAND or NOR) to implement a circuit represented by a Boolean expression. Explain the advantages of constructing a logic-circuit diagram using the alternate gate symbols versus the standard logic-gate symbols. Describe the concept of active-LOW and active-HIGH logic symbols. Draw and interpret the IEEE/ANSI standard logic-gate symbols.

Boolean Constants and Variables Boolean 0 and 1 do not represent actual numbers but instead represent the state, or logic level. Logic 0 Logic 1 False True Off On Low High No Yes Open switch Closed switch

Three Basic Logic Operations OR AND NOT

Truth Tables A truth table is a means for describing how a logic circuit’s output depends on the logic levels present at the circuit’s inputs. Inputs Output A B x 1 A ? x B

OR Operation Boolean expression for the OR operation: x =A + B The above expression is read as “x equals A OR B” Figure 3-2

OR Gate An OR gate is a gate that has two or more inputs and whose output is equal to the OR combination of the inputs. Figure 3-3

Example 3-1 Using an OR gate in an alarm system(refer to Fg03-04.ckt)

Example 3.2 Timing diagram (refer to Fg03-05.ckt)

AND Operation Boolean expression for the AND operation: x =A B The above expression is read as “x equals A AND B”

AND Gate An AND gate is a gate that has two or more inputs and whose output is equal to the AND product of the inputs. Figure 3-8

Timing Diagram for AND Gate

Timing Diagram for AND Gate

Enable/Disable (inhibit) Circuit

Enable/Disable Circuit

NOT Operation The NOT operation is an unary operation, taking only one input variable. Boolean expression for the NOT operation: x = A The above expression is read as “x equals the inverse of A” Also known as inversion or complementation. Can also be expressed as: A’ Figure 3-11 A

NOT Circuit Also known as inverter. Always take a single input Application:

Describing Logic Circuits Algebraically Any logic circuits can be built from the three basic building blocks: OR, AND, NOT Example 1: x = A B + C Example 2: x = (A+B)C Example 3: x = (A+B) Example 4: x = ABC(A+D)

Examples 1,2

Examples 3

Example 4

Evaluating Logic-Circuit Outputs x = ABC(A+D) Determine the output x given A=0, B=1, C=1, D=1. Can also determine output level from a diagram

Figure 3.16

Implementing Circuits from Boolean Expressions We are not considering how to simplify the circuit in this chapter. y = AC+BC’+A’BC x = AB+B’C x=(A+B)(B’+C)

Figure 3.17

Figure 3.18

NOR Gate Boolean expression for the NOR operation: x = A + B Figure 3-20: timing diagram

Figure 3.20

NAND Gate Boolean expression for the NAND operation: x = A B Figure 3-23: timing diagram

Figure 3.23

Boolean Theorems (Single-Variable) x* 0 =0 x* 1 =x x*x=x x*x’=0 x+0=x x+1=1 x+x=x x+x’=1

Boolean Theorems (Multivariable) x+y = y+x x*y = y*x x+(y+z) = (x+y)+z=x+y+z x(yz)=(xy)z=xyz x(y+z)=xy+xz (w+x)(y+z)=wy+xy+wz+xz x+xy=x x+x’y=x+y x’+xy=x’+y

DeMorgan’s Theorems (x+y)’=x’y’ Implications and alternative symbol for NOR function (Figure 3-26) (xy)’=x’+y’ Implications and alternative symbol for NAND function (Figure 3-27) Example 3-17: Figure 3-28 Extension to N variables

Figure 3.26

Figure 3.27

Universality of NAND Gates

Universality of NOR Gates

Available ICs

Alternate Logic Symbols Step 1: Invert each input and output of the standard symbol Change the operation symbol from AND to OR, or from OR to AND. Examples: AND, OR, NAND, NOR, INV

Alternate Logic-Gate Representation

Logic Symbol Interpretation When an input or output on a logic circuit symbol has no bubble on it, that line is said to be active-HIGH. Otherwise the line is said to be active-LOW.

Figure 3.34

Figure 3.35

Which Gate Representation to Use? If the circuit is being used to cause some action when output goes to the 1 state, then use active-HIGH representation. If the circuit is being used to cause some action when output goes to the 0 state, then use active-LOW representation. Bubble placement: choose gate symbols so that bubble outputs are connected to bubble inputs, and vice versa.

Figure 3.36

IEEE Standard Logic Symbols NOT AND OR NAND NOR 1 A x A & x B A ≧1 x A & x A ≧1 x B B B