1
\$\begingroup\$

And how would one do so?

I'm doing a programming project that requires me to propagate input signals through a circuit consisting of different types of logic gates. One of the gates I need to implement is a custom one whose truth table is:

+---------+---------+---------+--------+ | Input 1 | Input 2 | Input 3 | Output | +---------+---------+---------+--------+ | 0 | 0 | 0 | 1 | | 0 | 0 | 1 | 1 | | 0 | 1 | 0 | 0 | | 0 | 1 | 1 | 0 | | 1 | 0 | 0 | 1 | | 1 | 0 | 1 | 0 | | 1 | 1 | 0 | 0 | | 1 | 1 | 1 | 0 | +---------+---------+---------+--------+

I'm not terribly familiar with boolean functions, digital logic, etc. so any help or insight is greatly appreciated.

\$\endgroup\$
2
  • \$\begingroup\$ If you were designing with transistors, you could make a custom gate to implement this. But if you're programming a computer to simulate it, you're stuck with the logic operations offered by your programming language. \$\endgroup\$ Commented Nov 12, 2015 at 19:38
  • 1
    \$\begingroup\$ If you feel like a bit of studying, Digital Logic Design is a useful text. You could jump to page 27 "Combinational circuit". \$\endgroup\$ Commented Nov 12, 2015 at 21:42

1 Answer 1

Reset to default
2
\$\begingroup\$

Yes. This could be done by inspection, or by Karnaugh maps. Although there are different methods.

The most basic method is to express the output obtained from the truth table, as a sum of products or products of sums, following the rules of Boolean algebra.
Thus, the canonical expression function described by the truth table is achieved.
By Karnaugh map, you can reduce that logic function.

\$\endgroup\$