Simplifying a bitwise operation

Question

I have the following bitwise expression and was wondering if it could be simplified or if there is a general way of interpreting the output.

(x & y) | (~x & ~y)

What operations can you use? Logically it's the same as NOT(XOR(x, y)) — D Stanley
– D Stanley, Commented Oct 4, 2019 at 3:08

D Stanley · Accepted Answer · 2019-10-04 03:20:14Z

The only "simpler" version is ~(x^y) (where ^ is the XOR operator).

However, It's not going to make a significant difference computationally, and is harder to read for most people (XOR is not as natural as AND and OR). There's not a simpler version using just AND and OR operators, so I would suggest you just leave it as-is.

if there is a general way of interpreting the output.

"Either both are true or both are false" is a natural interpretation.

Collectives™ on Stack Overflow

Simplifying a bitwise operation

1 Answer 1

Comments

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Related