Experiment No:-08

Diodes as a Logic Gates (OR-Gate & ANDGate)

Introduction:A logic gate is an idealized or physical device implementing a Boolean function, that
is, it performs a logical operation on one or more logic inputs and produces a single
logic output. Depending on the context, the term may refer to an ideal logic gate,
one that has for instance zero rise time and unlimited fan-out, or it may refer to a
non-ideal physical device. Logic gates are primarily implemented electronically
using diodes or transistors, but can also be constructed using electromagnetic
relays (relay logic), fluidic logic, pneumatic logic, optics, molecules, or even
mechanical elements. With amplification, logic gates can be cascaded in the same
way that Boolean functions can be composed, allowing the construction of a
physical model of all of Boolean logic, and therefore, all of the algorithms and
mathematics that can be described with Boolean logic.
Diode logic (DL), or diode-resistor logic (DRL), is the construction of Boolean logic gates from diodes. Diode
logic was used extensively in the construction of early computers, where semiconductor diodes could replace
bulky and costly active vacuum tube elements. The most common use for diode logic is in DTL (Diode
Transistor Logic) integrated circuits that include an inverter for power gain and signal restoration.
While diode logic has the advantage of simplicity, the lack of an amplifying stage in each gate limits its
application. Not all logical functions can be implemented in diode logic alone; only the noninverting logical AND and logical OR functions can be realized by diode gates. If several diode logic gates are
cascaded, the voltage levels at each stage are significantly changed, so one-stage is normally used. In special
designs two-stage applications are sometimes achieved.

OR-Gate:The OR gate is a logic device that has two or more inputs and one
output.The OR gate is a digital logic gate that implements logical disjunction - it behaves according to
the truth table to the right. A HIGH output (1) results if one or both the inputs to the gate are HIGH. If neither
input is high, a LOW output (0) results. In another sense, the function of OR effectively finds the maximum
between two binary digits, just as the complementary AND function finds the minimum.

Symbol:Symbolically OR-GATE can be represented as:

OR Gates - Boolean Algebra Equation:The OR gate operation can also be expressed by Boolean Algebra equation.
For a 2-input Or gate , the equation is:
X = A+ B
The symbol for an OR gate operation is a +. It does not mean addition.
This equation reads X equals A or B, which simply means that the output of the
gate is a logic 1 when A or B inputs are in their 1 state.

Truth Table:X

Circuit Diagram:-

F=(X+Y)

Explanation:If X = 0 and Y = 0, then both diodes D1 and D2 are reverse biased and thus both the
diodes are in cut-off and thus F is low.
If X = 0 and Y = 1, D1 is reverse biased, thus does not conduct. But D2 is forward
biased, thus conducts and thus pulling F to HIGH.
If X = 1 and Y = 0, D2 is reverse biased, thus does not conduct. But D1 is forward
biased, thus conducts and thus pulling F to HIGH.
If X = 1 and Y = 1, then both diodes D1 and D2 are forward biased and thus both the
diodes conduct and thus F is HIGH.

AND-GATE:The AND gate is a basic digital logic gate that implements logical conjunction - it behaves
according to the truth table to the right. A HIGH output (1) results only if both the inputs to the
AND gate are HIGH (1). If neither or only one input to the AND gate is HIGH, a LOW output
results. In another sense, the function of AND effectively finds the minimum between two
binary digits, just as the OR function finds the maximum. Therefore, the output is always 0
except when all the inputs are 1.

The AND gate performs logical multiplication, commonly known as AND

function. The AND gate has two or more inputs and single output. The
output of AND gate is HIGH only when all its inputs are HIGH (i.e. even if
one input is LOW, Output will be LOW).

Symbol:Symbolically AND-GATE can be represented as:

AND Gate - Boolean Algebra Equation:-

The AND gate operation can also be expressed by Boolean Algebra equation.
For a 2-input AND gate , the equation is:
X = A. B
The symbol for an AND gate operation is a (.) It does not mean multiplication.

Truth Table:X
0
0
1
1
Circuit Diagram:-

Y
0
1
0
1

F=(X .Y)
0
0
0
1

Explanation:If X = 0 and Y = 0, then both diodes D1

and D2 are forward biased and thus both
diodes conduct and pulls F low.
If X = 0 and Y = 1, D2 is reverse biased,
thus does not conduct. But D1 is forward
biased, thus conducts and thus pulls F low.
If X = 1 and Y = 0, D1 is reverse biased, thus
does not conduct. But D2 is forward biased,
thus conducts and thus pulls F low.

If X = 1 and Y = 1 , then both diodes D1 and D2

are reverse biased and thus both the diodes
are in cut-off and thus there is no drop in
voltage at F. Thus F is HIGH.

If X = 0 and Y = 0, then both diodes D1 and D2 are forward biased and thus
both diodes conduct and pull F low.