Minimization (Boolean Function)?

Question

Respected,
Kindly help me in minimizing the following boolean function ( a '\' means 'Not' or Compliment)

\A \B \C + \A B C + A \B C + A B \C

Thanks in advance.

Answer 1

The result is an odd number of zeros from the 3-bit input (A,B,C) which is called odd parity. Parity generators are trees of Exclusive OR gates. In this case:

Y = not((A xor B) xor C)

alternately:

Y = (A xor B) xnor C

.

Answer 2

/A/B/C+/ABC+AB/C=/A[/B/C+BC]+AB/C=/A[1]+AB/C=/A+AB/C