boolean algebra and logic gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf ·...
TRANSCRIPT
![Page 1: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/1.jpg)
Boolean Algebra and Logic Gates
Dr. Bassem A. AbdullahComputer and Systems Department
Lectures Prepared by Dr.Mona Safar, Edited and Lectured by Dr.Bassem A. Abdullah
![Page 2: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/2.jpg)
Outline
1. Basic Definitions2. Axiomatic Definition of Boolean Algebra3. Basic Theorems and Properties of Boolean
Algebra4. Boolean Functions5. Canonical and Standard Forms6. Other Logical Operations7. Digital Logic Gates8. Integrated Circuits
![Page 3: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/3.jpg)
Boolean Algebra
In mathematics and mathematical logic, Boolean algebrais the branch of algebra in which: The values of the variables are the truth values true and false, usually
denoted 1 and 0 respectively. Instead of elementary algebra where the values of the variables are
numbers, and the main operations are addition and multiplication, the main operations of Boolean algebra are the conjunction and, denoted ∧, the disjunction or, denoted ∨, and the negation not, denoted ¬.
It is thus a formalism for describing logical relations in the same way that ordinary algebra describes numeric relations.
![Page 4: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/4.jpg)
Historical Background
George Boole (an English mathematics professor 1815-1864) introduced Boolean algebra in his first book The Mathematical Analysis of Logic (1847)
The term "Boolean algebra" was first suggested by Sheffer in 1913.
George Boole (British)1815-1864
![Page 5: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/5.jpg)
Historical Background In the 1930s, Claude Shannon observed that
one could apply the rules of Boole's algebra in switching circuits.
He introduced switching algebra as a way to analyze and design circuits by algebraic means in terms of logic gates.
Efficient implementation of Boolean functions is a fundamental problem in the design of combinational logic circuits.
Modern electronic design automation tools for VLSI circuits often rely on an efficient representation of Boolean functions. Claude Shannon (American)
1916-2001
![Page 6: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/6.jpg)
Features of Boolean Algebra
Boolean algebra is composed of: Sets of elements S Set of operators like ●(Λ), ′(┐), +(v) Postulates
![Page 7: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/7.jpg)
The Postulates for Various Algebra Structure1. Closure2. Associative law3. Commutative law4. Identity element5. Inverse6. Distributive law
![Page 8: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/8.jpg)
Boolean Algebra Postulates ClosureA set S is closed with respect to (w.r.t.) an
operator if, for operands consisting of elements of S, the operator specifies a rule for obtaining a unique element of S. Example:N = {1, 2, 3, …}, the set of natural number.Operator(+): closedMinus(-):not closed (2-3=-1)
![Page 9: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/9.jpg)
Boolean Algebra Postulates (cont.) Closure:Closure w.r.t operator ● :
0 ● 0 = 0 1 ● 0 = 10 ● 1 = 0 1 ● 1 = 1
Closure w.r.t operator + : 0 + 0 = 0 1 + 0 = 10 + 1 = 1 1 + 1 = 1
![Page 10: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/10.jpg)
Boolean Algebra Postulates (cont.) Identity element: Identity element w.r.t operator ● : 1
x ● 1 = x Identity element w.r.t operator + : 0
x + 0 = x
![Page 11: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/11.jpg)
Boolean Algebra Postulates (cont.) Inverse element:For every element x, there exists element
x’ (complement of x) such thatx + x’= 1 x ● x’= 0
![Page 12: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/12.jpg)
Boolean Algebra Postulates (cont.) Commutative:Commutative w.r.t operator ● :
x ● y = y ● xCommutative w.r.t operator + :
x + y = y + x
![Page 13: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/13.jpg)
Boolean Algebra Postulates (cont.) Associative:Associative w.r.t operator ● :
x ● (y ● z) = (x ● y) ● z
Associative w.r.t operator + : x + (y + z) = (x + y) + z
![Page 14: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/14.jpg)
Boolean Algebra Postulates (cont.) Distributive:● is distributive over + :
x ● (y + z) = (x ● y) + (x ● z)+ is distributive over ● :
x + (y ● z) = (x + y) ● (x + z)
![Page 15: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/15.jpg)
Differences Between Boolean Algebra and Ordinary Algebra The distributive law over + holds for
Boolean algebra but not ordinary algebrax + (y ● z) = (x + y) ● (x + z)
Boolean algebra has no additive or multiplicative inverse. Instead Boolean algebra has complement
x + x’= 1 x ● x’= 0
![Page 16: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/16.jpg)
Duality Principle
Every algebraic expression deducible from the postulates of Boolean algebra remains valid if the operators and identity elements are interchanged.
To get dual form: Interchange OR(+) and AND(.)Toggle 0’s and 1’s
![Page 17: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/17.jpg)
![Page 18: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/18.jpg)
Operator Precedence
1. Parentheses2. Not3. AND4. OR
![Page 19: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/19.jpg)
Outline
1. Basic Definitions2. Axiomatic Definition of Boolean Algebra3. Basic Theorems and Properties of Boolean
Algebra4. Boolean Functions5. Canonical and Standard Forms6. Other Logical Operations7. Digital Logic Gates8. Integrated Circuits
![Page 20: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/20.jpg)
Theorems of Boolean Algebra
Any of those theorems or postulates can be proofed by truth table or using the other theorems or postulates.
NOTE: x • y is ≡to x y
![Page 21: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/21.jpg)
Example
Prove Theorem 1(a) : x + x = xx + x = (x + x) . 1 by postulate 2-b
= (x + x) . (x + x’) 5-a= x + xx’ 4-b= x + 0 5-b= x 2-a
![Page 22: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/22.jpg)
Example
Prove Theorem 1(b) : x . x = xx . x = (x . x) + 0 by postulate 2-a
= (x . x) + (x . x’) 5-b= x (x + x’) 4-a= x . 1 5-a= x 2-b
Theorem 1(b) is dual of 1(a), each step of proof for 1(b) is dual for the corresponding step of proof of 1(a).
Any dual theorem can be derived by proof of its pair.
![Page 23: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/23.jpg)
Example
Prove Theorem 2(a) : x + 1 = 1x + 1 = (x + 1) . 1 by postulate 2-b
= (x + 1) . (x + x’) 5-a= x + ( x’.1) 4-b= x + x’ 2-b= 1 5-a
Prove Theorem 2(b) : x . 0 = 0 by duality
![Page 24: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/24.jpg)
Example
Prove Theorem 6(a) : x + xy = x (absorption)
x + xy = (x . 1) + (x . y) by postulate 2-b= x (1 + y) 4-a= x . 1= x
![Page 25: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/25.jpg)
Example
Verify the absorption theorem by Truth Table.
x + x y = x
x y xy x+xy0 0 0 00 1 0 01 0 0 11 1 1 1
![Page 26: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/26.jpg)
Example
Verify DeMorgan’s Theorem by Truth Table
(x + y)’ = x’ y’
X y x + y (x + y)’ x’ y’ x’y’0 0 0 1 1 1 10 1 1 0 1 0 01 0 1 0 0 1 01 1 1 0 0 0 0
![Page 27: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/27.jpg)
Outline
1. Basic Definitions2. Axiomatic Definition of Boolean Algebra3. Basic Theorems and Properties of Boolean
Algebra4. Boolean Functions5. Canonical and Standard Forms6. Other Logical Operations7. Digital Logic Gates8. Integrated Circuits
![Page 28: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/28.jpg)
Boolean function
Binary variables (0 or1) Binary Operators: OR and AND Unary Operator NOT Parentheses An equal sign
![Page 29: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/29.jpg)
Implementing functionsF1 = x + y’z F2 = x’y’z + x’yz + xy’
![Page 30: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/30.jpg)
Gate Implementation of F1 = x + y’z
![Page 31: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/31.jpg)
Gate Implementation of F2= x’y’z + x’yz + xy’
![Page 32: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/32.jpg)
Simplifying F2
F2 = x’y’z + x’yz + xy’= x’z(y’ + y) + xy’= x’z + xy’ (reduced form)
![Page 33: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/33.jpg)
Gate Implementation of reducedF2 = x’z + xy’
![Page 34: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/34.jpg)
Simplify the following Boolean Functions F = x(x’ + y)
= xx’ + xy= 0 + xy= xy
![Page 35: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/35.jpg)
Simplify the following Boolean Functions F = x + x’y
= (x + x’)(x + y)= 1(x + y)= (x + y)
![Page 36: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/36.jpg)
Simplify the following Boolean Functions F = (x + y)(x+ y’)
= x + xy + xy’ +yy’= x(1 + y + y’) (yy’= 0)= x (y+y’=1)
![Page 37: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/37.jpg)
Complement Function
Generalized form of DeMorgan’s Theorem(A+ B + C)’ = (A + X)’ Let B + C = X= A’ X’ DeMorgan’sTheorem= A’ (B + C)’ B+C = X= A’(B’C’) DeMorgan’s Theorem= A’B’C’ Associative Law
![Page 38: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/38.jpg)
Example
Find the Complement Function of:F1 = x’yz’ + x’y’zF1’ = (x’yz’ + x’y’z)’
= (x’yz’)’ . (x’y’z)’= (x + y’ + z) (x + y + z’)
![Page 39: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/39.jpg)
Example
Find the Complement Function of:F2 = x(y’z’ + yz)F2’ = [x(y’z’ + yz)]’
= x’ + (y’z’ + yz)’= x’ + [(y’z’)’ . (yz)’]= x’ + (y + z) (y’ + z’)
![Page 40: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/40.jpg)
Outline
1. Basic Definitions2. Axiomatic Definition of Boolean Algebra3. Basic Theorems and Properties of Boolean
Algebra4. Boolean Functions5. Canonical and Standard Forms6. Other Logical Operations7. Digital Logic Gates8. Integrated Circuits
![Page 41: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/41.jpg)
Canonical and Standard Forms
Minterms (Standard Product) Binary variables combined with AND
operation All possible products of any n binary
variables are called minterms or standard product:
Example: For 2 binary variables x and y. Minterms are: x’y’,x’y, xy’, xy
![Page 42: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/42.jpg)
Canonical and Standard Forms (cont.) Maxterms (Standard Sum) Binary variables combined with OR operation All possible sums of any n binary variables
are called maxterms or standard sum: Example: For 2 binary variables x and y.
Minterms are: x+y, x’+y’, x’+y, x+y'
![Page 43: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/43.jpg)
Minterms and Maxterms
Each maxterm is the complement of its corresponding minterm: mj’ = Mj
![Page 44: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/44.jpg)
Example
![Page 45: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/45.jpg)
![Page 46: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/46.jpg)
![Page 47: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/47.jpg)
![Page 48: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/48.jpg)
![Page 49: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/49.jpg)
Canonical forms Sum of minterms (Sum of Products SoP)F1= x’y’z + xy’z’ + xyz= m1 + m4 + m7
= ∑(1, 4, 7)F2= x’yz + xy’z + xyz’ + xyz= m3 + m5 + m6 + m7
= ∑(3, 5, 6, 7)
![Page 50: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/50.jpg)
Canonical forms (cont.) Product of maxterms (Product of Sums
PoS)F1= (x+y+z) (x+y’+z) (x+y’+z’) (x’+y+z’) (x’+y’+z) = M0M2M3M5M6
= π(0, 2, 3, 5, 6)F2= (x+y+z) (x+y+z’) (x+y’+z) (x’+y+z) = M0M1M2M4
= π(0, 1, 2, 4)
![Page 51: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/51.jpg)
Standard form gate implementation
F1 = y’ + xy + x’yz’ F2 = x(y’ + z)(x’+y+z’)
Sum of Products Product of Sums
![Page 52: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/52.jpg)
Functions of 2 binary variables
![Page 53: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/53.jpg)
![Page 54: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/54.jpg)
![Page 55: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/55.jpg)
![Page 56: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/56.jpg)
![Page 57: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/57.jpg)
![Page 58: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/58.jpg)
Multiple input logic gate
3-input NOR gate
3-input NAND gate
![Page 59: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/59.jpg)
3-input exclusive-OR gates (odd Parity checker)
![Page 60: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/60.jpg)
Positive and Negative Logic
Positive Logic Negative LogicLogic level Signal level Logic level Signal level0 L 0 H1 H 1 L
![Page 61: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/61.jpg)
Example of Negative Logic
Positive logic AND gate
Negative logic OR gate
Truth table with H and L
![Page 62: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/62.jpg)
Integrated Circuits (ICs)
Level of integration1. SSI: Small-scale Integration, Gates < 102. MSI: Medium-scale Integration, 10<Gates < 10003. LSI: Large-scale Integration, Gates > 10004. VLSI: Very Large-scale Integration, Gates >
100000
![Page 63: Boolean Algebra and Logic Gatesmct.asu.edu.eg/uploads/1/4/0/8/14081679/03-boolean_algebra.pdf · means in terms of logic gates. Efficient implementation of Boolean functions is a](https://reader033.vdocuments.net/reader033/viewer/2022041605/5e33e4d9589a2e1c4b5c4778/html5/thumbnails/63.jpg)
Digital gates ICs