Scribd
Upload
9 views17 pages

Digital Logic Design Lab Assignments

The document contains a series of tasks related to digital logic design, including simplified expressions and truth tables for various logic circuits such as half adders, full adders, half subtractors, and full subtractors. Each task details the logical expressions derived from the truth tables and includes stimulation for each input. The final task combines the functionality of half adders and subtractors, illustrating the design principles of digital logic circuits.

Uploaded by

241520
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
9 views17 pages

Digital Logic Design Lab Assignments

The document contains a series of tasks related to digital logic design, including simplified expressions and truth tables for various logic circuits such as half adders, full adders, half subtractors, and full subtractors. Each task details the logical expressions derived from the truth tables and includes stimulation for each input. The final task combines the functionality of half adders and subtractors, illustrating the design principles of digital logic circuits.

Uploaded by

241520
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Assignment # 01

Digital Logic Design Lab (EE-123L)

Submitted by:
Usman Waheed (241520)

Department:
BSCYS-F-24-B

Submitted to:
Sir Hafiz Muhammad Talha
Lab # 04
Task # 01

Simplified Expression:

F = (X'Y' + Z) + Z + XY + WZ
= ((X'Y') . Z') + Z + XY + WZ
= (X' + Y') . Z' + Z + XY + WZ
= Z + (X + Y) + XY + WZ
= Z + WZ + X + XY
= Z (1 + W) + X + X (1 + Y)
= Z (1) + X + Y (1)
=X+Y+Z

Truth Table:
X Y Z F
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1

Stimulation for Each input:


Task # 02
Simplified Expression:
F = B + BC + AB + AC + ABC
= B(1 + C) + AB(1 + C) + AC
= B(1) + AB(1) + AC
= B + AB + AC
= B(1 + A) + AC
= B + AC

Truth Table:
A B C AC F=B+AC
0 0 0 0 0
0 0 1 0 1
0 1 0 0 1
0 1 1 0 0
1 0 0 0 0
1 0 1 1 1
1 1 0 0 1
1 1 1 1 1

Stimulation For Each Input:


Task # 03
Simplified Expression:

Using K-map the Expression becomes:


F = C + A`B

Truth Table:
A B C A` A`B F=A`B+C
0 0 0 1 0 0
0 0 1 1 0 1
0 1 0 1 1 1
0 1 1 1 1 1
1 0 0 0 0 0
1 0 1 0 0 1
1 1 0 0 0 0
1 1 1 0 0 1

Stimulation For Each Input:


Lab # 05

TASK # 01
HALF ADDER

Truth Table
A B Sum Carry
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1

Expressions:
Sum = A⊕B
Carry = AB
Stimulation:
TASK # 02
FULL ADDER

Truth Table:
A B C Sum Carry
0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1

Expression:

Sum = A′B′C + A′BC′ + AB′C′ + ABC


=A⊕B⊕C

Carry = A′BC + AB′C + ABC′ + ABC


= (A′BC + ABC) + (AB′C + ABC′)
= BC + A(B′ ⊕ C)
= AB + C(A ⊕ B)

Stimulation For Each Input:


Task # 03

Half Substractor

Truth Table:
A B Difference Borrow
0 0 0 0
0 1 1 1
1 0 1 0
1 1 0 0

Expression:
Difference = A⊕B
Borrow = A`B

Stimulation:
Task # 04

Full Substractor
Truth Table:
A B C Difference Borrow
0 0 0 0 0
0 0 1 1 1
0 1 0 1 1
0 1 1 0 1
1 0 0 1 0
1 0 1 0 0
1 1 0 0 0
1 1 1 1 1
Expression:
Difference = A'B'C + A'BC' + AB'C' + ABC
=A⊕B⊕C
Borrow = A′B′C + A′BC′ + AB′C + ABC
= A′(B′C + BC′) + BC(A′ + A)
= A′(B ⊕ C) + BC(1)
= A′B + A′C + BC

Stimulation:
TASK # 05
HALF ADDER AND SUBTRACTOR

Truth Table:
Switch (Sw) A B Sum/Diff Carry/Borrow
0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 0 0
1 0 1 1 1
1 1 0 1 0
1 1 1 0 0
Expression:
Sum / Diff = SwA′B′ + SwA′B + SwAB′ + SwAB
= A′B(Sw′ + Sw) + AB(Sw′ + Sw)
= A′B(1) + AB(1)
= A′B + AB
=A⊕B

Carry / Borrow = Sw′AB + SwA′B


= B (Sw′A + SwA′)
= B (Sw ⊕ A)

Stimulation:

You might also like