Experiment No.

:2
Objective:- Implementation of the given Boolean function using logic gates in both SOP
and POS forms.

F (a, b, c) = ∑m (1, 4, 5, 6)

Components Required:-
S. No. Name of Apparatus Specifications
1. Digital trainer Kits with Breadboard.

2. IC 7404 Hex Inverter

IC 7408 Quad Two input AND Gate
IC 7432 Quad Two input OR Gate
3. Connecting wires.

Brief Theory:-
Sum of Product (SOP) Form:-

When two or more product terms are summed by Boolean addition, the resulting expression
is SOP. In an SOP expression, a single over-bar cannot extend over more than one variable.

A Boolean expression in the SOP form can be plotted on the K-map by placing 1 in each cell
corresponding to a term (Minterm) in the sum of product expression.

Product of sums (POS) Form:-

When two or more sum terms are multiplied, the resulting expression is a product of sums
(POS). A Boolean expression in the POS can be plotted on the K-map by playing a 0 in each
cell corresponding to a term (Maxterm) in the expression.
Circuit diagram:-
Sum-Of-Products & Product-Of-Sums
A simple method for converting a truth table into a CLC is found in a standard form of
Boolean expression called the Sum-of-Products (SOP) form.

An SOP expression is literally a sum of Boolean terms called minterms. A minterm is a

multiplicative combination of Boolean variables whose output equals 1. An example of an
SOP expression is ABC + BC + DE, where ABC, BC, and DE are minterms. SOP
expressions may be generated from truth table, perform the following steps:

1. Determine which rows of the table have an output of 1.

2. Derive each row’s minterm, such that the output is 1 given that row’s input state.
3. Sum the minterms.

Figure 3 illustrates a truth table conversion to an SOP expression.

SOP expressions can easily be implemented as a set of AND gates feeding into a single OR
gate. Figure 4 shows a CLC implementation of the previous SOP expression.
Product-of-Sums (POS) expressions are another way of representing truth tables. A POS
expression is a product of Boolean terms called maxterms. A maxterm is a summation of
Boolean variables whose output equals 0. To generate a POS expression from a truth table,
perform the following steps:

1. Determine which rows of the table have an output of 0.

2. Derive each row’s maxterm, such that the output is 0 given that row’s input state.
3. Multiply the maxterms.

Figure 5 shows the same truth table expressed as a POS and its corresponding CLC.
Procedure:-

1. Place the IC on IC Trainer Kit.

2. Connect VCC and ground to respective pins of IC Trainer Kit. .
3. Connect the inputs to the input switches provided in the IC Trainer Kit.
4. Connect the outputs to the switches of O/P LEDs.
5. Apply various combinations of inputs according to truth table and observe condition
of LEDs.
6. Disconnect output from the LEDs and note down the corresponding.

Result:-

The given Boolean function is verified.

Precautions:-

1. All Connections should be according to circuit diagram.

2. All Connections should be right and tight.
3. Reading should be taken carefully.
4. Power supply Switched Off after completing the Experiment.