Digital Logic Design (CS302) Total marks = 20

Assignment # 02 Deadline
15th of January
Fall 2023 2024

Please carefully read the following instructions before attempting the assignment.

RULES FOR MARKING

It should be clear that your assignment would not get any credit if:
● The assignment is submitted after the due date.

● The submitted assignment does not open or the file is corrupt.

● Strict action will be taken if the submitted solution is copied from any other student or the
internet.

You should consult the recommended books to clarify your concepts as handouts are not sufficient.
You are supposed to submit your assignment in Doc or Docx format.
Any other formats like scan images, PDF, ZIP, RAR, PPT, BMP, etc. will not be accepted.

Topic Covered:
● Boolean Algebra and Logic Simplification

● QuineMcCluskey Simplification Method

NOTE

No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding
or internet malfunctioning etc.). Hence refrain from uploading assignments in the last hour of the deadline. It is
recommended to upload the solution at least two days before its closing date.

If you people find any mistake or confusion in the assignment (Question statement), please consult with your
instructor before the deadline. After the deadline, no queries will be entertained in this regard.

For any query, feel free to email me at:

cs302@vu.edu.pk
Question No 01 Marks (20)
Consider the below given canonical sum:
❑
∑ ( 0 , 1 , 2, 4 , 6 ,7 , 9 ,10 , 15 ,16 ,20 , 21 , 22, 23 , 28 , 29 ,31 )
( A , B ,C , D , E)

Find the prime implicants from given minterms using Quine-McCluskey simplification method.
Extract the simplified expression.

Note: Perform all steps of this method. In case of missing steps, marks will be deducted.

Solution:

Given minterms:
Σ(A,B,C,D,E) (0, 1, 2, 4, 6, 7, 9, 10, 15, 16, 20, 21, 22, 23, 28, 29, 31)

Step 1: Group minterms by the number of 1's in their binary representations.

Group the minterms by the number of 1's:
Group 0: (0)
Group 1: (1)
Group 2: (2, 4)
Group 3: (6, 7, 9, 10)
Group 4: (15, 16, 20, 21, 22, 23, 28, 29, 31)

Step 2: Find prime implicants within each group.

For Group O: (0)
No further combinations possible as it contains only one minterm.
For Group 1: (1)
No further combinations possible as it contains only one minterm.
For Group 2: (2, 4)
The binary representations differ by 1 bit, so combine them:
(2, 4) => 2ĀBC + 2ABC

For Group 3: (6, 7, 9, 10)

Perform comparisons:
● 6 and 7 differ by 1 bit: (6, 7) => 6ĀBD +6ĀBE+7ĀBD+7ĀBE

● 6 and 9 differ by 1 bit: (6, 9) => 6ĀBD +6ĀBE+9ĀBC +9ĀBE

● 6 and 10 differ by 1 bit: (6, 10) => 6ĀBD +6ĀBE +10ĀBC + 10ĀBD
 ● 7 and 9 differ by 1 bit: (7, 9) => 7ĀBD +7ĀBE+9ĀBC +9ĀBE

● 7 and 10 differ by 1 bit: (7, 10) => 7ĀBD +7ĀBE +10ĀBC +10ĀBD

● 9 and 10 differ by 1 bit: (9, 10) => 9ĀABC +9ĀBE + 10ĀBC +10ĀBD

For Group 4: (15, 16, 20, 21, 22, 23, 28, 29, 31)
Perform comparisons to find prime implicants.
Performing comparisons for Group 4, we find the following prime implicants:
For Minterms 15 and 23: {15, 23} => 15BCDE + 23BCDE
For Minterms 15 and 31: {15, 31} => 15BCDĒ + 15BCDE + 31BCDE
For Minterms 15 and 29: {15, 29} => 15BCDE + 15BCDĒ + 29BCDE
For Minterms 15 and 28: {15, 28} => 15BDE + 15BE + 28BDE
For Minterms 15 and 21: {15, 21} => 15BDE + 15BE + 21BDE
For Minterms 15 and 22: {15, 22} => 15BDE + 15BE + 22BDE
For Minterms 15 and 16: {15, 16} => 15DE + 15E + 16DE
For Minterms 16 and 31: {16, 31} => 16BCDĒ + 16BCDE + 31BCDE
For Minterms 16 and 29: {16, 29} => 16BCDE + 16BCDĒ + 29BCDE
For Minterms 16 and 28: {16, 28} => 16BDE + 16BE + 28BDE
For Minterms 16 and 21: {16, 21} => 16BDE + 16BE + 21BDE
For Minterms 16 and 22: {16, 22} => 16BDE + 16BE + 22BDE
For Minterms 20 and 31: {20, 31} => 20BCDE + 31BCDE
For Minterms 20 and 29: {20, 29} => 20BCDE + 29BCDE
For Minterms 21 and 31: {21, 31} => 21BCDE + 31BCDE
For Minterms 21 and 29: {21, 29} => 21BCDE + 29BCDE
For Minterms 22 and 31: {22, 31} => 22BCDE + 31BCDE
For Minterms 22 and 29: {22, 29} => 22BCDE + 29BCDE
For Minterms 28 and 31: {28, 31} => 28CDE + 31CDE
For Minterms 28 and 29: {28, 29} => 28CDE + 29CDE

Step 3: Check for essential prime implicants and cover all minterms.
The essential prime implicants are those that cover a minterm that no other prime
implicant covers.
Here are the essential prime implicants based on the information provided:
• Essential prime implicant 15BCDE covers minterm 15 and is not covered
by any other prime implicant.
 • Essential prime implicant BCDĒ + 15BCDE + 31BCDE covers minterms
15, 28, and 31 without redundancy from other prime implicants.
• Essential prime implicant BCDE + 15BCDĒ + 29BCDE covers minterms
20 and 21 exclusively.
• Essential prime implicant 16BCDE + 16BCD + 29BCDE covers minterms
16 and 29 with no overlap from other prime implicants.
• Essential prime implicant 28C + 31CDE covers minterm 22 uniquely.
• Essential prime implicant 28CDE + 29CDE exclusively covers minterm 23.

Step 4: Create the simplified expression using the prime implicants.

The simplified expression will be the sum of the prime implicants obtained,
covering all minterms.

F(A,B,C,D,E)=2ĀBC+6ĀBE+6ĀBD+7ĀBD+9ĀBD+10ĀBC+15BCDE+23BCDE
+B̄ CDE+15BCDE+31BCDE+BCDE+15B̄ CDE+29BCDE+15BDE+15BE+28BD
E+15DE+15E+16DE+BCDE+16BCDE+31BCDE+16BCDE+16B̄ CD+29BCDE+
16BDE+16BE+28BDE+16BDE+16BE+21BDE+16BDE+16BE+22BDE+20BCD
E+31BCDE+20BCDE+29DE+21BCDE+31BCDE+21BCDE+29BCDE+22BCD
E+31BCDE+22BCDE+29BCDE+28C+31CDE+28CDE+29CDE
This represents the simplified Boolean expression derived from the given prime implicants.