A good way to do it is to make a truth table according to your expression and then draw a Karnaugh map and simplify it.x= AB'(A'BC+DB)(BC+CD')+ABC+BC'D'+D(B'+C')
' = not......
Any help would be appreciated. I've read over the proofs but am having trouble getting started.
Ohh yes you are rightredbuckeye84,
The first expression AB'(A'BC+DB)(BC+CD')=0 so all that is left is ABC+BC'D'+D(B'+C') mik3 made an error in reduction.
Map it out on a 4 variable K-map and find out how the terms combine. Then chose the Boolean theorem that fits the groupings. The K-map also will find the correct answer or answers if there is more than one. Ask if you need more help. Ratch
|Thread starter||Similar threads||Forum||Replies||Date|
|I need help simplifying a circuit by removing redundant NAND gates||Homework Help||5|
|1||Need Help Simplifying A Circuit||General Electronics Chat||7|
|T||need help simplifying these please||Homework Help||3|
|T||Need help understanding and simplifying circuit||General Electronics Chat||12|
|T||Need help simplifying a boolean expression||Homework Help||2|
by Jake Hertz
by Luke James