Digital Logic Design

Chapter#02
Overview of Chapter 2: Boolean
Algebra and Logic Gates
• Boolean Algebra?
• Mathematical method to simplify the digital circuits;
• Finding simpler and cheaper but equivalent realization;
• That can help in reducing the overall cost.
• So, Boolean algebra helps us to reduce the number of logic gates.
• Chapter 2 gives the foundation of Boolean Algebra to reduce logic
gates in digital circuits.
Topics of Chapter 2
• Introduction
• Basic Definitions
• Axiomatic Definition of Boolean Algebra
• Basic Theorems and Properties of Boolean Algebra
• Boolean Functions
• Canonical and Standard Forms
• Other Logical Operations
• Digital Logic Gates
• Integrated Circuits
Basic Definitions
• Boolean algebra, like other mathematical systems may be defined as:
1. Set of elements S
2. Set of Operators
3. Number of axioms and postulates
• A set of elements is any collection of objects, usually having a common property. Like S={x,y}, here,
x ∈ S and y ∈ S.
• A binary operator defined on a set of elements is a rule that assigns, to each pair from S and
results a unique element from S.
• Like c=a*b; if a∈S, b∈S and c∈S, only then * is called as a binary operator; otherwise not.
• Postulates are the basic assumptions of mathematical systems to deduce:
• Rules
• Theorems
• Properties of system
Basic Definitions
• The most common postulates to formulate various algebraic structure
are:
• Closure:
• A set S is closed w.r.t a binary operator if for every pair of elements of S,
the binary operator follows a rule of obtaining unique element from S.
• Like Natural numbers set hold closure property w.r.t binary operator ‘+’.
• N={1,2,3…} and c=a+b if a=1 and b=2 results c=3 also belong to N.
• In contrast, natural number not holds closure property w.r.t binary
operator ‘-’.
• c=a-b if a=3 and b=5 results c=-2 not belongs to N.
Basic Definitions
• Associative Law:
• A binary operator * on a set S is said to be associative whenever
• (x*y)*z=x*(y*z), here x,y,z ∈ S.
• Commutative Law:
• A binary operator * on a set S is said to be commutative whenever
• x*y=y*x, here x,y ∈ S.
• S={0,1} 0*1=1*0;
• Identity Element:
• A set S={0,1} is said to have identity element w.r.t binary operator * on S if there exists on element e ∈S with property
e*x=x*e=x for every x ∈ S.
• If binary operator * is addition, the additive identity is 0.
• 0+x=x+0=x
• If binary operator * is multiplication, the multiplicative identity is 1.
• 1.x=x.1=x
• Natural numbers has no additive identity.
Basic Definitions
• Inverse:
• A set S having the identity element e ∈ S w.r.t binary operator * is said to have inverse whenever, for every x ∈
S, there exists an element y ∈ S such that x*y=e.
• For binary operator +, we have additive inverse x+(-x)=0 all belong to S.
• For binary operator ., we have multiplicative inverse x.=1 or x.=1
• Distributive Law:
• * &. are two binary operators on set S, * is said to be distributive over . if
• x*(y.z)=(x*y)+(x*z)
• And . is said to be distributive over * if
• x.(y*z)=(x.y)*(x.z)
• A field is a set elements, together with two binary operators, each having properties from 1 to 6.
• A filed is the example of algebraic structure.
• Example, the set of real numbers, together with the binary operators + & . Forms the field of real numbers.
• This field of real numbers are the basics for arithmetic and ordinary algebra.
Basic Definitions
• These postulates have the following meanings:
• The Binary operator + defines addition
• Additive identity is 0.
• Additive inverse define subtraction
• The binary operator . Defines multiplication
• The multiplicative identity is 1.
• The multiplicative inverse of x is .
• Distributive law:
• +&. are two binary operators
• + distributive over .
• x+(y.z)=(x+y).(x+z)
• . distributive over +.
• x.(y+z)=(x.y)+(x.z)
Axiomatic Definition of Boolean
Algebra
• In 1854 George Boole has developed Boolean Algebra.
• In 1938 Shannon introduced two valued Boolean Algebra (0&1) called as switching algebra.
• For the formal definition of Boolean Algebra, we shall the employ the postulates formulated by Huntington in
1904.
• Boolean Algebra is an algebraic structure defined by:
• Set of elements B.
• Together with two binary operators +&.
• Provided the following Huntington postulates are satisfied:
• 1(a)- The structure is closed w.r.t +.
• 1(b)- The structure is closed w.r.t ..
• 2(a)- Additive identity w.r.t + is 0. 0+x=0+x=x
• 2(b)-Multiplicative identity w.r.t is 1. x.1=1.x=x
• 3(a)- Structure is commutative w.r.t +. x+y=y+x.
• 3(b)-Structure is commutative w.r.t .. x.y=y.x
Axiomatic Definition of Boolean
Algebra
• 4(a)- The operator . is distributive over +.
• x.(y+z)=(x.y)+(x.z)
• 4(b)- The operator + is distributive over..
• x+(y.z)=(x+y).(x+z)
• 5-For every element x ∈ S, there exists ∈ S (complement) such that
• x+=1 and x. =0.
• 6-There exist at least two elements x,y ∈ S suct that x is not equal to y.
• So, in Boolean algebra we have,
• 1- elements of set B.
• 2- rules of operation for the two binary operators.
• Set of elements B, together with the two operators, satisfy six huntington postulates.
• Now, we’ll learn two valued Boolean algebra instead of simple Boolean algebra.
• In two valued Boolean algebra, the set B have only values 0 &1.
• We are focusing only on two valued Boolean algebra because we want to implement it on gate typed circuits used in
Digital Circuits.
Two valued Boolean Algebra
• A two valued Boolean algebra is defined on set B={0,1}
• With the rules of two binary operators +&..
• As shown in the followings operator tables:

x y x.y x y x+y
x
0 0 0 0 0 0
0 1
0 1 0 0 1 1
1 0
1 0 0 1 0 1
1 1 1 1 1 1
Two valued Boolean Algebra
• These rules are exactly same as the AND, OR and NOT defined in Chapter 1.
• Here we have to clear two things.
• 1- Boolean Algebra binary operators + &.
• 2- Two valued Boolean algebra operators +&..
• We must show that the Huntington postulates are valid on B and . &+.
• 1. Structure is closed w.r.t + &.. (verified from tables)
• 2(a)- Additive identity is 0: x+0=0+x=x; 0+0=0, 0+1=1+0=1
• 2(b)- Multiplicative identity is 1: x.1=1.x=x; 0.1=1.0=0
• 3- Commutative are obvious from AND, OR and NOT tables.
• 4- distributive law, we can cross check from truthtables.
Two valued Boolean Algebra
• 4(a)- . Over +: x.(y+z)=(x.y)+(x.z). Three binary variables, it means in
truth table we have combinations.
x y z y+z x.y x.z (x.y)+(x.z) x.(y+z)
0 0 0 0 0 0 0 0
0 0 1 1 0 0 0 0
0 1 0 1 0 0 0 0
0 1 1 1 0 0 0 0
1 0 0 0 0 0 0 0
1 0 1 1 0 1 1 1
1 1 0 1 1 0 1 1
1 1 1 1 1 1 1 1
Two valued Boolean Algebra
• 4(b)- Same we can verify for + over .: x+(y.z)=(x+y).(x+z)
Two valued Boolean Algebra
• 5- From the complement table, it is easy to show that
• 5(a)- x+=1: 0+; 1+1+0=1
• 5(b)- x. =0: 0. =0.1=0; 1.
• 6- This postulate is also satisfied on B={0,1},only two elements and both are not equal.
• So, we have established a two valued Boolean algebra set B with two binary operators + &.
• Equivalent to AND, OR and NOT operators
• Boolean algebra has been defined in a formal mathematical manner and equivalent to binary
logic.
• Two valued Boolean algebra is now Binary Logic.
• We are here to discuss only two valued Boolean algebra because we have to use only 0’s
and 1’s in logic gates and on digital circuits and we’ll call two valued Boolean algebra, only
Boolean algebra and that is equivalent to binary logic.
Basic Theorems and Properties of
Boolean Algebra
• Huntington postulates were listed in pairs (a) & (b).
• One part may be obtained from the other if binary operators and
binary elements are interchanged.
• This important property is called as Duality Principle.
• To find the counterpart, we simply need to interchange AND with OR,
OR with AND & identity elements 0 with 1 and 1 with 0.
Basic Theorems and Properties of
Boolean Algebra
Basic Theorems and Properties of
Boolean Algebra
• Postulates are the basic assumptions but theorems needs to be
verified:
• See board…
Operator Precedence
I. Solve parentheses if available.
II. NOT gate
III. AND gate
IV. OR gate
• Examples are De Morgans