ECE 106

DIGITAL ELECTRONICS 1:
LOGIC CIRCUIT AND
SWITCHING THEORY

Presented by:
Engr. Ronieto N. Mendoza
 CHAPTER 2

BOOLEAN ALGEBRA AND

LOGIC GATES
 CONTENT
THEOREMS AND PROPERTIES OF BOOLEAN ALGEBRA

BOOLEAN FUNCTIONS

IMPLEMENTATION OF BOOLEAN FUNCTIONS WITH GATES

SIMPLIFY THE FOLLOWING BOOLEAN FUNCTIONS

COMPLEMENT OF A BOOLEAN FUNCTION

CANONICAL & STANDARD FORMS

LOGIC GATES
 THEOREMS and PROPERTIES OF BOOLEAN
ALGEBRA

1. Closure – A set S is closed with respect to a binary

operator if, for every pair of element S, the binary
operator specifies a rule for obtaining a unique element
of S.

For example: The set of natural numbers N = {1, 2, 3, 4, . .

. } is closed with respect to the binary operator plus (+)
by the rules of arithmetic addition since for any a, b N
we obtain a unique c N by the operation a + b = c.
 THEOREMS and PROPERTIES OF BOOLEAN
ALGEBRA
2. Associative Law – A binary operator * on a set S is said to be associative
whenever
(x * y) * z = x * (y * z) for all x, y, z S

3. Commutative Law – A binary operator * on a set S is said to be commutative

whenever
x*y=y*x for all x, y S

4. Identity Element – A set S is said to have an identity element with respect to a

binary operation * on S if there exists an element e S with the property
e * x = x * e = x for every x S

Example: The element 0 is an identity element with respect to operation + on the set
of integers I = {…, -3, -2, -1, 0, 1, 2, 3, …} since x + 0 = 0 + x = x for any x I
 THEOREMS and PROPERTIES OF BOOLEAN
ALGEBRA

5. Inverse. A set S having the identity element e with respect to

a binary operator * is said to have an inverse whenever, for
every x S, there exist an element y S such that
x*y=e
Example: In the set of integers I with e = 0, the inverse of an element a is
(-a) since a + (-a) = 0.

6. Distributive Law. If * and • are two binary operators on a set

S, * is said to be distributive over • whenever
x * (y • z) = (x * y) • (x * z)
 THEOREMS and PROPERTIES OF BOOLEAN
ALGEBRA
The operators and postulates have the following meanings:

1. The binary operator + defines addition.

2. The additive identity is 0.
3. The additive inverse defines subtractions.
4. The binary operator • defines multiplication
5. The multiplicative identity is 1.
6. The multiplicative inverse of a = 1/a defines division.
7. The only distributive law applicable is that of • over +:
a • (b + c) = (a • b) + (a • c)
 THEOREMS and PROPERTIES OF BOOLEAN
ALGEBRA
• Boolean algebra is defined by a set of elements, B,
provided following postulates with two binary operators, +
.
and , are satisfied:
.
1. Closure with respect to the operators + and .
.
2. An identity element with respect to + and is 0 and
1,respectively.
.
3. Commutative with respect to + and . Ex: x + y = y + x
. . .
4. + is distributive over : x + (y z)=(x + y) (x + z)
. . .
. is distributive over + : x (y + z)=(x y) + (x z)
.
 Comparing Boolean algebra with
arithmetic and ordinary algebra
1. Huntington postulates don’t include the associative law, however, this holds
for Boolean algebra.
.
2. The distributive law of + over is valid for Boolean algebra, but not for
ordinary algebra.
3. Boolean algebra doesn’t have additive and multiplicative inverses;
therefore, no subtraction or division operations.
4. Postulate 5 defines an operator called complement that is not available in
ordinary algebra.
5. Ordinary algebra deals with the real numbers. Boolean algebra deals with
the as yet undefined set of elements, B, in two-valued Boolean algebra,
the B have two elements, 0 and 1.
THEOREMS and PROPERTIES OF BOOLEAN
ALGEBRA
THEOREMS and PROPERTIES OF BOOLEAN
ALGEBRA
THEOREMS and PROPERTIES OF
BOOLEAN ALGEBRA
 CONTENT
THEOREMS AND PROPERTIES OF BOOLEAN ALGEBRA

BOOLEAN FUNCTIONS

IMPLEMENTATION OF BOOLEAN FUNCTIONS WITH GATES

SIMPLIFY THE FOLLOWING BOOLEAN FUNCTIONS

COMPLEMENT OF A BOOLEAN FUNCTION

CANONICAL & STANDARD FORMS

LOGIC GATES
 Boolean Functions
•A binary variable can take the value of 0 or 1.

•A Boolean function is an expression formed with

binary variables, the two binary operators OR and
AND, and unary operator NOT, parentheses, and
an equal sign.
 Boolean Functions
•A literal is primed or unprimed variable.
When a Boolean function is implemented
with logic gates, each literal in the function
designates an input to a gate, and each term
is implemented with a gate.
 CONTENT
THEOREMS AND PROPERTIES OF BOOLEAN ALGEBRA

BOOLEAN FUNCTIONS

IMPLEMENTATION OF BOOLEAN FUNCTIONS WITH GATES

SIMPLIFY THE FOLLOWING BOOLEAN FUNCTIONS

COMPLEMENT OF A BOOLEAN FUNCTION

CANONICAL & STANDARD FORMS

LOGIC GATES
Implementation of Boolean functions with
Gates
Implementation of Boolean functions with
Gates
Implementation of Boolean functions with
Gates
Implementation of Boolean functions with
Gates
Implementation of Boolean functions with
Gates
 CONTENT
THEOREMS AND PROPERTIES OF BOOLEAN ALGEBRA

BOOLEAN FUNCTIONS

IMPLEMENTATION OF BOOLEAN FUNCTIONS WITH GATES

SIMPLIFY THE FOLLOWING BOOLEAN FUNCTIONS

COMPLEMENT OF A BOOLEAN FUNCTION

CANONICAL & STANDARD FORMS

LOGIC GATES
SIMPLIFY THE FOLLOWING BOOLEAN FUNCTIONS
SIMPLIFY THE FOLLOWING BOOLEAN FUNCTIONS
 CONTENT
THEOREMS AND PROPERTIES OF BOOLEAN ALGEBRA

BOOLEAN FUNCTIONS

IMPLEMENTATION OF BOOLEAN FUNCTIONS WITH GATES

SIMPLIFY THE FOLLOWING BOOLEAN FUNCTIONS

COMPLEMENT OF A BOOLEAN FUNCTION

CANONICAL & STANDARD FORMS

LOGIC GATES
Complement of a Boolean Function
 CONTENT
THEOREMS AND PROPERTIES OF BOOLEAN ALGEBRA

BOOLEAN FUNCTIONS

IMPLEMENTATION OF BOOLEAN FUNCTIONS WITH GATES

SIMPLIFY THE FOLLOWING BOOLEAN FUNCTIONS

COMPLEMENT OF A BOOLEAN FUNCTION

CANONICAL & STANDARD FORMS

LOGIC GATES
 Canonical & Standard Forms
•Canonical Forms
•Sum of Minterms
•Product of Maxterms

•Standard Forms
•Sum of Products (SOP)
•Product of Sums (POS)
 Canonical & Standard Forms
•Minterm
•n variable forming an AND term, with each
variable being primed or unprimed that provide
n
2 possible combinations.
•Maxterm
•n variable forming an OR term, with each
variable being primed or unprimed that provide
n
2 possible combinations.
Canonical & Standard Forms
 Canonical & Standard Forms
•A Boolean function may be expressed
algebraically from a given truth table by
forming a minterm for each combination
of variables that produces a 1 in the
function, and then taking the OR of all
those terms.
Canonical & Standard Forms
Canonical & Standard Forms
Canonical & Standard Forms
Canonical & Standard Forms
Canonical & Standard Forms
Canonical & Standard Forms
 Canonical & Standard Forms
•The two canonical forms of Boolean algebra are
basic forms that one obtains from reading a
function from the truth table.

•These forms are very seldom the ones with the

least number of literals, because each minterm or
maxterm must contain, by definition ALL the
variables either complemented or
uncomplemented.
 Canonical & Standard Forms
• Another way to express Boolean function is in standard form,
that may contain one, two or any number of literals unlike the
canonical form.

• Sum of Products (SOP) is a Boolean expression containing

AND terms, called product terms, of one or more literals each.
The sum denotes the ORing of these terms.
• Example: F1=y’ + xy + x’yz’
 Canonical & Standard Forms
• Product of sums is a Boolean expression containing OR terms,
called sum terms. Each term may have any number of literals.
The product denotes the ANDing of these terms.

• Example:F2=x (y’+z) (x’+y+z’+w)

Canonical & Standard Forms
 CONTENT
THEOREMS AND PROPERTIES OF BOOLEAN ALGEBRA

BOOLEAN FUNCTIONS

IMPLEMENTATION OF BOOLEAN FUNCTIONS WITH GATES

SIMPLIFY THE FOLLOWING BOOLEAN FUNCTIONS

COMPLEMENT OF A BOOLEAN FUNCTION

CANONICAL & STANDARD FORMS

LOGIC GATES
 LOGIC GATES
What is a Logic Gates?
Logic gates are electronic circuits that operate on one
or more input signals to produce an output signal.

What are the Logic Gates?

AND Inverter (Not) NAND XOR
OR Buffer NOR XNOR
LOGIC GATES
LOGIC GATES
LOGIC GATES
LOGIC GATES
LOGIC GATES
 LOGIC GATES
• The following are the most popular digital logic integrated
circuits family:
• TTL transistor-transistor logic
• ECL emitter-coupled logic
• MOS metal-oxide semiconductor
• CMOS complementary MOS

• (see also electronic circuit simulator for examples)

LOGIC GATES
 LOGIC GATES
The most important parameters distinguishing logic families
• Fan‐out specifies the number of standard loads that the output of a typical gate
can drive without impairing its normal operation. A standard load is usually
defined as the amount of current needed by an input of another similar gate in the
same family.
• Fan‐in is the number of inputs available in a gate. Power dissipation is the power
consumed by the gate that must be available from the power supply.
• Propagation delay is the average transition delay time for a signal to propagate
from input to output. For example, if the input of an inverter switches from 0 to 1,
the output will switch from 1 to 0, but after a time determined by the propagation
delay of the device. The operating speed is inversely proportional to the
propagation delay.
• Noise margin is the maximum external noise voltage added to an input signal that
does not cause an undesirable change in the circuit output.
LOGIC GATES
Thank You