Gates: OR

OR gate: implements OR function

Input: 2 bits

Output: 1 bit

Truth table:

Symbol:

Input

Output

x0

x1

z

0

0

0

0

1

1

1

0

1

1

1

1

z = x0 | x1

Other notation:

Properties:

z = OR (x0, x1)

symmetric:

x + y = y + x

z = x0 + x1

associative:

(x + y) + z = x + (y + z)

n inputs:

ORn (x0, x1, . . . , xn) = x0 + x1 + . . . xn