Simplifying boolean function using boolean algebra
18 views (last 30 days)
Show older comments
How to simplify the following expression :
A'BCD + AB'CD' + AB'CD + ABC'D + ABCD' + ABCD ?
It should get AC + BCD + ABD using Kmap but using boolean algebra i am stuck no matter how i try .
0 Comments
Answers (1)
Matt Fig
on 19 Nov 2012
>> syms A B C D
>> simplify((1-A)*B*C*D + A*(1-B)*C*(1-D) + A*(1-B)*C*D +...
A*B*(1-C)*D + A*B*C*(1-D) + A*B*C*D)
ans =
A*C + A*B*D + B*C*D - 2*A*B*C*D
Now look closely at the last term. The only case where it is nonzero is when all A,B,C,D are nonzero. If any non-zero value for the overall expression counts as true, then the last term is redundant.
0 Comments
See Also
Categories
Find more on Number Theory in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!