0% found this document useful (0 votes)
3K views3 pages

Implementation of The Boolean Function Using Logic Gates in Both SOP and POS Forms - CA LAB

The experiment aims to implement a given Boolean function using logic gates in both Sum-of-Products (SOP) and Product-of-Sums (POS) forms. It involves using various apparatus, including logic gate ICs and a digital IC trainer, to connect and observe the outputs based on input combinations. The conclusion confirms successful implementation of the Boolean functions using AND, OR, and NOT gates.

Uploaded by

Suchismita Das
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
0% found this document useful (0 votes)
3K views3 pages

Implementation of The Boolean Function Using Logic Gates in Both SOP and POS Forms - CA LAB

The experiment aims to implement a given Boolean function using logic gates in both Sum-of-Products (SOP) and Product-of-Sums (POS) forms. It involves using various apparatus, including logic gate ICs and a digital IC trainer, to connect and observe the outputs based on input combinations. The conclusion confirms successful implementation of the Boolean functions using AND, OR, and NOT gates.

Uploaded by

Suchismita Das
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/ 3

AIM OF THE EXPERIMENT:

Implementation of the given Boolean function using logic gates in both SOP and POS forms.
APPARATUS REQUIRED:

➢ Power supply
➢ Digital IC Trainer
➢ Logic gate IC’s (7408,7432,7404)
➢ Connecting wires

THEORY:

In Boolean algebra, the values of the variables are either true (1) or false (0). A Boolean function is an algebraic
form of a Boolean expression.The Boolean functions can be represented in Sum-of-Products (SOP) form or
Product-of-Sums (POS) form.

SOP expression is a sum of Boolean product terms called minterms. A Min term is a multiplicative
combination of Boolean variables whose output equals 1. SOP expression can be implemented as a set of AND
gates feeding into a single OR gate.

POS expression is a product of Boolean sums terms called max terms. A max term is a summation of Boolean
variables whose output equals 0. POS expression Can be implemented as a set of OR gates feeding into a
single AND gate.

The following table shows the representation of Min terms and Max terms for 2 variables (A and B).

A B MINTERMS MAXTERMS
0 0 mo = A’B’ M0= A+B
0 1 m1= A’B M1= A+B’
1 0 m2= AB’ M2= A’+B
1 1 m3= AB M3= A’+B’

When two or more product terms are summed by Boolean addition, the resulting expression is called SOP. A
Boolean expression in the SOP can be plotted in K-map by placing 1 in each cellcorresponding to a term
(minterm) in the sum of product expression.

When two or more sum terms are multiplied, the resulting expression is called POS. A Boolean expression in
the POS can be plotted in K-map by placing 0 in each cell corresponding to a term (maxterm) in the expression.
Implementation of Boolean Functions using Logic Gates

The implementation of Boolean functions by using logic gates involves connecting output of one logic gate
to the input of another gate. Commonly used Logic Gates are: AND, OR, NOT gates.

Logic Gates are the basic building blocks of digital electronic circuits. A Logic Gate is a piece of electronic
circuit, that can be used to implement Boolean Expressions.
Implementation for 2 Input Variables Boolean function using logic gates using SOP and
POS form
1.In SOP Form:

logical expression: F(A,B,C) = A.B+ A'.C

Logic diagram

Truth table:

A B C A.B A’.C F = A.B+ A'.C


0 0 0 0 0 0
0 0 1 0 1 1
0 1 0 0 0 0
0 1 1 0 1 1
1 0 0 0 0 0
1 0 1 0 0 0
1 1 0 1 0 1
1 1 1 1 0 1

2. In POS Form:

logical expression: F(A,B,C) = (A+C)(A+B')


Logic diagram
Truth table:

A B C (A+C) (A+B') F= (A+C)(A+B')


0 0 0 0 1 0
0 0 1 1 1 1
0 1 0 0 0 0
0 1 1 1 0 0
1 0 0 1 1 1
1 0 1 1 1 1
1 1 0 1 1 1
1 1 1 1 1 1

PROCEDURE:

1- Place the IC on the IC Trainer Kit.


2- Connect Vcc & Ground to the 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 output LEDs.
5- Apply various combinations of inputs according to truth table and observe condition of LEDs.

CONCLUSION:
From the above experiment, implementation of SOP and POS form is obtained with AND, OR and NOT
gates.

You might also like