I have a logic circuit where the output can be represented with the following boolean expression
(1)$\overline {xy}$ + x $\bar y z$ + $\overline {\bar x + z} $ + y
Using truth tables I found the complete sum of products form as:
(2)$xyz + xy \bar z + x \bar y z + x \bar y \bar z + \bar xyz + \bar x y \bar z + \bar x\bar yz + \bar x\bar y\bar z$
However, I would like to be able to find the sum of products form by using boolean identities to rearrange (1) above. I am unable to see how we can get from (1) to (2) though. Maybe it is the case that (2) can be reduced further?? Please could someone advise on this
Thanks