How to simplify this logic equation?

[EDA_hg81]

simplify logic equations

How to simplify this logic equation?

Out <= S(6) xor S(6) xor S(6) xor S(7)

Do you think it can be simplified to:

Out <= S(7)

Thanks

 

[oursriharsha]

and xor simplify

it is equivalent to s(7)bar

s(6) xor s(6) yields 0 always ,
0 xor s(6) yields a 1
1 xor s(7) yields s(7)bar.

the simulation showed an output equivalent to s(7)bar .

check this out and correct me , i f worng , and if that assignemnt dont work as expalined .
but the output always yielded s(7)bar.

 

[Guest]

how to simplify an equation

the above is not correct

because

s(6) xor s(6) yields 0 always , => ok
0 xor s(6) yields a 1 => not ok but 0 xor s(6) = s(6)
1 xor s(7) yields s(7)bar => and consequently result = s(6) xor s(7)

greetings

 

[oursriharsha]

how to simplify equations

Yup ,
I admit i overlooked!

thank you ..

 

[EDA_hg81]

So many thanks to both of you.

 

[trekkytekky]

As a proof, demorgans would be

if A=s(6) and B=s(7)

A XOR A XOR A =
(((A.-A)+(-A.A)) .-A) + (-((A.-A)+(-A.A)).A)

we know A.-A = -A.A , A.-A=0, 0.A = 0, 1.A = A

=> (0+0)*-A + -(0+0)*A
=> 0 + 1.A = A

so answer is A XOR B => s(6) xor s(7)

nice to know sometimes theory matches reality!

 

[oursriharsha]

good patience..
trek*