Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
2 views

Lab 05 Boolean Function Implementation

The document outlines a lab focused on implementing Boolean functions using standard forms of logic functions: Sum of Products (SOP) and Product of Sums (POS). It includes objectives, required equipment, background theory on canonical forms, and specific tasks such as converting Boolean functions, creating truth tables, and building circuits. The procedure for conducting the lab is also detailed, emphasizing the setup and verification of outputs using a trainer board.

Uploaded by

fakhar_fast
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Lab 05 Boolean Function Implementation

The document outlines a lab focused on implementing Boolean functions using standard forms of logic functions: Sum of Products (SOP) and Product of Sums (POS). It includes objectives, required equipment, background theory on canonical forms, and specific tasks such as converting Boolean functions, creating truth tables, and building circuits. The procedure for conducting the lab is also detailed, emphasizing the setup and verification of outputs using a trainer board.

Uploaded by

fakhar_fast
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Digital Logic Design Lab

# 05
Student Name: Reg#
Lab Section:

LabTitle:
Boolean function implementation
Objectives:
• To become familiar with two standard forms of logic functions: SOP and POS
• To become familiar that how a Boolean function can be minimized then can be
expressed in gates.

Equipment Required:
• DEV-2765E Trainer Board
• 7408 Quad 2-input AND Gate IC
• 7404 Hex Inverter IC
• 7432 Quad 2-input OR Gate IC

Background Theory
Canonical Form (Standard SOP and POS Form)
Any Boolean function that is expressed as a sum of minterms or as a product of max terms is said
to be in its “canonical form”. It mainly involves in two Boolean terms, “minterms” and
“maxterms”.
When the SOP form of a Boolean expression is in canonical form, then each of its product term is
called ‘minterm’. So, the canonical form of sum of products function is also known as “minterm
canonical form” or Sum-of-minterms or standard canonical SOP form.
Similarly, when the POS form of a Boolean expression is in canonical form, then each of its sum
term is called ‘maxterm’. So, the canonical form of product of sums function is also known as
“maxterm canonical form or Product-of sum or standard canonical POS form”.
What are Min Terms and Max Terms?
For instance, assume that we have two variables as a and b. After performing AND operation, we
call the Boolean product terms of these two variables as min terms or standard product terms.
These min terms are a’b’, a’b, ba’ and ab.
After performing OR operation, we call the Boolean product terms of these two variables as max
terms or standard sum terms. These max terms are a+b, a+b’, a’+b and a’+b’.
The min terms and max terms of a and b are as follows.
Conversion of SOP form to standard SOP form or Canonical SOP form
We can include all the variables in each product term of the SOP form equation, which doesn’t
have all the variables by converting into standard SOP form. The normal SOP form function can
be converted to standard SOP form by using the Boolean algebraic law, (A + A’ = 1) and by
following the below steps.
Example:
Convert the non-standard SOP function F = x y + x z + y z
Sol:
F=xy+xz+yz
= x y (z + z’) + x (y + y’) z + (x + x’) y z
= x y z + x y z’ + x y z + x y’ z + x y z + x’ y z
= x y z + x y z’ + x y’ z + x’ y z
The standard SOP form is F = x y z + x y z’ + x y’ z + x’ y z

Conversion of POS form to standard POS form or Canonical POS form


We can include all the variables in each product term of the POS form equation, which doesn’t
have all the variables by converting into standard POS form. The normal POS form function can
be converted to standard POS form by using the Boolean algebraic law, (A * A’ = 0) and by
following the below steps.
Example:
F = (A’ + B + C) * (B’ + C + D’) * (A + B’ + C’ + D)
In the first term, the variable D or D’ is missing, so we add D*D’ = 1 to it. Then
(A’ + B + C + D*D’) = (A’ + B + C + D) * (A’ + B + C + D’)
Similarly, in the second term, the variable A or A’ is missing, so we add A*A’ = 1 to it. Then
(B’ + C + D’ + A*A’) = (A + B’ + C + D’) * (A’ + B’ + C + D’)
The third term is already in the standard form, as it has all the variables. Now the standard POS
form equation of the function is
F = (A’ + B + C + D) * (A’ + B + C + D’) * (A + B’ + C + D’) * (A’ + B’ + C + D’) * (A + B’ +
C’ + D)
LAB
TASK

a) Convert the following Boolean function into Standard SoP form


f = p’qr + pq’r + pqr’ + pqr
Convert the following Boolean function into Standard PoS form.
f = p+q+r . p+q+r′ . p+q′+r . p′+q+r

b) Make truth table of Standard forms of above Boolean function.


c) Draw circuit diagram on proteus software for standard canonical forms.
d) Make circuit on trainer board for standard canonical forms
e) Verify your output by using the truth table.

Procedure
1. Connect the trainer board with the power supply 2.
Mount the corresponding 74LSXX IC on the board.
3. Connect pin 14 to +5 V and pin 7 to GND.
4. Wire the circuit according to the diagram by consulting the corresponding gate ICs data
sheet.
5. Apply all the combinations of inputs and observe the output on the LED to verify the
truth tables of the gates.

You might also like