Lab Report #6

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 6

‫بسم هللا الرحمن الرحيم‬

Faculty Of Applied Science .

Course : Digital Design Laboratory .


Report #6 .
Introduction :
Logic circuits in digital systems can generally be classified into two
categories. one is made up of combinational logic circuits, the
other is sequential logic circuits. a combinational logic circuit
consisting of logic gates whose output at any time is determined
directly from the current combination of inputs without regard to
previous inputs. In other words, combinational logic circuits are
incapable of remembering their past. On the other hand, a
sequential logic circuit consists not only of logic gates but also of
memory elements. For this purpose, the output of sequential logic
circuits depends not only on the current values of the input, but
also on the previous values of the input. in other words, the
outputs of a sequential logic circuit are a function of the current
inputs and the previous state of its memory elements.

Objectives :
Implement of the given Boolean function using logic gates in both
SOP and POS forms

 Two inputs SOP : A B + A` B` .


 Two inputs POS : (A+B) (B+C) (A+C`) .

Required components :
 Wires .
 Resistance .
 Breadboard .
 LED .
 ICs : AND (74LS08), OR (74LS32), NOT (74LS04) .
 Power sours .
Procedure : (for SOP form )
Connect the AND gate with the inputs of A and B and other AND
gate in the same IC is given by the complement input of the A and
B . A` and B` by using NOT gate with wires . and Vcc and
GROUND to all the ICs separately .

A B A` B` A.B A`.B` F
0 0 1 1 0 1 1
0 1 1 0 0 0 0
1 0 0 1 0 0 0
1 1 0 0 1 0 1

1 1

0 1
Procedure : (for POS form )
Connect the OR gate of input A or B, B or C and last one is A or
C`(ie. Complement ) of C using NOT gate .inputs are connected
with wires . and Vcc and GROUND to all the ICs separately .

A B C A+B B+C A+C` F


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

1 1 1
1 0 0

1 0 1

Conclusion :
We learned how to implement SOP and POS .

Given Boolean Expression is implemented by the Logic Gates .

Ie. 1) A.B + A`.B`

2) (A+B) (B+C) (A+C`)

You might also like