Skip to main content

Digital Logic · Logic minimization and hazards

A 4-bit input ABCD is interpreted as an unsigned binary integer N=8A+4B+2C+D

Problem

Digital Logic practice problem

A 4-bit input ABCDABCD is interpreted as an unsigned binary integer N=8A+4B+2C+DN=8A+4B+2C+D. Two functions are defined from NN.
• FBCDF_{\mathrm{BCD}} is an incompletely specified function of a binary-coded-decimal digit: FBCD=1F_{\mathrm{BCD}}=1 if N∈{1,3,5,7,9}N\in\{1,3,5,7,9\}, FBCD=0F_{\mathrm{BCD}}=0 if N∈{0,2,4,6,8}N\in\{0,2,4,6,8\}, and N∈{10,11,12,13,14,15}N\in\{10,11,12,13,14,15\} are don’t-cares.
• FfullF_{\mathrm{full}} is the fully specified function that is 11 if and only if N∈{1,3,5,7,9}N\in\{1,3,5,7,9\} and is 00 for every other 4-bit combination, including 1010 through 1515.

Use variable order ABCDABCD (AA most significant) and a 4-variable Karnaugh map with rows ABAB and columns CDCD in Gray-code order 00,01,11,1000,01,11,10. Minimality means fewest product terms, then fewest total literals.
(a) Obtain a minimal SOP for FBCDF_{\mathrm{BCD}} and state the don’t-care assignments it uses.
(b) Obtain a minimal SOP for FfullF_{\mathrm{full}}.
(c) State whether the two minimal expressions are identical. If they are not, name one minterm index at which they differ.

Hint

Hint

Invalid BCD codes may be used as 11s for FBCDF_{\mathrm{BCD}} but are hard zeros for FfullF_{\mathrm{full}}.

Check your work

Work the problem yourself first. Then open it in Training to check your answer and read the full worked solution.

The answer check and full solution for this problem come with ProofAnvil Practice membership ($19 USD monthly). See membership. Or start with the free Digital Logic sample problem: Try the free sample problem.

More Digital Logic practice problems

Back to Digital Logic

An original ProofAnvil practice problem, written for this course. ProofAnvil is a practice course, not a homework-answer service.