To Convert a Boolean Expression to a Logic Circuit

• Roll no. : 2030208

• Subject : Digital Electronics Lab
• Submitted By : Galabh Joshi
• Submitted To : Dr. Prachi Yadav
 Table of Contents
Aim 03
Apparatus 03
Theory 03
1. SOP Form…………………………………………………………………………………………..03
2. POS Form…………………………………………………………………………………………..04
Realisation of Boolean Expression 04
Circuit Diagram 06
Truth Table 10
Result 12
 Aim :
To convert Boolean Expression to a Logic Circuit .

Apparatus :
IC 7400 , IC 7402 , Connecting Wires , Breadboard , LED .

Theory :
Any Boolean Expression can be expressed in an ‘Expanded Sum (OR) of Products (AND) form’
that is “SOP Form” or in an ‘Expanded Product (AND) of Sums (OR) that is “POS Form” .
The forms are as follows :

1. SOP Form – A standard SOP Form is one in which a number of Product Terms , each one of which
contains all the variables of the function either in complemented or non-
complemented form , are summed together . Each of the product terms in SOP Form is known
as a “minterm” .
2. POS Form – A standard POS Form is one in which a number of Sum Terms , each one of which
contains all the variables of the function either in complemented or non-
complemented form , are multiplied together . Each of the product terms in POS Form is known
as a “maxterm” .

Realisation of Boolean Expression

Let the given expression : Y = (A+BC)(B+C’A)
1. For SOP :
Y = AB+AC’+BC+ABCC’
Y = AB+AC’+BC (CC’=0)
(Y’)’ = ((AB+AC’+BC)’)’
Y = ((AB)’(AC’)(BC)’)’ ((Y’)’=Y)
For Minimization –
Y = AB(C+C’)+A(B+B’)C’+(A+A’)BC
Y = ABC+ABC’+ABC’+AB’C’+ABC+A’BC
 Y = ABC+ABC’+AB’C’+A’BC
Y = BC(A+A’)+AC’(B+B’)
Y = BC+AC’
(Y’)’ = ((BC+AC’)’)’
Y = ((BC)’(AC’)’)

2. POS Form :
Y = (A+B)(A+C)(B+C’)(B+A)
Y = (A+B)(A+C)(B+C’)
(Y’)’ = (((A+B)(A+C)(B+C’))’)’
Y = ((A+B)’+(A+C)’+(B+C’)’)’
For Maximization -
This expression can be reduced into the following form –
Y = ((A+C)’ + (B+C’)’)’
Circuit Diagram of the Equation in SOP Form :

Simple Circuit Diagram

Minimized Form :

Minimized Circuit Diagram

Circuit Diagram of the Equation in POS Form :

Simple Circuit Diagram

Maximized Form :

Maximized Circuit Diagram

Truth Table :
1. SOP : 2. Minimization :
Y = ((AB)’(AC’)(BC)’)’ Y = ((BC)’(AC’)’)

X Y Z Output X Y Z Output

0 0 0 0 0 0 0 0

0 0 1 0 0 0 1 0

0 1 0 0 0 1 0 0

0 1 1 1 0 1 1 1

1 0 0 1 1 0 0 1

1 0 1 0 1 0 1 0

1 1 0 1 1 1 0 1

1 1 1 1 1 1 1 1
3. POS : 4. Maximization :
Y = ((A+B)’+(A+C)’+(B+C’)’)’ Y = ((A+C)’ + (B+C’)’)’
X Y Z Output X Y Z Output

0 0 0 0 0 0 0 0

0 0 1 0 0 0 1 0

0 1 0 0 0 1 0 0

0 1 1 1 0 1 1 1

1 0 0 1 1 0 0 1

1 0 1 0 1 0 1 0

1 1 0 1 1 1 0 1

1 1 1 1 1 1 1 1
Result : So, from the above experiment we can clearly see that we can convert a simple Boolean
Experssion in SOP and POS Forms .