See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/343361719

Chapter Four: Boolean Function Simplification

Chapter · August 2020

CITATIONS READS

0 5,957

1 author:

Qasim Mohammed Hussein

Al-Kunooze University College
108 PUBLICATIONS 174 CITATIONS

SEE PROFILE

All content following this page was uploaded by Qasim Mohammed Hussein on 09 April 2022.

The user has requested enhancement of the downloaded file.

 Chapter Four: Boolean Function Simplification

Boolean expression Simplification

Object
To learn how to simplify the Boolean expression using
algebraic means, and show the advantages of the
simplification.
4.1 Theory
Certain types of Boolean function lead to getting
circuits which are more desirable for most
implementation viewpoints. In dealing with gating
circuit, the Boolean function must be reduced to a
simpler form (standard form) containing fewer terms
and fewer variables. In Boolean function
simplification, the user can get alternative algebraic
expression for the same function. The simpler circuit is
more desirable because: (1) It contains fewer gates.
(2) There are fewer interconnections. (3) The circuit
becomes smaller and cheaper.
To simplification of Boolean function, there are two
methods:
1) Algebraic method which it uses Boolean algebra.

Assist. Prof Dr. Qasim Mohammed Hussein Page 116

 Chapter Four: Boolean Function Simplification

2) Map method which it will introduce in the next

experiment.

4.2 Algebraic Method

The canonical form of Boolean function, that obtained
from truth table, can be changed to simplification form
(standard form) using the postulates and theorems of
Boolean algebra. There are two types of form: sum of
product and product of sum.

4.2.1 Sum of Product

The sum of product is a Boolean function containing
AND terms (called product term) of one or more
variable each. The sum denotes the ORing of these
terms.

For example: F1 = X.Y.Z + Y + X.Y. The function F1

has three product terms of three, one, and two
variables. These three terms are sum together using an
OR operations. The product term is either a single
variable, or two or more variables ANDed together.
The function in this format is called sum-of-products.

Assist. Prof Dr. Qasim Mohammed Hussein Page 117

 Chapter Four: Boolean Function Simplification

Example 4-1: Simplify the Boolean function using

Boolean algebra method?
F(A,B,C)=AB + A(B+C) + B(B+C)
Solution
F(A,B,C)=AB + AB+AC + BB+BC
using distributive law
F(A,B,C)=AB +AC + B+BC using BB=B
=AB+AC+B+BC using AB+AB=AB
= AB + AC + B(1+C) using B+BC=B(1+C)
= AB+AC+B using 1+C=1; B.1=B
= B(A+1)+AC using AB+B=B(A+1)
= B.1 + AC using A+1=1
= B+AC using B.1=B

Example 4-2: Simplify the function

F(A,B,C) = (AB+AC) + ABC?
Solution
F(A,B,C) = (AB+AC) + ABC
= (AB) . (AC)+ABC
= (A+B).(A+C)+ABC
= AA+AC+AB+BC+ABC
= A+AC+AB+BC+ABC
Assist. Prof Dr. Qasim Mohammed Hussein Page 118
 Chapter Four: Boolean Function Simplification

= A+AC+BC+AB(1+C)
= A+AC+BC+AB
= A.(1+C)+BC+AB
= A+BC+AB
= A.(1+B)+BC
= A+BC
Example 4-3: simplify the Boolean function F2 using
sum of product?
F2 = X .Y. Z + X.Y .Z+ X.Y.Z+ X.Y.Z+ X.Y.Z
Solution
The simplification is done as follow:
F2 = X .Y. Z + X.Y .Z+ X.Y.Z+ X.Y.Z+ X.Y.Z

= X . Z .(Y + Y) + X.Y.(Z + Z) +X.Y.Z

= X . Z + X.Y + X.Y.Z
= X . Z + X. (Y + Y.Z)
= X . Z + X((Y+Y)(Y+Z))
= X . Z + X(Y+Z)
= Z+ X(Y+Z)
= Z + X.Y + XZ
= Z(1+X) + X.Y
= Z + X.Y
Assist. Prof Dr. Qasim Mohammed Hussein Page 119
 Chapter Four: Boolean Function Simplification

The two logic circuits that are shown in fig (4-1) and
fig (4-2) are equivalents. The circuit in fig (4-2)
includes the simplified form of the function in fig ( 4-
1).

Fig (4-1): F2 before simplification

Fig (4-2): F2 after simplification

Assist. Prof Dr. Qasim Mohammed Hussein Page 120

 Chapter Four: Boolean Function Simplification

Example 4-4:
Simplify the function F(X,Y,Z) = ∑(1,3,5,7) using sum
of product?
Solution
F(X,Y,Z) = XYZ + XYZ + XYZ + XYZ
= XZ(Y+Y) + XZ(Y+Y)
= XZ + XZ
= Z(X + X)
=Z

4.2.2 Product of Sum

The product of sum is a Boolean function containing

OR terms (called sum term) of one or more variable
each. The product denotes the ANDing of these terms.
For example, F2 = Y.(X +Z)(X+Y+Z+W)
The function F2 has three sum terms of one, two, and
four variables each. Their sum is in effect an OR
operation
For example, the two logic circuits that are shown in
fig (4-3) and fig (4-4) are equivalents. The circuit in

Assist. Prof Dr. Qasim Mohammed Hussein Page 121

 Chapter Four: Boolean Function Simplification

fig (4-4) includes the simplified form of the function in

fig (4-3).

Fig (4 -3): The function F before the simplification

Fig (4-4): The function F after the simplification

Assist. Prof Dr. Qasim Mohammed Hussein Page 122

 Chapter Four: Boolean Function Simplification

The simplification is done as the following:

F(X, Y, Z)= (X+Y+Z)(X+Y+Z)(X+Y+Z)

= (X+Y+Z.Z)(X+Y+Z)
by using X+YZ = (X+Y)(X+Z)
= (X+Y+0)( X+Y+Z) since Z.Z =0

= (X+Y)( X+Y+Z) by using X+0 =0

= (Y+X(X+Z)) by using X+YZ=(X+Y)(X+Z)

= (Y+X.X+XZ) by using X(Y+Z)=XY+XZ

=(Y+0+XZ) by using X.X=0

F(X,Y,Z) = Y+XZ by using X+0 =0

Example 4-5: Use Boolean algebra, simplify the

function
F(A,B,C) = (A + B + AB + AB) (A + BC)?

Solution
F = (A + B + AB + AB) (A + BC)
= (A(1+B) + B + AB)(A + BC)
= (A + B + AB ) (A + BC)
= AA + B A + ABA + ABC + BBC + ABBC
Assist. Prof Dr. Qasim Mohammed Hussein Page 123
 Chapter Four: Boolean Function Simplification

= A + BA + 0 + ABC + 0 +ABC
= A(1 + B + BC) + ABC
= A + ABC
= A + BC

Example 4.: Simplify the following function using

(a) S.O.P (b) P.O.S?
F(X,Y,Z) = ∑(1,3,5,7)
Solution
(a) Using S.O.P
F(X,Y,Z) = ∑(1,3,5,7)
= XYZ+ XYZ+ XYZ+ XYZ
= XZ(Y+Y) + XZ(Y+Y)
= XZ(1) + XZ(1)
= XZ + XZ
= Z (X+X) = Z(1) = Z
(b) Using P.O.S
F(X,Y,Z) = ∑(1,3,5,7)
= Π (0,2,4,6)
= (X+Y+Z) (X+Y+Z) (X+Y+Z) (X+Y+Z)
= (X+Z+YY)(X+Z+YY)

Assist. Prof Dr. Qasim Mohammed Hussein Page 124

 Chapter Four: Boolean Function Simplification

= (X+Z+0)(X+Z+0)
= (X+Z)(X+Z)
= Z+ XX
=Z+0=Z

Experiment No. (6)

Procedure:

1. Connect the circuits in fig (4-1) and fig (4-2), and

compare the truth tables of them?

2. Connect the circuit in fig (4-3), and then find its

truth table?

3. Draw the circuit for the Boolean function

F2 = X.Y.Z + X.Y.Z+ X.Y.Z+ X.Y.Z+ X.Y.Z ;

And then find the truth table?

4. Connect the circuit in fig (4-4), and then find its

truth table?

5. Compare between the truth tables that were

getting from 2, 3 and 4?

Assist. Prof Dr. Qasim Mohammed Hussein Page 125

 Chapter Four: Boolean Function Simplification

6. Using Boolean algebra, simplify the expression

AB + (A + B)C + AB?

Discussion:
1. Simplify the following Boolean function using sum
of product. F1= ∑(1,3,5,7)?

2. Simplify the following Boolean function using

product of sum: F2= Π (0,2,4,6)?

3. Compare between the results of 1 and 2? Simplify

the Boolean function using (a) sum of product. (b)
Product of sum? F(X,Y,Z,W) = ∑(3,4,5,6,12,13)

4. Find the function with three input variables that has

output that alternates between (0) and (1) for each
input condition respectively? Simplify it using first
the sum of product then the product of sum?

Assist. Prof Dr. Qasim Mohammed Hussein Page 126

 Chapter Four: Boolean Function Simplification

Karnaugh Map Minimization Technique

Object
To study the Karnaugh map (K-MAP) technique that is
used in simplification of Boolean function.
4.3 Theory
A Karnaugh map provides a systematic method for
simplifying Boolean functions. A Karnaugh map is
similar to a truth table because it presents all of the
possible values of input variables and the resulting
output for each value. Instead of being organized into
columns and rows like a truth table, the Karnaugh map
is an array of cells in which each cell represents a
binary value of the input variables, corresponding to
the row of truth table. The map is pictorial form of
truth table. The cells are arranged in a way so that
simplification of a given expression is simply a matter
of properly grouping the cells. Each cell represents one
minterm. The map method provides a simple
straightforward procedure for minimizing Boolean
functions since it presents a visual diagram of all
possible. Karnaugh maps can be used for expressions
Assist. Prof Dr. Qasim Mohammed Hussein Page 127
 Chapter Four: Boolean Function Simplification

with two or more variables. The number of cells in a

Karnaugh map is equal to the total number of possible
input variable combinations as is the number of rows in
a truth table.
4.3.1 Two and three variables maps
Fig (4-6) shows the layout for K-map of form two
variables and three variables. For two variables, the
diagram lists the two different product terms which
can be formed exactly variables. There are (22) or (4)
different minterms, which are: AB, AB, AB, and AB.

Two variables K-map Three variable K-map

Fig (4-6)
In three variables map, there are eight minterm of three
binary variables. Therefore, there are eight squares in
the map. The characteristics of minterm arrangement in

Assist. Prof Dr. Qasim Mohammed Hussein Page 128

 Chapter Four: Boolean Function Simplification

the sequence are that only one bit change from 1 to 0 or

from 0 to 1 in the listing sequence.
4.3.2 Four variables map
The Karnaugh map for Boolean function for four
binary variables is shown in the following fig, which
has 16 squares one for each minterm.

4.3.3 Karnaugh map simplification

To use K map for simplification, we must recognize
that any two adjacent squares in the map differ by only
one variable. Therefore the sum of two minterm in the
adjacent squares can be simplified using the rule

Assist. Prof Dr. Qasim Mohammed Hussein Page 129

 Chapter Four: Boolean Function Simplification

X+X=1 of Boolean algebra, removal the different

variable.

4.3.5 Pairs, Quads and Octet adjacent squares

A pair is any two adjacent 1's in two adjacent squares
horizontally or vertically can be simplified by
eliminating one variable and its complement. For
example, the simplification of the following maps is:

F= ABD + ACD F= BC
5,7 10,14
A quad is any four adjacent 1's in four adjacent squares
in the map. A quad eliminates two variables and their
complements as following:

Assist. Prof Dr. Qasim Mohammed Hussein Page 130

 Chapter Four: Boolean Function Simplification

F= AD + AB
An octet is any eight adjacent 1's in eight adjacent
squares in the map. An octet eliminates three variables
and their complements, as shown below:

F= A
4.3.6 General procedure
To use Karnaugh map in simplifying the Boolean
function, one use the following procedures.
1. Determine the number of map cells. The number of
cells is equal to 2k, where k is the number of input

Assist. Prof Dr. Qasim Mohammed Hussein Page 131

 Chapter Four: Boolean Function Simplification

variables to the function. For function with four input

variables, there are 24=16 cells in the map. Each cell
corresponds to a single minterm of the function.
2. Mark each row and each column with number (or
letter) in sequence to show the relationship between
cells. The characteristic of sequence is that only one
bit changes from 1 to 0 or 0 to 1 (or one letter from
normal to complement or complement to normal).
The minterm corresponding to each cell can be
obtained from the concatenation of the row number
(letter) with the column number (letter) as shown in
fig (4-7). For example, the cell assigned m5
corresponding to row 01 and column 01. When these
two numbers are concatenated they give the binary
number 0101 whose decimal value is 5. An other
way of looking at cell m5=XYZW is to considered it
to be in the row marked XY and the column YZ.
3. Map the minterm to the equivalent cell. The map is
filled by placing 1s in the cells for each term which
leads to a 1 output.

Assist. Prof Dr. Qasim Mohammed Hussein Page 132

 Chapter Four: Boolean Function Simplification

4. Determine the sets of exactly 2n adjacent cells in the

map that contain 1. Any two cells in the map said to
be adjacent if they differ by only one variable which
is primed in one cell and unprimed in the other. For
example, the cells XYZW and XYZW are adjacent,
as shown bellow, since they are differ by W only.

Fig (4-7)
Or using the numeric label as follow:
00 01 11 10
m0 m1 m3 m2 00

m4 m5 m7 m6 01

m12 m13 m15 m14 11

m8 m9 m11 m10 10

Assist. Prof Dr. Qasim Mohammed Hussein Page 133

 Chapter Four: Boolean Function Simplification

Fig (4-7): four variables map

5. Each set of the adjacent cells can be simplified to
single AND term consisting the variables that have
the same state, removing the variables those have
different states in the same set. For example, the
adjacent cells that have the names XYZW, XYZW,
XYZW, and XYZW will simplify to the term XZ.
6. Make ORing between the terms that obtained from
each set of adjacent cells.

Notes
1. The map is considered to be rolled, so the top and
bottom cells in the same column or the left and right
cell in the same row are adjacent.
2. Any cell that marked with a 1 can contribute in more
than one set.

Example 4-6: Simplify the Boolean function that

represented in the following truth table using
Karnaugh map?

Assist. Prof Dr. Qasim Mohammed Hussein Page 134

 Chapter Four: Boolean Function Simplification

X Y Z F
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1
Solution
The K-map is:

Example 4-7:
Simplify the Boolean function F using Karnaugh map?
Solution
F = XYZW+ XYZW+ XYZW+ XYZW+ XYZW
XYZW+ XYZW+ XYZW + XYZW
After draw the map with 16 cells, we Map the
minterms to the corresponding cells as follow:

Assist. Prof Dr. Qasim Mohammed Hussein Page 135

 Chapter Four: Boolean Function Simplification

The function can be simplified as following:

The sets of adjacent cells are {m4, m5, m12, m13},
{m2, m6, m14, m10} and {m10, m11}.
The simplified is done as follow:
m4 + m5 + m12 + m13 is simplified to Y. Z.
m2 + m6 + m14 + m10 is simplified to ZW.
m10 + m11 is simplified to XYZ
The simplified function is F =Y Z+ZW+ XYZ.

Example 4-8: simplify the following function using

Karnaugh map?
F(A,B,C,D)=AB+ABC+ABCD+ACD+ABCD
Solution : The Karnaugh map is

Assist. Prof Dr. Qasim Mohammed Hussein Page 136

 Chapter Four: Boolean Function Simplification

F(A,B,C,D)= A + CD
4,5,6,7,12,13,14,15 1,5,13,9

Example: Simplify using K map the function

F(A,B,C,D)=(A.B)(C+D) + AB?
Solution
F(A,B,C,D)=(A.B)(C+D) + AB
= (A.B)(C+D) + (A.B)(C+D) +AB
= (A.B)(CD) + (A+B)(C+D) +AB
= A.B.C.D + AC + AD + BC + BD + AB
Now, we use K map to simplify this function.

Assist. Prof Dr. Qasim Mohammed Hussein Page 137

 Chapter Four: Boolean Function Simplification

The result of simplification is:

F(A,B,C,D) = C + D + AB
1,3,5,7,13, 2,3,6,7,14, 12,13,14,15
15,9,11 15,10,11

4.3.7 Don’t Care Conditions

In general, the output of the Boolean function equal to
0 or 1 under certain condition. Sometimes, certain
combinations of input variables never occur. In other
words, there are some minterms for the function where
we do not care whether their values are a 0 or a 1.
When drawing the K-map for these “don’t-care”
minterms, we assign an X in that square instead of a 0
or a 1. For example, four – bit decimal code has six
combinations which are not used. So we don't care
what the function output is to be for these
combinations of the variables. These don't care
conditions can be used on Karnaugh map to provide
further simplification of the function by marked these
combinations by X. In simplification, X substitutes by
0 or 1, whichever gives the simplest function.

Assist. Prof Dr. Qasim Mohammed Hussein Page 138

 Chapter Four: Boolean Function Simplification

Example 4-9: Given a function having the following

1-minterms and don’t-care minterms:
1-minterms: m0, m1, m2, m3, m4, m7, m8 and m9.
X-minterms: m10, m11, m12, m13, m14 and m15.
Simplify this function using Karnaugh map?

Solution
First, draw the table that includes 1-minterm and X-
minterm. Notice that in order to get the 4-subcube
characterized by X the two don’t-care minterms m10
and m11 are taken to have the value 1, similarly with
the minterms m12 and m15. On the other hand, the
don’t-care minterms m13 and m14 are taken to have
the value 0 so that they do not need to be covered in
the solution. The reduced standard function as
obtained from the K-map is, therefore

Assist. Prof Dr. Qasim Mohammed Hussein Page 139

 Chapter Four: Boolean Function Simplification

F = Y + ZW + ZW.
Again, this equation can be reduced further by
recognizing that ZW + ZW = Z W. So the
simplification function is: F = Y + Z W

Example 4-10: Simplify the functions F(A,B,C,D) that

represented in the table using Karnaugh map?

Solution
We convert the X in cell 8 to 1 to get a group of four
adjacent cells, while the rest Xs are ignored.

After simplification, F(A,B,C,D) = C D.

Assist. Prof Dr. Qasim Mohammed Hussein Page 140

 Chapter Four: Boolean Function Simplification

Experiment No. (7)

Procedure:
1. Given a three inputs A, B, and C. Design the circuit
that has output (1) only when A,B,C are :
(000),(100),(101),(110), and (111)?
2. Simplify using Karnaugh map the following
function?
F(A,B,C,D) = (0,1,2,3,4,6,8,9,12,13)
3. Connect the circuit for the function?
F4(A,B,C)= ABC + ABC + ABC + ABC
+ ABC
4. Simplify F4 using Karnaugh map? Connect it
circuit and find the truth table? Compare the results
between step 2 and step 3?
Discussion:
1. Simplify using Karnaugh map the functions?
A) F1(X,Y,Z,W) = YZW + XZW + YW + XYW
+ XYZW
B) F2(X,Y,Z,W) =  ( 0,1,5,6,9,10,13,15).
C) F3(X,Y, Z, W) = π(0,1,8,9).

Assist. Prof Dr. Qasim Mohammed Hussein Page 141

 Chapter Four: Boolean Function Simplification

Implementation Logic Circuit using

NOR or NAND Gates only
Object:
To learn how one can use the NAND or NOR gates
only to construct the digital circuit.
4.4 Theory:
Digital circuit are more frequently constructed with
NAND gates or NOR gates only, instead of using the
basic gates AND, OR, and NOT gates, because NAND
or NOR gates are easier to fabricate with electronic
components. The NAND and NOR gates are said to
be universal gates. Fig (4-8) shows the substitution of
basic gates (NOT, OR, and AND) with the universal
gates (NOR or AND gates) only.
To implement the Boolean function with NAND or
NOR gates only, one follow the following procedures.
1. From the given algebraic expression, draw the logic
diagram with AND, OR, and NOT gates.

Assist. Prof Dr. Qasim Mohammed Hussein Page 142

 Chapter Four: Boolean Function Simplification

Fig (4-8): The equivalent of basic gates with

the universal gates

2. Draw a second logic diagram with the equivalent

NAND or NOR logic as given in the figure (4-8) by

Assist. Prof Dr. Qasim Mohammed Hussein Page 143

 Chapter Four: Boolean Function Simplification

substituted the equivalent for each AND, OR, and

NOT gates.
3. Remove any two cascaded inverters from the
diagram since double inversion does not perform a
logic, since X = X.

Example 4-11: Implement F1= A . B + A . B using

NOR gates only?
Solution
The implementation of F1 using NOR gates only are
done by using the following steps:
1. Draw the circuit of the function using basic gates,
fig (4-9).
2. Substitute each basic gate with its equivalent NOR
gate, fig (4-10).
3. Remove the cascaded inverters, fig (4-11).

Assist. Prof Dr. Qasim Mohammed Hussein Page 144

 Chapter Four: Boolean Function Simplification

Fig (4.9): Implement F1 using basic gates.

Fig (4-10): Substitution of equivalents NOR gates.

The same steps can be used to implement the function

F1 using NAND gates only, as shown in fig (4-12) and
fig (4-13).
One can use demorgan's theorems to find the function
that can be implemented using NAND gates only or
NOR gates only.

Assist. Prof Dr. Qasim Mohammed Hussein Page 145

 Chapter Four: Boolean Function Simplification

Fig (4-11): Implement the function F1 using NOR gates only

Fig (4-12): Substitution of equivalents NOR gates.

Fig (4-13): Implement the function F= A.B + A.B

using NAND gates only

Assist. Prof Dr. Qasim Mohammed Hussein Page 146

 Chapter Four: Boolean Function Simplification

Example 4-12: Using NAND gates only implement

the following functions?
a) F(A,B) = A B + B C + A B C
b) F(A,B,C) =A B + (A + C) (B + C)
Solution:
a) by using double bar and using DeMorgan's theorem,
the function become:
F(A,B,C) = ( A B + B C + A B C )
= ( ( A B ) . ( B C ) . (A B C) )

b) F(A,B,C) =A B + (A + C) (B + C)

= ( A B + (A + C) (B + C) )

= ( (A B) . ( (A + C) (B + C) ) )

= ( (A B) . ( (A + C) (B + C) ) )

= ( (A B) . ( (A . C). (B . C) ) )

Example 4-13: Implement the functions in previous

example using NOR gates only?

Assist. Prof Dr. Qasim Mohammed Hussein Page 147

 Chapter Four: Boolean Function Simplification

Solution
a) F(A,B,C) =A B + B C + A B C

= ( ( A +B ) + ( B + C ) + ( A+ B+ C ) )

=A+B+B+C+A+B+C

b) F(A,B,C) =A B + (A + C) (B + C)

= (A B)+ ( (A + C) (B + C) )

= (A+ B) + ( (A + C) + (B + C) )

Assist. Prof Dr. Qasim Mohammed Hussein Page 148

 Chapter Four: Boolean Function Simplification

Experiment No. (8)

Procedure:
1. Draw and connect the logic expression (X + Y).(
XZ + Y) using basic gates (AND, OR, and NOT)
gates?
2. Draw and connect the logic expression (X + Y) ( XZ
+ Y) using NOR gates only?
3. Draw and connect the logic expression (X + Y) . (
XZ + Y) using NAND gates only?
4. Compare the results of step 1, 2, and 3?

Discussion:
1. Draw and implement the logic circuit for
X=AB+AB using :
A) Basic logic gates. B) NOR gates only.
C) NAND gates only. D) XOR gate?
2. Draw the logic circuit by using NAND gates only
3. for the function F=A.B+D.(B+C) ?
4. Draw the logic circuit in fig (4-14) using NAND gates
only?

Assist. Prof Dr. Qasim Mohammed Hussein Page 149

 Chapter Four: Boolean Function Simplification

Fig (4-14)
4.5 Integrated circuit (IC)
IC is a small silicon semiconductor crystal, called chip,
containing electrical components such as transistors,
diodes, resisters and capacitors, which interconnected
inside the chip to form an electronic circuit.

Memory microchip IC from an EPROM

memory microchip
Fig 4-15: Types of chips

Assist. Prof Dr. Qasim Mohammed Hussein Page 150

 Chapter Four: Boolean Function Simplification

There are two types of IC package: flat and dual in

line.
The integration of large numbers of tiny transistors
into a small chip was an enormous improvement over
the manual assembly of circuits using discrete
electronic components. The integrated circuits mass
production capability, reliability, and building-block
approach to circuit design ensured the rapid adoption
of standardized Integrated Circuits in place of designs
using discrete transistors.
There are too many advantages of ICs over discrete
circuits.
1. Small size.
2. The cost is very low.
3. Their reducing power consumption make digital
system more economical to operate.
4. The operating speed is higher.
5. The use of ICs, reduce the number of external
wiring connection because many of the connection
are internal to the package.
ICs classified in two categories: linear and digital.

Assist. Prof Dr. Qasim Mohammed Hussein Page 151

 Chapter Four: Boolean Function Simplification

ICs are classified according to their complexity into

the following:
1. Small-scale integration (SSI) contains up to ten gate
circuit on a single chip, and they include basic gates
and flip-flops.
2. Medium scale integration (MSI) contain from 10 to
about 100 gates per chip. They include logic
functions such as encoders, decoders, counters,
registers , multiplexer, and small memories.
3. Large-scale integration (LSI) consists of about 100
to 10,000 gates per chip, including memories.
4. Very-large-scale integration (VSLI) contains from
more than 10,000 to 100,000 gates per chip.
5. Ultra-large-scale integration (USLI) contains from
more than 100,000 gates per chip. It use in
microprocessor and large memories.
The IC packages are classified according to the way
they are mounted on printed circuit boards as either
through-hole mounted or surface mounted.
The through mounted packages have pins that are
inserted through holes in the printed circuit board and

Assist. Prof Dr. Qasim Mohammed Hussein Page 152

 Chapter Four: Boolean Function Simplification

can be soldered to conductors on the opposite side.

The most common type is the dual in-line package.
While the surface mounted is a dual in-line package

Fig 4-16: Types of ICs

Assist. Prof Dr. Qasim Mohammed Hussein Page 153

View publication stats