Digital Systems: Boolean Algebra and Logic Gates

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
INTRODUCTION LOGICAL OPERATIONS TRUTH TABLE AND RULES.
Types of Logic Circuits
Chapter 2 Logic Circuits.
Boolean Algebra and Logic Gates
Digital Systems Logic Gates and Boolean Algebra
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.
Chapter 2: Boolean Algebra and Logic Functions
Boolean Algebra. Binary Logic and Gates Binary variables take on one of two values. Logical operators operate on binary values and binary variables. Basic.
Gate Circuits and Boolean Equations BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.
Boolean Algebra Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
CHAPTER 2 Boolean Algebra
Binary Logic and Gates Binary variables take on one of two values.
BOOLEAN ALGEBRA Saras M. Srivastava PGT (Computer Science)
LOGIC GATES & TRUTH TABLE – Digital Circuit 1 Choopan Rattanapoka.
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.
LOGIC GATES AND CIRCUITS Digital systems are said to be constructed by using logic gates. These gates are the AND, OR, NOT, NAND, NOR, EXOR and EXNOR gates.
Logic Gates and Boolean Algebra Wen-Hung Liao, Ph.D. 11/2/2001.
Figure 2.6. A truth table for the AND and OR operations. 2.3 Truth Tables 1.
Lecture 4 Boolean Algebra. Logical Statements °A proposition that may or may not be true: Today is Monday Today is Sunday It is raining °Compound Statements.
Binary Logic and Gates Boolean Algebra Canonical and Standard Forms Chapter 2: Boolean Algebra and Logic Gates.
Boolean Algebra & Logic Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
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.
BOOLEAN ALGEBRA – Digital Circuit 1 Choopan Rattanapoka.
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.
Boolean Algebra. BOOLEAN ALGEBRA Formal logic: In formal logic, a statement (proposition) is a declarative sentence that is either true(1) or false (0).
Boolean Algebra ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
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.
Basic Laws, theorems, and postulates of Boolean Algebra
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.
Hoda Roodaki Boolean Algebra Hoda Roodaki
ECE 301 – Digital Electronics
Computer Code.
Logic Gates and Boolean Algebra
Chapter 3 Notes – Part II Review Questions
Logic Gates.
De Morgan’s Theorem,.
Chapter 2: Boolean Algebra and Logic Functions
Boolean Algebra.
Unit 2 Boolean Algebra.
Logic Gates and Boolean Algebra
CS 105 Digital Logic Design
Gate Circuits and Boolean Equations
CHAPTER 2 Boolean Algebra
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
CHAPTER 2 Boolean Algebra This chapter in the book includes:
Overview Part 1 – Gate Circuits and Boolean Equations
Boolean Algebra.
FIGURES FOR CHAPTER 2 BOOLEAN ALGEBRA
Lecture 3: Boolean Algebra
CHAPTER 2 Boolean Algebra
Boolean Algebra.
Boolean Algebra.
Digital Systems: Logic Gates and Boolean Algebra
Boolean Algebra & Logic Circuits
Logic Gates.
Boolean Algebra.
Instructor: Alexander Stoytchev
Department of Electronics
BOOLEAN ALGEBRA.
Presentation transcript:

Digital Systems: Boolean Algebra and Logic Gates

DEFINITION: Boolean Algebra is the algebra of truth values and operations performing on them which is used in Digital Circuits for performing logical operations.

Boolean Constants and Variables Logical statements can have either two values yes or no, true or false, 0 or 1. Boolean 0 and 1 do not represent actual numbers but instead represent the state, or logic level. Closed switch Open switch Yes No High Low On Off True False Logic 1 Logic 0

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. 1 x B A Output Inputs A ? x B

Three Basic Logic Operators AND NOT

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

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

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’ A

LOGIC GATES OR AND NOT NAND NOR

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.

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.

NOT Gate The symbol and Truth Table for NOT gate is given below: A

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)

Examples 1,2

Examples 3

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

Examples

NAND Gate Boolean expression for the NAND operation: x = A B

NOR Gate Boolean expression for the NOR operation: x = A + B

Boolean Theorems and Laws x* 0 =0 Fallacy x+1=1 Tautology x*x=x Indempotence Law x+x=x Indempotence Law x*x’=0 Complementarity Law x+x’=1 Complementarity Law x” = x Involution Law x+0=x x* 1 =x

Boolean Theorems and Laws x+y = y+x // Commutative Law x*y = y*x x+(y+z) = (x+y)+z=x+y+z // Associative Law x(yz)=(xy)z=xyz x(y+z)=xy+xz // Distributive Law (w+x)(y+z)=wy+xy+wz+xz x+xy=x // Absorption Law

DeMorgan’s Theorems (x+y)’=x’y’ Implications and alternative symbol for NOR function (xy)’=x’+y’ Implications and alternative symbol for NAND function Process of Demorganization: (i) Complement entire function (ii) Change all AND to OR and all OR to AND (iii) Complement each of the individual variables

Demorgan’s Theorum

Demorgan’s Theorum

Universality of NAND Gates

Universality of NOR Gates

THANK YOU