0
\$\begingroup\$

What will a combinational logic circuit look like using any basic gates having the output=1 when the input=110 and 101?

\$\endgroup\$

migrated from dsp.stackexchange.com May 23 '13 at 11:43

This question came from our site for practitioners of the art and science of signal, image and video processing.

  • 2
    \$\begingroup\$ Hint: \$x \wedge (y \oplus z)\$ \$\endgroup\$ – Dilip Sarwate May 23 '13 at 12:07
  • 3
    \$\begingroup\$ As for all questions that smell of homework: what have you done or found out so far, at what point are you stuck? \$\endgroup\$ – Wouter van Ooijen May 23 '13 at 12:42
  • \$\begingroup\$ Hint: You can use a Karnaugh map to easily figure this out. Not sure if they still teach that or not. \$\endgroup\$ – Jason R May 23 '13 at 13:52
2
\$\begingroup\$

use 3 variable K-map for solving this problem

\$\endgroup\$
  • \$\begingroup\$ A Karnaugh map is only necessary for deriving the function from raw inputs and outputs, or as an optimization tool for finding a minimal function. Here, the function is already given as a sum of products: the output is to be 1 if the inputs are 101 or 110 (and presumably 0 if the inputs are otherwise). From this you can go straight to gates (perhaps after some algebra). xy'z + xy'z -> x(y'z + yz'), and perhaps -> x(y xor z). \$\endgroup\$ – Kaz May 23 '13 at 19:12
  • \$\begingroup\$ already answer given by Dilip Sarwate \$\endgroup\$ – yogece May 23 '13 at 19:21

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy