1
\$\begingroup\$

I'm trying to simplify the expression given by the following Karnaugh map to an expression that is using only NANDs, NOTs and ANDs- the less gates (of any kind), the better.

Karnaugh Map

I know how to optimize it to an (OR,AND,NOT) system, but that doesn't seem to help.

I also know how to create an OR gate using only NANDs and NOTs, but that creates a really complicated expression and I've been hinted there's a simple one.

I tried using Wolfram Alpha, but no (AND,NAND,NOT) system exist. The closest one is a (NAND, NOT) system and that expression still looks complicated.

I'm allowed 4 inputs per NAND and 2 inputs per AND.

Thanks in advance!

\$\endgroup\$
4
  • \$\begingroup\$ How many inputs are you allowed per gate? Unspecified? \$\endgroup\$
    – user16324
    Commented Jun 15, 2015 at 21:37
  • \$\begingroup\$ Start with getting the POS expression. In your case you will get from the K-map 4 3-var sums, while each of them can be transformed to a 3-input-NAND representation using the DeMorgan rule. So without any further manual simplifications, I am getting here 4 NOT gates, 4 3-input NANDS and one 4-input AND - total of 9 gates. \$\endgroup\$
    – Eugene Sh.
    Commented Jun 15, 2015 at 21:42
  • \$\begingroup\$ @BrianDrummond Sorry, I haven't specified that. I'm allowed 2 inputs per AND and 4 inputs per NAND. \$\endgroup\$
    – Peterrr
    Commented Jun 15, 2015 at 21:56
  • \$\begingroup\$ @EugeneSh. Thanks! As I've now added I'm only allowed 2 inputs per AND, so although I could part the AND in your solution to 2 ANDs maybe there's a better solution under these conditions. \$\endgroup\$
    – Peterrr
    Commented Jun 15, 2015 at 21:58

1 Answer 1

Reset to default
2
\$\begingroup\$

Complement Law says \$\overline{\overline{X}} = X\$.

$$\overline A\ \overline B\ \overline C + \overline A\ B\ C + A\ B\ D + A\ \overline B\ \overline D$$

Take Double Complement. $$\overline{\overline{\overline A\ \overline B\ \overline C + \overline A\ B\ C + A\ B\ D + A\ \overline B\ \overline D}}$$

Use DeMorgan's to remove lower complement. $$\overline{\overline{\overline A\ \overline B\ \overline C} ∙ \overline{\overline A\ B\ C} ∙ \overline{A\ B\ D} ∙ \overline{A\ \overline B\ \overline D}}$$

4 NOTs, 4 3-input NANDs, 1 4-input NAND.

\$\endgroup\$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.