Scribd
Upload
173 views

Exclusive or Gate and It's Applications

The document discusses the exclusive OR (XOR) gate, including its truth table and applications. It describes how the XOR gate can be used for arithmetic operations, parity checking, controlled inversion, binary-to-gray and gray-to-binary conversion, combinational logic minimization, and digital comparison of numbers. Specific applications covered include binary addition, error detection, inversion with a control signal, conversion between binary and gray codes, and comparing values in two-bit and multi-bit comparators.

Uploaded by

Rohit Patil
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
173 views

Exclusive or Gate and It's Applications

The document discusses the exclusive OR (XOR) gate, including its truth table and applications. It describes how the XOR gate can be used for arithmetic operations, parity checking, controlled inversion, binary-to-gray and gray-to-binary conversion, combinational logic minimization, and digital comparison of numbers. Specific applications covered include binary addition, error detection, inversion with a control signal, conversion between binary and gray codes, and comparing values in two-bit and multi-bit comparators.

Uploaded by

Rohit Patil
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

University of Technology Laser and Optoelectronics Engineering Department Digital Lab.

2010-2011

Experiment Number (3) Exclusive OR Gate and it's Applications


Object
To study the logic function of exclusive OR (XOR) gate, and become familiar with some of it's applications.

Theory
The output of XOR gate, is logic (1) when both inputs are different, and is logic (0) when inputs are the same, Fig. (1) gives the symbol and truth table for this gate.
A X B

X AB

A 0 0 1 1

B 0 1 0 1

X AB 0 1 1 0

Fig. (1) Exclusive OR gate with it's Truth Table Algebraically XOR output can be written as X AB AB , and can be implement as in Fig. (2):
A A

X B B

(A) Different Gates.

(B) NAND Gates only. Fig. (2) Implementation of XOR gate

University of Technology Laser and Optoelectronics Engineering Department Digital Lab. 2010-2011

Applications of XOR gate


There are many applications for XOR gate such as: 1. Arithmetic Operations: The XOR gate also called (Medulo Two Adder) , since it is used t give the sum of two binary numbers, it has been used in many arithmetic circuits (it will be explained in latter experiments). 2. Parity Checker: One of the advantages of using digital system, is it's capability of detecting and correction errors. This is used specially when digital information is transmitted or stored. One of the simplest form of error detecting is the parity checker, assume that, we have four bit word, to detect the occurrence of an odd number of errors in this word, a single bit will be added to the word that makes the number of "ones" in the word either even number "Even Parity" or odd number "Odd Parity", so, if an odd number of error occurred in the word then the total number of ones will not remain the same, it will change from odd to even or from even to odd. The XOR gate is the most suitable circuit to provide parity checker. Fig. (2) given the circuit of four bit even parity checker, to have an odd parity checker, we need to complement the output.
A B X Even Parity Bit C D

Fig. (3) Four Bit Even Parity Checker.

University of Technology Laser and Optoelectronics Engineering Department Digital Lab. 2010-2011

3. Controlled Inverter: The XOR gate can be used as a "NOT" gate by connecting one of the inputs to the logic (1), for this reason it can be used to complement a word by using one of the inputs as control line, as shown in Fig. (4), when control signal is logic (0) then, X = A; Y = B; Z = C. When control signal is logic (1) then, X A ; Y B ; Z C
A B C

Control Signal

Fig. (4) Controlled Inverter. 4. Binary to Gray / Gray to Binary Conversion: The gray code is widely used in many digital systems, specially in shaft register encoders and analog to digital conversion, but it is difficult to use the gray-code in arithmetic operations, since there are only one bit change between two consecutive gray code number, and it is unweighted code, and the XOR gate is the most suitable gate for this purpose as shown in Fig. (5)
X1 MSB X2 X3 X4 Gray Code A MSB B C D Binary Code

MSB A B (a) C D

Binary Code 3

MSB X1 X2 (b) X3

Gray Code X4

Fig. (5) (a). Gary to Binary

(b). Binary to Gray

University of Technology Laser and Optoelectronics Engineering Department Digital Lab. 2010-2011

5. Combinational Logic Circuit Minimization: Another useful application for XOR gate is, it's use in minimizing combinational circuit which will be dealt with in detail in other experiment. 6. Digital Comparator: Many practical applications require the comparator of two numbers A & B searching for either (a) quality or (b) non quality. If quality is what we looking for, this means A = B, then the output of the logic network (Z1) is expressed by the function concluded from the truth table below (Table 1).

Z 1 AB A B
When non-quality is what we require, this means A B, then we can concluded the Boolean expression for (Z2) from the truth table (Table 1).

Z 2 AB AB
If the comparison is such that the states of one number with respect to the other is to be specified one of the three conditions A > B, A < B, or A B should be known the simple Boolean expressions are: A > B. AB for A < B. AB for & AB A B for A B. A 0 0 1 1 B 0 1 0 1 AB 0 1 1 0

AB A B
(Z1) 1 0 0 1 Table (1)

AB AB
(Z2) 0 1 1 0

A>B 0 0 1 0

A<B 0 1 0 0

The comparison for two number of more than one binary bit may be summarized by the following steps: Suppose the two numbers X = A1 A2 Y = B1 B2

University of Technology Laser and Optoelectronics Engineering Department Digital Lab. 2010-2011

1. X = Y when A1 = B1 and A2 = B2. 2. X > Y If A1 > B1 or A1 = B1 and A2 > B2. 3. X < Y If A1 < B1 or A1 = B1 and A2 < B2. It is clear that to search for any of the three conditions it is only needed to found the equality condition for each higher bit to the next lower bit and so on. The way that equality condition is added to the single bit combater is shown:
A1 B1 S.B.C A=B

A2 B2

S.B.C

Fig. (6) Block diagram of Two-Two Bit Comparator.

Procedure
1. Connect the circuit shown in Fig. (1) and Fig. (2-A) and find the truth table for the circuit. 2. Connect the circuit in Fig. (3), find the even parity bit for the numbers -----------,----------,----------- and ---------, then find the odd parity bit for the numbers ---------,--------,----------- and -------------. 3. Connect a circuit that convert four bit word using XOR gate, find one's complement for the numbers ---------,---------,--------- and --------

University of Technology Laser and Optoelectronics Engineering Department Digital Lab. 2010-2011

4. Connect 5 bit gray to binary converter circuit and find the equivalent binary for the following gray code -------,-------,------- and --------, then connect 3 bit binary to gray code converter circuit and find the equivalent gray code for these binary numbers -------,--------,------- and ------. 5. Referring to the truth table shown in Table (1) shown in the theory implement a circuit for single bit comparator.

Discussion
1. Draw the circuit diagram for four input XOR gate. Explain the circuit. 2. Draw a circuit diagram that detect errors is an odd parity 5 bit word. 3. Can you add more applications for XOR gates. 4. Write down the equivalent gray code for the numbers 0-15. 5. Design a logic circuit that can compare between two-two bit binary number. Draw the circuit and find it's truth table. 6. Suggest some application where comparator is useful.

You might also like