How to simplify this boolean algebra (logic)

AI Thread Summary
The discussion focuses on simplifying the boolean expression h = (abc + abd + acd + bcd)’ related to logic circuits. The initial approach involves converting the expression into a product-of-sum form, leading to h = (abc)'(abd)'(acd)'(bcd)'. Participants explore further simplification steps, including using De Morgan's theorem and combining terms. The conversation also touches on how to add new terms to expressions effectively, demonstrating the application of boolean algebra rules. The goal is to achieve the simplest form of the original boolean expression.
aruwin
Messages
204
Reaction score
0
This is related to logic circuits.
How do I simplify this boolean algebra(logic) into its simplest expression?

h = (abc + abd + acd + bcd)’

My first attempt would be to change it into product-of-sum.
h = (abc)'(abd)'(acd)'(bcd)'

and then what next?
 
Physics news on Phys.org
aruwin said:
This is related to logic circuits.
How do I simplify this boolean algebra(logic) into its simplest expression?

h = (abc + abd + acd + bcd)’

My first attempt would be to change it into product-of-sum.
h = (abc)'(abd)'(acd)'(bcd)'

and then what next?

h = (abc)'(abd)'(acd)'(bcd)'

= (a'+b'+c')(a'+b'+d')(a'+c'+d')(b'+c'+d')

= (a'+b'+c'+d)(a'+b'+c'+d')(a'+b'+c+d')(a'+b'+c'+d')(a'+b+c'+d')(a'+b'+c'+d')(a+b'+c'+d') (a'+b'+c'+d')

=(a'+b'+c'+d)(a'+b'+c+d')(a'+b+c'+d')(a+b'+c'+d')(a'+b'+c'+d')


I hope it is correct..
 
i_madini said:
h = (abc)'(abd)'(acd)'(bcd)'

= (a'+b'+c')(a'+b'+d')(a'+c'+d')(b'+c'+d')

= (a'+b'+c'+d)(a'+b'+c'+d')(a'+b'+c+d')(a'+b'+c'+d')(a'+b+c'+d')(a'+b'+c'+d')(a+b'+c'+d') (a'+b'+c'+d')

=(a'+b'+c'+d)(a'+b'+c+d')(a'+b+c'+d')(a+b'+c'+d')(a'+b'+c'+d')


I hope it is correct..

Could you explain to me how you add the new terms into the expression?
 
Let's assume we have :

F = A'+AB

= A'(B+B') + AB # B+B'= 1, will not affect the equation.

= A'B + (A'B' + AB) # Cancel each other.

= A'B

By the same way :)
 
Back
Top