Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Next revision		Previous revision
learn:fundamentals:digital-logic:xor-and-xnor:start [2016/07/25 18:51] – created Marthalearn:fundamentals:digital-logic:xor-and-xnor:start [2022/10/04 11:38] (current) – external edit 127.0.0.1
Line 2: Line 2:
 The Exclusive OR (or XOR) relationship $F = A\oplus B$ is defined by the truth tables shown in Fig. 1 and the equivalent two-variable logic expressions $F_{SOP}=A\cdot \overline{B} + \overline{A}\cdot B$ and $F_{POS} = (A+B)\cdot (\overline{A} + \overline{B})$. The Exclusive OR (or XOR) relationship $F = A\oplus B$ is defined by the truth tables shown in Fig. 1 and the equivalent two-variable logic expressions $F_{SOP}=A\cdot \overline{B} + \overline{A}\cdot B$ and $F_{POS} = (A+B)\cdot (\overline{A} + \overline{B})$.
  
-{{ :learn:fundamentals:digital-logic:xor-and-xnor:xnortt.png?direct |Figure 1. XOR truth table.}}+{{ :learn:fundamentals:digital-logic:xor-and-xnor:xortt.png?direct |Figure 1. XOR truth table.}}
  
 The XOR function is frequently used in digital circuits to manipulate signals that represent binary numbers—these circuits will be presented in a later module. For now, note the XOR output is asserted whenever an odd number of inputs are asserted. This “odd detector” nature of the XOR relationship holds for any number of inputs. The XOR function is frequently used in digital circuits to manipulate signals that represent binary numbers—these circuits will be presented in a later module. For now, note the XOR output is asserted whenever an odd number of inputs are asserted. This “odd detector” nature of the XOR relationship holds for any number of inputs.