Institute of Computer Engineers of the Philippines

Region 1
Logic Circuits Design Questions

Problem 1

The four inputs to a circuit (A,B,C,D) represent an 8-4-2-1 binary coded decimal digit. Design the
circuit so that the output (Z) is 1 if and only if the digital number represented by the inputs is exactly
divisible by three (3). Assume that only valid BCD digits occur as inputs.

SOLUTION

ONLY DIGITS 0,3,6 AND 9 ARE EXACTLY DIVISIBLE BY 3, SO Z=1 FOR THE INPUT COMBINATIONS
ABCD=0000, 0011, 0110 AND 1001. THE INPUT COMBINATIONS 1010, 1011, 1100, 1101, 1110, AND
1111 DO NOT REPRESENT VALID BCD DIGITS AND WILL NEVER OCCUR, SO Z IS A DON’T CARE FOR THESE
COMBINATIONS. THIS LEADS TO THE FOLLOWING TRUTH TABLE:

D= DON’T CARE

A B C D NO. F

0 0 0 0 0 1

0 0 0 1 1 0

0 0 1 0 2 0

0 0 1 1 3 1

0 1 0 0 4 0

0 1 0 1 5 0

0 1 1 0 6 1 THE CORRESPONDING OUTPUT FUNCTION IS

0 1 1 1 7 0 Z=∑ m (0, 3, 6, 9)+∑d(10, 11, 12, 13, 14, 15)

1 0 0 0 8 0 IN ORDER TO FIND THE SIMPLEST CIRCUIT WHICH WILL REALIZE Z,

WE MUST CHOOSE SOME DON’T CARES (X’S) TO BE 0 AND SOME
1 0 0 1 9 1 TO BE 1. THE EASIEST WAY TO DO THIS IS TO USE K-MAP. UPON
PLOTTING FROM A 4-VARIABLE K-MAP, WE HAVE
1 0 1 0 D X

1 0 1 1 D X
Z=∑m(0, 3, 6, 9) +∑ m(11, 13, 14, 15)
1 1 0 0 D X
Z=A’B’C’D’ + AD + BCD’ + B’CD
1 1 0 1 D X

1 1 1 0 D X

1 1 1 1 D X
 Institute of Computer Engineers of the Philippines
Region 1
Logic Circuits Design Questions

PROBLEM 2

Design a circuit which has a 5-bit binary input (A, B, C, D, E), with A being the MSB (Most Significant
Bit). It must produce an output logic High for any prime number detected in the input data.

SOLUTION:

THE MINTERM ASSOCIATED FOR DETECTION OF PRIME NUMBERS IN THE FIVE VARIABLE INPUTS ARE
M1, M2, M3, M5, M7, M11, M13, M17, M19, M23, M29 AND M31. THE CORRESPONDING 5 VARIABLE
KARNAUGH MAP USING GRAY CODE IS SHOWN IN FIG. X-3 ALONG WITH THE GROUPING E.G.
MINTERMS M1, M3, M7, M5 IN POSITIONS 00001, 00011, 00111, 00101 CAN FORM A GROUP AND
AMONG THEM VARIABLES A, B AND E REMAIN CONSTANT WITH VALUES 0,0,1 RESPECTIVELY.
CONDUCTING THIS EXERCISE FOR OTHER GROUPS WE GET FINAL EXPRESSION AS

Y=A'B'E + B'C'E + A'B'C'D + AB'DE + A'CD'E + ABCE +A'C'DE