- #1

TheTopGun

- 16

- 0

## Homework Statement

Hey there, I'm having trouble simplifying a boolean expression using XOR and XNOR functions.

The final goal is to draw a logic circuit for the expression using NAND and XOR gates only.

## Homework Equations

Assuming

W' = Not WW' X' Y' Z' + W' X' Y Z + W' X Y' Z + W' X Y Z' + W X Y' Z' + W X' Y' Z

## The Attempt at a Solution

W' X' (Y⊕Z)' + W' X (Y⊕Z) + ...So far if I'm working correctly (?) I can simplify the first four expressions, It's just the last two that get me as they have no like terms ?

Once I understand this I should have no troubles drawing the logic circuit.

Thankyou for any responses