Digital Logic Design ESGD2201

Slides:



Advertisements
Similar presentations
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Advertisements

Boolean rules for simplification Dr. Ahmed Telba.
1 COMP541 Combinational Logic Montek Singh Jan 16, 2007.
Digital Fundamentals Floyd Chapter 4 Tenth Edition
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Digital Fundamentals with PLD Programming Floyd Chapter 4
Chapter 5 Boolean Algebra and Reduction Techniques 1.
Boolean Algebra. Introduction 1854: Logical algebra was published by George Boole  known today as “Boolean Algebra” 1854: Logical algebra was published.
01 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Boolean Algebra and Logic Simplification. Boolean Addition & Multiplication Boolean Addition performed by OR gate Sum Term describes Boolean Addition.
Digital Logic Design Adil Waheed. BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION AND gate F = A.B OR gate F = A + B NOT gate F = A NAND gate F = A.B NOR gate.
Boolean Algebra. Binary Logic and Gates Binary variables take on one of two values. Logical operators operate on binary values and binary variables. Basic.
CHAPTER 2 Boolean Algebra
EEE324 Digital Electronics Ian McCrumRoom 5B18, Lecture 4: Boolean Algebra.
DeMorgan Theorem, Computer Simulation Exercises
Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.
Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.
LOGIC GATES & TRUTH TABLE – Digital Circuit 1 Choopan Rattanapoka.
Combinational Logic 1.
Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.
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.
Laws (Theorems) of Boolean algebra Laws of Complementation oThe term complement means, to invert or to change 1's to 0's and 0's to 1's, for which purpose.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
Boolean Algebra & Logic Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 4 © 2008 Pearson Education.
Chapter 2 Boolean Algebra and Minimization Techniques.
Laws of Boolean Algebra Commutative Law Associative Law Distributive Law Identity Law De Morgan's Theorem.
Laws (Theorems) of Boolean algebra Laws of Complementation oThe term complement means, to invert or to change 1's to 0's and 0's to 1's, for which purpose.
DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
Digital Logic Design Dr. Oliver Faust Chapter 4
School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.
Boolean Algebra ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
Lecture 5 More Boolean Algebra A B. Overview °Expressing Boolean functions °Relationships between algebraic equations, symbols, and truth tables °Simplification.
DE MORGAN’S THEOREM. De Morgan’s Theorem De Morgan’s Theorem.
DeMorgan’s Theorem DeMorgan’s 2 nd Theorem The complement of a sum of variables is equal to the product of the complemented variables. A + B = A. B Applying.
Logic Gates and Boolean Algebra Introduction to Logic II.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Introduction to Digital Electronics Lecture.
Boolean Operations and Expressions Addition = = = = 1 Multiplication 0 * 0 = 0 0 * 1 = 0 1 * 0 = 0 1 * 1 = 1.
Boolean Algebra How gates get picked. Boolean Arithmetic Boolean ≠ Binary – Boolean – 1/0 only, no places Boolean addition:
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Boolean Algebra & Logic Gates
Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也
De Morgan’s Theorem,.
DeMorgan’s Theorem DeMorgan’s 2nd Theorem
Unit 2 Boolean Algebra.
Boolean Algebra & De Morgan's Theorems
Logic Gates and Boolean Algebra
CS 105 Digital Logic Design
Gate Circuits and Boolean Equations
CHAPTER 2 Boolean Algebra
CHAPTER 1 : INTRODUCTION
CHAPTER 2 Boolean Algebra This chapter in the book includes:
Boolean Algebra.
Princess Sumaya University
Boolean Expressions Lecture No. 10.
TN 221: DIGITAL ELECTRONICS 1
BASIC & COMBINATIONAL LOGIC CIRCUIT
Boolean Algebra.
Boolean Algebra.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)
Digital Fundamentals Floyd Chapter 4 Tenth Edition
Laws & Rules of Boolean Algebra
Computer Architecture
Boolean Algebra S.SADHISH PRABHU.
Presentation transcript:

Digital Logic Design ESGD2201 University of Palestine Faculty of Engineering and Urban planning Software Engineering Department Digital Logic Design ESGD2201 Lecture 5 Boolean Algebra and Logic Simplification Eng. Mohammed Timraz Electronics & Communication Engineer Sunday, 18th June 2008

Agenda Boolean Algebra and Logic Simplification 1. Boolean Operations and Expressions. 2. Laws and Rules of Boolean Algebra. 3. DeMorgan’s Theorems. 4. Boolean Analysis of Logic Circuits. 5. Simplification Using Boolean Algebra. 6. Standard Forms of Boolean Expressions. 7. Boolean Expressions and Truth Tables.

Boolean Algebra and Logic Simplification 1. Boolean Operations and Expressions. Boolean algebra is the mathematics of digital systems. A basic knowledge of Boolean algebra is indispensable to the study and analysis of logic circuits. Boolean operations and expressions in terms of their relationship to NOT, AND, OR, NAND and NOR gates were introduce.

Boolean Algebra and Logic Simplification 1. Boolean Operations and Expressions. A variable is a symbol used to represent a logical quantity (usually an italic uppercase letter). The Complement is the inverse of a variable and is indicated by a bar over the variable. For example: A is a variable. Ā is the complement.

Boolean Algebra and Logic Simplification 1. Boolean Operations and Expressions. For example: If a variable A = 1, Then Ā = 1. (is the complement). The complement of variable A is read as “A not” or “A bar”. Sometimes a prime symbol rather than an overbar is used to denote the complement of a variable, B’ indicates the complement of B, in this course only the overbar is used.

Boolean Algebra and Logic Simplification Boolean Addition. The Boolean addition is equivalent to the OR operation and the basic rules as follows: 0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 + 1 = 1 In Boolean Algebra, a Sum Term is a sum of literals. In logic circuits, a sum term is produced by an OR operation with no AND operations involved.

Boolean Algebra and Logic Simplification Boolean Addition. Some examples of sum terms are: A sum terms is equal to 1 when one or more of the literals in the terms are 1. A sum terms is equal to 0 if and only if each of the literals is 0.

Boolean Algebra and Logic Simplification Boolean Addition. Examples: Determine the values of A, B, C and D which make the sum term Equal to zero. Solution: For the sum terms to be 0, each of the literals in the terms must be 0. There for, A = 0, B = 1 so that , C = 0 , and D = 1 so that Then =

Boolean Algebra and Logic Simplification Boolean Multiplication. The Boolean addition is equivalent to the AND operation and the basic rules as follows: 0 . 0 = 0 0 . 1 = 0 1 . 0 = 0 1 . 1 = 1 In Boolean Algebra, a Product Term is a sum of literals. In logic circuits, a product term is produced by an AND operation with no OR operations involved.

Boolean Algebra and Logic Simplification Boolean Multiplication. Some examples of product terms are: A product terms is equal to 1 if each of the literals in the term is 1. A product terms is equal to 0 when one or more of the literals are 0.

Boolean Algebra and Logic Simplification Boolean Multiplication. Examples: Determine the values of A, B, C and D which make the sum term Equal to 1. Solution: For the sum terms to be 1, each of the literals in the terms must be 1. There for, A = 1, B = 0 so that , C = 1 , and D = 0 so that Then =

Boolean Algebra and Logic Simplification 2. Laws and Rules of Boolean Algebra. The basic laws of Boolean algebra are: 1- Commutative Laws. 2- Associative Laws. 3- Distributive Laws.

Boolean Algebra and Logic Simplification Laws of Boolean Algebra. 1- Commutative Laws. The commutative law of addition for two variables is written algebraically as: A + B = B + A

Boolean Algebra and Logic Simplification Laws of Boolean Algebra. 1- Commutative Laws. Application of commutative law of addition. A B A + B B A B + A ≡ A + B = B + A

Boolean Algebra and Logic Simplification Laws of Boolean Algebra. 1- Commutative Laws. The commutative law of multiplication for two variables is written algebraically as: AB = BA

Boolean Algebra and Logic Simplification Laws of Boolean Algebra. 1- Commutative Laws. Application of commutative law of multiplication. A B AB B A BA ≡ AB = BA

Boolean Algebra and Logic Simplification Laws of Boolean Algebra. 2- Associative Laws. The commutative law of addition for Three variables is written algebraically as: A + ( B + C ) = ( A + B ) + C

Boolean Algebra and Logic Simplification Laws of Boolean Algebra. 2- Associative Laws. Application of Associative law of addition. A A B A + ( B + C ) C A + ( B + C ) B ≡ C A + ( B + C ) = ( A + B ) + C

Boolean Algebra and Logic Simplification Laws of Boolean Algebra. 2- Associative Laws. The commutative law of multiplication for three variables is written algebraically as: A ( BC ) = ( AB ) C

Boolean Algebra and Logic Simplification Laws of Boolean Algebra. 2- Associative Laws. Application of Associative law of multiplication. A B C ( AB )C ≡ ( BC ) A( BC ) ( AB ) A ( BC ) = ( AB ) C

Boolean Algebra and Logic Simplification Laws of Boolean Algebra. 3- Distributive Laws. The distributive law is written algebraically for three variables as follows: A ( B + C ) = AB + AC

Boolean Algebra and Logic Simplification Laws of Boolean Algebra. 3- Distributive Laws. Application of Distributive law. A B C ≡ A ( B + C ) ( B + C ) AB + AC A ( B + C ) = AB + AC

Boolean Algebra and Logic Simplification Laws of Boolean Algebra. 2- Associative Laws. Application of Associative law of multiplication. A A( BC ) A ( AB ) B ( AB )C B ( BC ) ≡ C C A ( BC ) = ( AB ) C

Boolean Algebra and Logic Simplification Rules of Boolean Algebra. There are 12 basic rules that are useful in manipulating and simplifying Boolean expressions. Rules 1 through 9 will be viewed in terms of their application to logic gates. Rules 10 through 12 will be derived in terms of the simpler rules and laws previously discussed.

Boolean Algebra and Logic Simplification Rules of Boolean Algebra. Table of Basic Rules of Boolean algebra: 1. A + 0 = A 2. A + 1 = 1 3. A . 0 = 0 4. A . 1 = A

Boolean Algebra and Logic Simplification Rules of Boolean Algebra. Table of Basic Rules of Boolean algebra: 5. A + A = A 6. A + Ā = 1 7. A . A = A 8. A . Ā = 0 9. = A

Boolean Algebra and Logic Simplification Rules of Boolean Algebra. Table of Basic Rules of Boolean algebra: 10. A + AB = A 11. A + ĀB = A + B 12. (A + B) (A + C)= A + BC