How to prove the SOP and POS are equivalent to one another in XOR Funtion?

Asked Feb 05 '21 at 08:45

Active Feb 05 '21 at 14:18

Viewed 1,049 times

Write two Boolean expressions for the Exclusive-OR function, one written in SOP form and the other written in POS form. Simplify both expressions using Boolean algebra reduction and show that the two expressions are equivalent to one another. Draw the simplified circuit diagram for this function.

So, I've got

A B Output

1 1 0

1 0 1

0 1 1

0 0 0

SOP: A(B)'+(A)'B

POS: ((A)'+(B)')(A+B)

How to show that A(B)'+(A)'B = ((A)'+(B)')(A+B)

asked Feb 05 '21 at 08:45

hide on bush

Just draw the truth tables for both – user253751 Feb 05 '21 at 08:49
De Morgan's Rules ! ? https://i.stack.imgur.com/gqaMW.png – Tony Stewart EE75 Feb 05 '21 at 09:39
just expand the POS and note that E'.E=0. – Paul Ghobril Feb 05 '21 at 09:40
Could you tell me how to expand POS? – hide on bush Feb 05 '21 at 12:19
Do you know how to multiply? Take the POS and multiply it out. Distributive Law. Show us what you have tried or are stuck on. We will help, but an answer gains you nothing. – StainlessSteelRat Feb 06 '21 at 01:59

How to prove the SOP and POS are equivalent to one another in XOR Funtion?

0 Answers0