Simplifying boolean function using boolean algebra

9 次查看(过去 30 天)
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 .

回答(1 个)

Matt Fig
Matt Fig 2012-11-19
>> 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.

类别

Help CenterFile Exchange 中查找有关 Symbolic Math Toolbox 的更多信息

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by