LOGIC GATES

Jhon Errol L. Borlagdan

Adrian C. Dela Torre
Ryan B. Militar
John Dale B. Advincula
Christian Paul Alim
David Daang

Digital Logic Gates

In electronics, a logic gate is an idealized or
physical device implementing a Boolean function;
that is, it performs a logical operation on one or
more logical inputs, and produces a single logical
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 using diodes
or transistors acting as electronic switches, but can
also be constructed using vacuum tubes,
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.

In the following examples, each logic gate

except the NOT gate has two inputs, A and B, which can
either be 1 (True) or 0 (False). The resulting output is a
single value of 1 if the result is true or 0 if the result is
false.

OR - True if either A or B are True

NOR - OR followed by NOT: True only if A and B
are both False
AND - True if A and B are both True
NAND - AND followed by NOT: False only if A
and B are both True
NOT - Inverts value: True if input is False; False
if input is True
XOR - True if either A or B are True, but False if
both are True
XNOR - XOR followed by NOT: True if A and B
are both True or both False

Logic Gate
Symbols
OR

Truth Table

INPUT

OUTPUT

A OR B

NOR

Truth

INPUT

OUTPUT

INPUT
A
B

OUTPUT
A OR B

A
B
0
0
INPUT
0
0
0
1
INPUT
A
B
0
1
1
0
A
B
01
0
1
1
10
10

A OR B
0
OUTPUT
0
1
OUTPUT
A OR
1 B
1
A OR
01 B
1
01
1
OUTPUT

INPUT

OUTPUT

01
10
INPUT

A NOR B

1
A

01
B

1
A OR B

1
0

1
0

1
0

Table

AND
Table

Truth

INPUT

OUTPUT

A OR B

INPUT OUTPUT

A AND B

NAND

Truth Table

INPUT

OUTPUT

A NAND B

INPUT OUTPUT
A

NOT A

NOT
Truth Table

XOR

Truth Table

INPUT

OUTPUT

A XOR B

XNOR

Truth Table

INPUT

OUTPUT

A XNOR B

Combinational Logic
In digital circuit theory, combinational logic
(sometimes also referred to as time-independent logic) is
a type of digital logic which is implemented by Boolean
circuits, where the output is a pure function of the
present input only. This is in contrast to sequential logic,
in which the output depends not only on the present
input but also on the history of the input. In other words,
sequential logic has memory while combinational logic
does not.
Combinational logic is used in computer circuits to
perform Boolean algebra on input signals and on stored
data. Practical computer circuits normally contain a
mixture of combinational and sequential logic. For
example, the part of an arithmetic logic unit, or ALU, that
does mathematical calculations is constructed using
combinational logic. Other circuits used in computers,
such as half adders, full adders, half subtractors, full
subtractors, multiplexers, demultiplexers, encoders and
decoders are also made by using combinational logic.