0
\$\begingroup\$

I am trying to make a decoder that can display all alphabetical letters on a 7-segment display. My inputs are ABCDE and the outputs are abcdefg

truth table

Is this the correct truth table for a circuit? If yes, what would its transformation to normal form look like?

I think it is correct, but I am struggling to simplify it.

\$\endgroup\$
3
  • \$\begingroup\$ @JRE Beat me to it, again. \$\endgroup\$
    – winny
    May 10 at 10:47
  • 2
    \$\begingroup\$ If the right segments are driven, the truth table is correct. Checking this, though lengthy, is a trivial operation that you should be able to do yourself. As for solving, using a 5 variable K-map should be able to simplify it. You could also use the built-in functions of Logisim. \$\endgroup\$
    – Bart
    May 10 at 10:56
  • \$\begingroup\$ Use something like this (32x8.com/var5.html) for each segment. \$\endgroup\$
    – devnull
    May 10 at 11:23

0

Your Answer

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

Browse other questions tagged or ask your own question.