Scribd
Upload
41 views3 pages

BCSL 022 Labreport

The document discusses the implementation of an Exclusive-OR (XOR) gate using only AND, OR, and NOT logic gates. It first provides background on XOR gates and describes the operations of AND, OR, and NOT gates individually. It then explains the steps to represent the XOR function using those three basic gates by breaking down the XOR expression into its constituent parts.

Uploaded by

Chandan Mallik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
41 views3 pages

BCSL 022 Labreport

The document discusses the implementation of an Exclusive-OR (XOR) gate using only AND, OR, and NOT logic gates. It first provides background on XOR gates and describes the operations of AND, OR, and NOT gates individually. It then explains the steps to represent the XOR function using those three basic gates by breaking down the XOR expression into its constituent parts.

Uploaded by

Chandan Mallik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

BCSL 022

LAB REPORT
Session 1:
1. Design and implement the Exclusive-OR gate using AND, OR & NOT gates.
Exclusive-OR gate

The “Exclusive OR Gate” is another type of digital logic gate commonly used
in arithmetic operations since it can be used to give the sum of two binary
numbers as well as error-detection and correction circuits. The Exclusive-OR
Gate function, or Ex-OR for short, is achieved by combining standard logic
gates together to form more complex gate functions that are used extensively
in building arithmetic logic circuits, computational logic comparators and error
detection circuits. The two-input “Exclusive-OR” gate is basically a modulo two
adder, since it gives the sum of two binary numbers and as a result are more
complex in design than other basic types of logic gate. The truth table, logic
symbol and implementation of a 2-input Exclusive-OR gate is shown below.
AND GATE
This gate is a binary logical operation. It is identical to multiplication operation.
When both the inputs of the gate are high then only the output will be high in
other cases when at least one low input is there the output will be always low. It
performs logical conjunction operation. The logical expression for AND
gate is �∧�=�.�A∧B=A.B. There also exists multiple input AND gates.
Multiplexers use AND gates for selecting the signal out of many inputs based
on the control signal. AND gates play an important role while implementation of
combinational logical circuits.

The expression for the AND gate is given below :


C=A.B
Where A and B are the Inputs and C is the Output.
OR Gate
It is another type of logic gate which is identical to addition operation. When any
of the inputs is high the output will be high. The output will be low only when all
the inputs are low. This gate performs logical disjunction. The operation of OR
gate similar to addition of 1’s and 0’s.

The logical expression of OR gate is given below :


A∨B = A+B.
NOT Gate
This gate is also known as logical negation operation. This gate converts high
input to low and vice versa. It is a single input gate. This gate is also not as
inverter as it inverts the input. This is a single input gate, and it always gives the
complement of its input as an output. It is used in applications where inversion
is required. The use of NOT gate in circuit design can create propagation
delays.

The logical expression of the NOT gate is given below :


Y= A.
Implementation of XOR Gate from AND, OR and NOT
Gate
As we know, the expression of XOR is A⊕B=A.Bˉ+Aˉ.B so we implement this
expression using three types of gates AND, OR and NOT which are explained
above. The combination of three gates are used to achieve the expression of
XOR.
The steps that are required to follow to implement XOR gate are given below,
 First we need to break the expression into different parts which will help us
to analyze the number of gates required.
 After breaking the expression in the above step we can see that we need 2
NOT, 2 AND and a NOT gate.
 There are two two inputs to the OR gate which are outputs of AND gate.
 Input A is given of one AND gate and to Another AND gate through a NOT
gate.
 Now, input B is given to the AND gate which has negation of input A and the
AND gate which has direct input A gets input B through a NOT Gate.
 The output of both the AND gate is then given as input to the OR gate.
 The final output of the OR gate is the expression of XOR gate.

You might also like