MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Slides:



Advertisements
Similar presentations
Boolean Algebra and Logic Gates
Advertisements

Lecture 5 EGRE 254 1/28/09. 2 Boolean algebra a.k.a. “switching algebra” –deals with Boolean values -- 0, 1 Positive-logic convention –analog voltages.
Types of Logic Circuits
CS2100 Computer Organisation
Logical Systems Synthesis.
Chapter 2 Logic Circuits.
1 CK Cheng CSE Dept. UC San Diego CS 140, Lecture 2 Combinational Logic.
ECE 331 – Digital System Design Boolean Algebra (Lecture #3) The slides included herein were taken from the materials accompanying Fundamentals of Logic.
MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 1 Boolean Function Boolean function is an expression form containing binary variable, two-operator binary which.
EECC341 - Shaaban #1 Lec # 5 Winter Switching Algebra: Principle of Duality Any theorem or identity in switching algebra remains true if.
1 Section 10.1 Boolean Functions. 2 Computers & Boolean Algebra Circuits in computers have inputs whose values are either 0 or 1 Mathematician George.
Boolean Algebra and Logic Gates
Contemporary Logic Design Two-Level Logic © R.H. Katz Transparency No. 3-1 Chapter #2: Two-Level Combinational Logic Section 2.1, Logic Functions.
CS1104: Computer Organisation Lecture 3: Boolean Algebra
Chapter 2: Boolean Algebra and Logic Functions
Boolean Algebra Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
CS1104: Computer Organisation School of Computing National University of Singapore.
Boolean Algebra – I. Outline  Introduction  Digital circuits  Boolean Algebra  Two-Valued Boolean Algebra  Boolean Algebra Postulates  Precedence.
BOOLEAN ALGEBRA Saras M. Srivastava PGT (Computer Science)
Boolean Algebra and Digital Circuits
Digital Systems: Boolean Algebra and Logic Gates
Module 4.  Boolean Algebra is used to simplify the design of digital logic circuits.  The design simplification are based on: Postulates of Boolean.
Logic Design Dr. Yosry A. Azzam.
Chapter 4 Combinational Logic Design Principles. Overview Objectives -Define combinational logic circuit -Analysis of logic circuits (to describe what.
CT455: Computer Organization Boolean Algebra
Unit 1 Minimization Techniques and Logic Gates. Introduction to Digital Systems Analog devices and systems process time-varying signals that can take.
1 Boolean Algebra  Digital circuits Digital circuits  Boolean Algebra Boolean Algebra  Two-Valued Boolean Algebra Two-Valued Boolean Algebra  Boolean.
1 BOOLEAN ALGEBRA Basic mathematics for the study of logic design is Boolean Algebra Basic laws of Boolean Algebra will be implemented as switching devices.
Figure 2.6. A truth table for the AND and OR operations. 2.3 Truth Tables 1.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI Dale Roberts, Lecturer Computer Science, IUPUI
Logic and Boolean Algebra. Logic statements  Real life statements  “I use public transportation when the car is broken and I have to go to work”  “All.
1 CSE370, Lecture 3 Lecture 3: Boolean Algebra u Logistics u Last lecture --- Numbers n Binary numbers n Base conversion n Number systems for negative.
Boolean Algebra – II. Outline  Basic Theorems of Boolean Algebra  Boolean Functions  Complement of Functions  Standard Forms.
A. Abhari CPS2131 Chapter 2: Boolean Algebra and Logic Gates Topics in this Chapter: Boolean Algebra Boolean Functions Boolean Function Simplification.
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.
1 Lect # 2 Boolean Algebra and Logic Gates Boolean algebra defines rules for manipulating symbolic binary logic expressions. –a symbolic binary logic expression.
Logic Circuits Lecture 3 By Amr Al-Awamry. Basic Definitions Binary Operators  AND z = x y = x yz=1 if x=1 AND y=1  OR z = x + y z=1 if x=1 OR y=1 
CEC 220 Digital Circuit Design Boolean Algebra I Wed, Sept 2 CEC 220 Digital Circuit Design Slide 1 of 13.
CEC 220 Digital Circuit Design Boolean Algebra Friday, January 17 CEC 220 Digital Circuit Design Slide 1 of 22.
Module 5.  In Module 3, you have learned the concept of Boolean Algebra which consists of binary variables and binary operator.  A binary variable x,
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI Dale Roberts, Lecturer Computer Science, IUPUI
1 Digital Design Debdeep Mukhopadhyay Associate Professor Dept of Computer Science and Engineering NYU Shanghai and IIT Kharagpur.
ECE DIGITAL LOGIC LECTURE 8: BOOLEAN FUNCTIONS Assistant Prof. Fareena Saqib Florida Institute of Technology Spring 2016, 02/11/2016.
ECE DIGITAL LOGIC LECTURE 6: BOOLEAN ALGEBRA Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2016, 02/01/2016.
Boolean Algebra. BOOLEAN ALGEBRA Formal logic: In formal logic, a statement (proposition) is a declarative sentence that is either true(1) or false (0).
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 Algebra and Logic Gates COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals.
CS2100 Computer Organisation
Chapter 2: Boolean Algebra and Logic Functions
Boolean Algebra.
ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2 Instructor: Andrew B. Kahng (lecture)
CS 105 Digital Logic Design
CHAPTER 2 Boolean Algebra
CHAPTER 2 Boolean Algebra This chapter in the book includes:
Princess Sumaya University
Lecture 3: Boolean Algebra
Boolean Algebra.
CSE 311 Foundations of Computing I
Boolean Algebra.
Digital Systems: Logic Gates and Boolean Algebra
Boolean Algebra.
Chapter 2 Boolean Algebra and Logic Gate
CSE 370 – Winter Combinational Logic - 1
Boolean Algebra Introduction CSCI 240
Lecture 3: Boolean Algebra
Lecture 3: Boolean Algebra
BOOLEAN ALGEBRA.
Presentation transcript:

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR Boolean Algebra Logic Circuit Boolean Algebra Two Value Boolean Algebra Boolean Algebra Postulate Priority Operator Truth Table & Prove Duality Principal MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR Boolean Algebra Algebra Boolean Basic Theorem Boolean Function Invert Function Standard Form Minterm & Maxterm Canonical Forms Canonical Forms Conversion Binary functions MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR Logic Circuit Logic circuit can be represented by block with inputs on one side and outputs on the other side Input/output signal is discrete/digital, always represented by two voltage (high voltage/low voltage) Difference between digital and analog MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR Logic Circuit Advantage of Digital Circuit compared to Analog Circuit More reliable (simpler circuit, less noise) Give accuracy (can be determined) But slow response Main advantage of two-value logic circuit is Mathematical model – Boolean Algebra Assist in design, analysis, simplify logic circuit MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR Boolean Algebra (BA) What is an Algebra? (e.g algebra of integers) Set of elements (e.g. 0,1,2,…) Set of operations (e.g.+,-,*,…) Postulates/axioms (e.g. 0+x=x,…) Boolean Algebra is taken from George Boole who used BA to study human logical reasoning-calculus proposition Logic: TRUE or FALSE Operation: a or b, a and b, not a Example: If “it touched by the rain” or “poured with water”. “It’s tall” and “broad minded” MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR Boolean Algebra (BA) Shannon introduced switch algebra (for two-value Boolean Algebra) for two switch stable representation a b a and b F T a b a OR b F T a NOT a F T MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Two-Value Boolean Algebra Element Set: {0,1} Operation Set:{.,+,} Signals: High=5V=1; Low=0V= 0 x y x.y 1 x y x+y 1 x  x 1 MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Boolean Algebra Postulate Algebra Boolean contains element set B, with two operations binary {+} and {.} and operation {‘} Set B must contain at least element x and y Closure: For every x, y in B x+y is in B x.y is in B Commutative Law: For every x, y in B x+y = y+x x.y = y.x MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Boolean Algebra Postulate Associative Law: For every x, y, z in B (x+y)+z=x+(y+z)=x+y+z (x.y).z=x.(y.z)=x.y.z Identity: (0 and 1) 0+x=x+0=x for every x in B 1.x=x.1=x for every x in B Distributive Law: For every x, y,z in B x.(y+z)=(x.y)+(x.z) x+(y.z)=(x+y).(x+z) MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Boolean Algebra Postulate Complement: For every x in B, element x’ in B exist for x+x’=1 x.x’=0 Set B={0,1} and logical operation OR,AND, and NOT must obey all Boolean Algebra postulate. Boolean Function mapped several input {0,1} into {0,1} Boolean expression is Boolean statement which contains Boolean operator and variables. MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR Priority Operator To reduce the use of bracket in writing Boolean expression, priority operator is used Priority operator (before and after):’,.,+ Example a.b+c=(a.b)+c b’+c=(b’)+c a+b’.c=a+((b’).c) MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR Priority Operator Use bracket to overwrite priority Example a.(b+c) (a+b’) MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR Truth Table (TT) Prepare list of each combinational input which might come with matched output Example (2 input, 2 output) MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR Truth Table (TT) Example (3 input, 2 output) MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR Proving Using TT Can use TT for proving Prove:x.(y+z)=(x.y)+(x.z) Build TT for left and right expression Is left=right? If yes, the equation is true MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR Duality Principal Duality principal – each Boolean expression will be certified if identity of operators and elements are interchangeable + . 1  0 Example: Given expression a+(b.c)=(a+b).(b+c) therefore duality expression is a.(b+c)=(a.b)+(b.c) MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR Duality Principal Duality principal give free theorem “buy one, free one”. You only need to prove one theorem and get another one free. If (x+y+z)’=x’.y’.z’ is certified, therefore the duality is also certified (x.y.z)’=x’+y’+z’ If x+1=1 is certified, therefore the duality is also certified x.0=0 MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Boolean Algebra: Basic Theorem Apart from the postulate, there are useful several theorem Idempotency a) x+x=x b)x.x=x Prove: x+x = (x+x).1 (identity) = (x+x).(x+x’) (complement) = x+x.x’ (distributive) = x+0 (complement) = x (identity) MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Boolean Algebra: Basic Theorem NULL element for + and . operator a) x+1=1 b) x.0=0 Involution (x’)’=x Absorption a) x+x.y=x b) x.(x+y)=x Absorption (variant) a) x+x’.y=x+y b) x.(x’+y)=x.y MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Boolean Algebra: Basic Theorem DeMorgan a) (x+y)’=x’.y’ b) (x.y)’=x’+y’ Consensus a) x.y+x’.z+yz=x.y+x’.z b) (x+y).(x’+z).(y+z)=(x+y).(x’+z) MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Boolean Algebra: Basic Theorem Theorem can be proven using TT method. (Exercise: Prove DeMorgan Theorem using TT) It can also be proven from algebra manipulation process using postulate or other basic theorem MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR

Boolean Algebra: Basic Theorem Theorem 4a (absorption) can be proven with x+x.y = x.1+x.y (identity) = x.(1+y) (distributive) = x.(y+1) (interchange) = x.1 (theorem 2a) = x (identity) With duality, theorem 4b x.(x+y)=x Try to prove theorem 4b using algebra manipulation method MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR