THE OR GATE

The OR gate differs from the AND gate in that only ONE input has to be HIGH to produce a HIGH output. An easy way to remember the OR gate is that any HIGH input will yield a HIGH output.

LOGIC SYMBOL

Figure 2-6 shows the standard symbol for the OR gate. The number of inputs will vary according to the needs of the designer.

Figure 2-6. - OR gate.

The OR gate may also be represented by a simple circuit as shown in figure 2-7. In the OR gate, two switches are placed in parallel. If either or both of the switches are closed (view A), the lamp will light. The only time the lamp will not be lit is when both switches are open (view B).

Figure 2-7. - OR gate equivalent circuit: A. Logic 1 state; B. Logic 0 state.

Let's assume we are applying two variables, X and Y, to the inputs of an OR gate. For the circuit to produce a HIGH output, either variable X, variable Y, or both must be HIGH. The Boolean expression for this operation is f = X+Y and is spoken "f equals X OR Y." The plus sign indicates the OR function and should not be confused with addition.

OR GATE OPERATION

Look at figure 2-8. At time T₀, both X and Y are LOW and f is LOW. At T₁, X goes HIGH producing a HIGH output. At T₂ when both inputs go LOW, f goes LOW. When Y goes HIGH at T₃, f also goes HIGH and remains HIGH until both inputs are again LOW. At T₅, both X and Y go HIGH causing f to go HIGH.

Figure 2-8. - OR gate input and output signals.

TRUTH TABLE

Using the inputs X and Y, let's construct a Truth Table for the OR gate. You can see from the discussion of figure 2-8 that there are four combinations of inputs. List each of these combinations of inputs and the respective outputs and you have the Truth Table for the OR gate.

f = X + Y

When writing or stating the Boolean expression for an OR gate with more than two inputs, simply place the OR sign (+) between each input and read or state the sign as OR. For example, the Boolean expression for an OR gate with the inputs of A, B, C, and D would be:

f = A+B+C+D

This expression is spoken "f equals A OR B OR C OR D."

You can substitute the complements for the original statements as we did with the AND gate or use negative logic; but for an output from an OR gate, at least one of the inputs must be TRUE.

Q.10 Write the Boolean expression for an OR gate having G, K, and L as inputs.
Q.11 How many input combinations are possible using G, K, and L?
Q.12 How many of those combinations will produce a HIGH output?