Our professor gave us this equation to simplify and after 3 hours and countless attempts I'm still stuck. I'm very new to Boolean logic so thats probably not a good indication at its difficulty :p.

Inputs: A, B, C, D Output: Y

Anyways here is the equation:

$$\overline{(AB ⊕ CD) + (D ⊕ A)(\overline{\overline A\ \overline B\ \overline C}})$$


A ⊕ B = A xor B

AB = A and B

A + B = A or B

$\overline A$ = not A

Any help would be really appreciated.

(Need to submit my assignment tomorrow, need help asap pls. I'm really stuck and came here only after trying it myself as much as I could.)

EDIT: There was a typo in the question, updated it with the correct question in both post and title.

  • $\begingroup$ What have you tries? What rules do you know for simplifying these things? $\endgroup$ May 13, 2018 at 20:45
  • $\begingroup$ @ThomasAndrews I've used the basic Boolean algebra laws. electronics-tutorials.ws/boolean/bool_6.html And ive tried using demorgans law to split the main complement line by changing the + to a *. I seem to keep cycling back to the same equation and it doesn't become any simpler, just more complicated. $\endgroup$ May 13, 2018 at 21:17

1 Answer 1



$$ x_{1}\oplus x_{2}=x_{1}\bar{x}_{2}+\bar{x}_{1}x_{2} $$

$$ \overline{\bar{x}_{1}\bar{x}_{2}}=x_{1}+x_{2} $$

  • $\begingroup$ I already knew both of those and applied them but wasn't able to solve the equation. :( Thanks for trying to help though! :D $\endgroup$ May 13, 2018 at 21:24

Your Answer

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

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