Let `oplus` denote the Exclusive OR (XOR) operation. Let '1' and '0' denote the binary
constants. Consider the following Boolean expression for F over two variables P and Q.
F (P, Q) = ((1 `oplus` P) `oplus` (P `oplus` Q)) `oplus` ((P `oplus` Q) `oplus` (Q `oplus` O))
The equivalent expression for F is
F (P, Q) = ((1 `oplus` P) `oplus` (P `oplus` Q)) `oplus` ((P `oplus` Q) `oplus` (Q `oplus` O))
= (`overline(P)` `oplus` (P`overline(Q)` + `overline(P)`Q)) `oplus` ((P`overline(Q)` + `overline(P)`Q) `oplus` Q)
=[`overline(P)`(PQ + `overline(P)` `overline(Q)`) + P(P`overline(Q)` + `overline(P)`Q)] `oplus` [(PQ + `overline(P)` `overline(Q)`) Q + (P`overline(Q)` + `overline(P)`Q)`overline(Q)`]
=(`overline(P)` `overline(Q)` + P`overline(Q)`) `oplus` (PQ + P`overline(Q)`) = `overline(Q)` `oplus` P = PQ + `overline(P)` `overline(Q)` = `overline(P oplus Q)`
Was this answer helpful ?
Submit Solution