How Can You Simplify This Boolean Equation Further?

  • Thread starter Thread starter triden
  • Start date Start date
  • Tags Tags
    Simplifying
Click For Summary
The discussion focuses on simplifying the Boolean equation X = A\overline{D}+\overline{B}AC+\overline{B}\overline{D}\overline{C}+BA\overline{C}. The user has already used a Karnaugh map to simplify the equation but seeks further reduction. Suggestions include utilizing De Morgan's law, double negation, and other logic properties to achieve a more compact form. A proposed simplification is A(B xor C + D') + B'C'D'. The conversation emphasizes the importance of visual aids like Karnaugh maps for effective simplification.
triden
Messages
172
Reaction score
0

Homework Statement



X = A\overline{D}+\overline{B}AC+\overline{B}\overline{D}\overline{C}+BA\overline{C}

Homework Equations



I need to try to simplify or reduce that boolean equation to something as small as possible.

The Attempt at a Solution



It used to be worse and I used a karnaugh map to get to where I am now from a truth table. I am having trouble getting anything better. I can reduce it to get an XOR gate, but I think it can do better. Any tips?

Thanks
 
Last edited:
Physics news on Phys.org
de morgan's law, double negation, tautologies, and logic properties
http://www.facstaff.bucknell.edu/mastascu/eLessonsHTML/Logic/Logic2.html
 
Last edited:
You can reduce gate inputs by collecting terms, but this is as simplified as it gets. Draw the k-map. A(B xor C + D') + B'C'D'
 
Last edited:

Similar threads

  • · Replies 2 ·
Replies
2
Views
3K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
2
Views
2K
Replies
4
Views
6K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
6K