1

Let's say I have the following logical circuit:

enter image description here

How can I create a simplified version (assuming that one exists) without laboriously creating a truth table for it? I was thinking of perhaps writing the boolean expression as a sum of minterms to then create a Karnaugh map, but the expression that I get is unwieldy. Is there a better way?

daedsidog
  • 1,732
  • 2
  • 17
  • 36
  • 1
    There is no easy way. Truth table and Karnaugh map are helpful to derive a minimized two-level circuit. For multi-level circuits with multiple gate types, you might want to try [Logic Friday 1](https://logic-friday.software.informer.com/1.1/). – Axel Kemper May 05 '20 at 21:13

0 Answers0