Combinational circuit: A combinational circuit has four inputs (W, X, Y, and Z) and one output,
V. The output is 1 if and only if the 5421 BCD coded digit represented by ABCD is less than 7.
Draw a truth table relating V with the four inputs. Note that input combinations corresponding to
non-code-words never occur and you need not include them in your truth table. Write V as a
canonical sum of products (minterm expansion form), and also as a canonical product of sums
terms (maxterm expansion form). Using K-map minimization technique, write the output
variables as functions of input variables in minimized SOP form.
Solution
a)
b)
V in SOP can be written as V=W\'X\'Y\'Z\'+W\'X\'Y\'Z+W\'X\'YZ\'+W\'X\'YZ
c)here if we draw the four variable K map, it will look like:-
Therefore, the solution of the K map will be
X\'Z\"WXYZV00001000110010100111010001000010010101001011011000.
Combinational circuit A combinational circuit has four inputs (W, X.pdf
1. Combinational circuit: A combinational circuit has four inputs (W, X, Y, and Z) and one output,
V. The output is 1 if and only if the 5421 BCD coded digit represented by ABCD is less than 7.
Draw a truth table relating V with the four inputs. Note that input combinations corresponding to
non-code-words never occur and you need not include them in your truth table. Write V as a
canonical sum of products (minterm expansion form), and also as a canonical product of sums
terms (maxterm expansion form). Using K-map minimization technique, write the output
variables as functions of input variables in minimized SOP form.
Solution
a)
b)
V in SOP can be written as V=W'X'Y'Z'+W'X'Y'Z+W'X'YZ'+W'X'YZ
c)here if we draw the four variable K map, it will look like:-
Therefore, the solution of the K map will be
X'Z"WXYZV00001000110010100111010001000010010101001011011000
