Scribd
Upload
15 views25 pages

EEE 3103 - Boolean Functions-Canonical & Standard Forms

This document covers Boolean algebra and logic gates, focusing on Boolean functions, their complements, and canonical forms. It explains how to manipulate Boolean expressions for simplification and introduces standard forms such as sum of products (SOP) and product of sums (POS). The document also includes examples and exercises to illustrate these concepts.

Uploaded by

mahmudhasansami
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views25 pages

EEE 3103 - Boolean Functions-Canonical & Standard Forms

This document covers Boolean algebra and logic gates, focusing on Boolean functions, their complements, and canonical forms. It explains how to manipulate Boolean expressions for simplification and introduces standard forms such as sum of products (SOP) and product of sums (POS). The document also includes examples and exercises to illustrate these concepts.

Uploaded by

mahmudhasansami
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 25

EEE 3103:Digital Electronics-I

Chapter-2:Boolean Algebra and Logic Gates(Continued)


[Boolean Functions, Complement of a Function &
Canonical Forms]
Reference: Digital Logic and Computer Design by M. Morris Mano [3rd Edition] &
Digital Design by M. Morris Mano [5th Edition]

Prepared by-
Baizeed Ahmed Bhuiyan
Lecturer (Grade-I)
Department of Electrical and Electronic Engineering
Ahsanullah University of Science and Technology
A Boolean function described by an algebraic expression consists of
binary variables, the constants 0 and 1, and the logic operation
symbols. For a given value of the binary variables, the function can be
equal to either 1 or 0. As an example, consider the Boolean function
F1 = x + y’z
The function F1 is equal to 1 if x is equal to 1 or if both y and z are
equal to 1. F1 is equal to 0 otherwise. The complement operation
dictates that when y = 1, y’= 0. Therefore, F1 = 1 if x = 1 or if y = 0
and z = 1. A Boolean function expresses the logical relationship
between binary variables and is evaluated by determining the binary
value of the expression for all possible values of the variables.
❑ Boolean Functions
❑ Algebraic Manipulation
When a Boolean expression is implemented with logic gates, each
term requires a gate and each variable within the term designates an
input to the gate. We define a literal to be a single variable within a
term, in complemented or uncomplemented form. The function of
Fig. 2.2 (a) has three terms and eight literals, and the one in
Fig. 2.2 (b) has two terms and four literals. By reducing the number of
terms, the number of literals, or both in a Boolean expression, it is
often possible to obtain a simpler circuit. The manipulation of Boolean
algebra consists mostly of reducing an expression for the purpose of
obtaining a simpler circuit.
An easier way to simplify function 3 is by means of postulate 4(b) from
Table 2.1 : (x + y)(x + y’) = x + yy’ = x.
De Morgan’s theorems for any number of variables resemble the two‐variable case
in Form. These theorems can be generalized as follows:

The generalized form of DeMorgan’s theorems states that the complement of a function
is obtained by interchanging AND and OR operators and complementing each literal.
For example, the function f1 in Table 2.4 is determined by expressing the combinations
001, 100, and 111 as x’y’z, xy’z’, and xyz, respectively. Since each one of these minterms
results in f1 = 1, we have
f1 = x’y’z + xy’z’ + xyz = m1 + m4 + m7
Boolean functions expressed as a sum of minterms or
product of maxterms are said to be in canonical form .

𝒎𝒊𝒏𝒕𝒆𝒓𝒎 = 𝑴𝒂𝒙𝒕𝒆𝒓𝒎
❑ Product of Maxterms:
To express a Boolean function as a product of
maxterms, it must first be brought into a form of OR
terms. This may be done by using the distributive law,
x + yz = (x + y)(x + z). Then any missing variable x in
each OR term is ORed with xx’. The procedure is
clarified in the following example.
➢ Exercise-2.20 (Digital Logic and Computer Design by M. Morris Mano)
The complement of a function expressed as the sum of minterms equals the sum of minterms missing from the original
function. This is because the original function is expressed by those minterms which make the function equal to 1, whereas
its complement is a 1 for those minterms for which the function is a 0. As an example, consider the function
Standard Forms
The two canonical forms of Boolean algebra are basic forms that one obtains from reading a given
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.

Another way to express Boolean functions is in standard form. In this configuration, the terms that
form the function may contain one, two, or any number of literals. There are two types of standard
forms: the sum of products and products of sums.

SOP: The sum of products is a Boolean expression containing AND terms, called product terms,
with one or more literals each. The sum denotes the ORing of these terms. An example of a function
expressed as a sum of products is
F1=y’+xy+x’yz’

POS: A 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. An example of a
function expressed as a product of sums is
F2= x (y’+z) (x’+y+z’)

You might also like