04 - Boolean Algebra_1

Boolean Algebra
and Logic Gates

Outline
1. Basic Definitions
2. Axiomatic Definition of Boolean Algebra
3. Basic Theorems and Properties of Boolean
Algebra
4. Boolean Functions
5. Canonical and Standard Forms
6. Other Logical Operations
7. Digital Logic Gates
8. Integrated Circuits
History and Features of Boolean
Algebra
◼ George Boole (an English mathematics
professor) introduced Boolean algebra
◼ Boolean algebra is composed of:
 Sets of elements S
 Set of operators like ●(Λ), (┐), +(v)
 Postulates
The Postulates for Various
Algebra Structure
1. Closure
2. Associative law
3. Commutative law
4. Identity element
5. Inverse
6. Distributive law
Boolean Algebra Postulates
◼ Closure
A 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(+): closed
 Minus(-):not closed (2-3=-1)
(cont.)
◼ Closure:
 Closure w.r.t operator ● :
0●0=0 1●0=0
0●1=0 1●1=1
 Closure w.r.t operator + :
0+0=0 1+0=1
0+1=1 1+1=1
(cont.)
◼ Identity element:
element w.r.t operator ● : 1
 Identity
x●1=x
 Identity
element w.r.t operator + : 0
x+0=x
(cont.)
◼ Inverse element:
 For every element x, there exists
element x’ (complement of x) such that
x + x’= 1 x ● x’= 0
(cont.)
◼ Commutative:
 Commutative w.r.t operator ● :
x●y=y●x
 Commutative w.r.t operator +
: x+y=y+x
(cont.)
◼ Associative:
 Associative w.r.t operator ● :
x ● (y ● z) = (x ● y) ● z
 Associative w.r.t operator + :
x + (y + z) = (x + y) + z
(cont.)
◼ Distributive:
● is distributive over + :
x ● (y + z) = (x ● y) + (x ● z)
 + is distributive over ● :
x + (y ● z) = (x + y) ● (x + z)
Differences Between Boolean
Algebra and Ordinary Algebra
◼ The distributive law over + holds for
Boolean algebra but not ordinary algebra
x + (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
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
Operator Precedence
1. Parentheses
2. Not
3. AND
4. OR
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
Example
◼ Prove Theorem 1(a) : x + x = x
x + 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
Example
◼ Prove Theorem 1(b) : x . x = x
x . 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.
Example
◼ Prove Theorem 2(a) : x + 1 = 1
x + 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
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
Example
◼ Verify the absorption theorem by Truth
Table.
x y xy x+xy
0 0 0 0
0 1 0 0
1 0 0 1
1 1 1 1
x+xy=x
Example
◼ Verify DeMorgan’s Theorem by Truth Table
X y x + y (x + y)’ x’ y’ x’y’
0 0 0 1 1 1 1
0 1 1 0 1 0 0
1 0 1 0 0 1 0
1 1 1 0 0 0 0
(x + y)’ = x’ y’
Boolean function
◼ Binary variables (0 or1)
◼ Binary Operators: OR and AND
◼ Unary Operator NOT
◼ Parentheses
◼ An equal sign
Implementing functions
F1 = x + y’z F2 = x’y’z + x’yz + xy’
Gate Implementation of
F1 = x + y’z
Gate Implementation of
F2= x’y’z + x’yz + xy’
Simplifying F2
◼ F2 = x’y’z + x’yz + xy’
= x’z(y’ + y) + xy’
= x’z + xy’ (reduced form)
Gate Implementation of reduced
F2 = x’z + xy’
Simplify the following Boolean
Functions
◼ F = x(x’ + y)
= xx’ + xy
= 0 + xy
= xy
Functions
◼ F = x + x’y
= (x + x’)(x + y)
= 1(x + y)
= (x + y)
Functions
◼ F = (x + y)(x+ y’)
= x + xy + xy’ +yy’
= x(1 + y + y’) (yy’= 0)
=x (y+y’=1)
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
(A+B+C+D+E+F)’ = A’B’C’D’E’F’
Example
◼Find the Complement Function of:
F1 = x’yz’ + x’y’z
F1’ = (x’yz’ + x’y’z)’
= (x’yz’)’ . (x’y’z)’
= (x + y’ + z) (x + y + z’)
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’)

04 - Boolean Algebra_1

Uploaded by

Copyright:

Available Formats

04 - Boolean Algebra_1

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

04 - Boolean Algebra_1

Uploaded by

Copyright:

Available Formats

Boolean Algebra

and Logic Gates

You might also like