LOGIC GATES

Introduction
 Computers can only process binary data which consists of 0’s and
1’s. This is due to the fact that the main processing components
(e.g., the CPU) are made of transistors: tiny electronic switches that
can be turned on (1) and off (0). Logic Gates
A collection of individual logic gates connects with each other
Different kinds of Transistors and produce a logic design known as a Logic Circuit.

Types of logic circuits:

 Decision making
 Memory
 A gate has two or more binary inputs and single output

Transistors as Switches
 VBB voltage controls whether the transistor conducts in a common
base configuration. Basic Logic Gates
Three basic gates:
 NOT
 AND
 OR
Each logic gate performs a different logic function. You can
derive logical function or any Boolean or logic expression by combining
these three gates.

 Logic circuits can be built. NOT Gate

 The simplest form of a digital logic circuit is the inverter or the
Benefits of transistors NOT gate.
 Provide signal amplification to ensure a fair output for the  It consists of one input and one output and the input can only be
application. binary numbers namely; 0 and 1.
 Regulate an incoming signal’s current and voltage.
 Smaller and lighter than vacuum tubes, while also being
mechanically stronger.
 Require no external heating for operation.
 A low-voltage supply is sufficient to operate a transistor.
 Highly suitable for low-power applications.
 Ideal for integrating with resistors and diodes to create integrated
AND Gate
circuits.
 The AND gate is a logic circuit that has two or more inputs and a
 As the size of transistors decreased exponentially, their cost has
single output.
fallen.
 The operation of the gate is such that the output of the gate is a
Logic Gates binary 1 if and only if all inputs are binary 1.
 A logic gate is a small electronic circuit made of one or two  Similarly, if any one or more inputs are binary 0, the output will be
transistors and used to process binary data. binary 0.
 Logic gates such as the AND gate, OR Gate, NOT Gate, XOR gate
and NAND gates are the key building blocks of any computer
system.

AND Gate

OR Gate
 The OR gate is another basic logic gate.
 Like the AND gate, it can have two or more inputs and a single
output.
 The operation of OR gate is such that the output is a binary 1 if any
one or all inputs are binary 1 and the output is binary 0only when all
the inputs are binary 0.

Applications of Logic Gates

Integrated Circuits  The following are some of the applications of Logic gates:
 An integrated circuit (also referred to as a chip, or a microchip) is a  Build complex systems that can be used to different fields
set of electronic circuits on one small flat piece (or “chip”) of such as
semiconductor material, normally silicon.  Genetic engineering,
 Nanotechnology,
 Industrial Fermentation,
  Metabolic engineering and
 Medicine
 Construct multiplexers, adders and multipliers.
 Perform several parallel logical operations.
 Used for a simple house alarm or fire alarm or in the circuit of
automated machine manufacturing industry.
 BOOLEAN ALGEBRA Identity Name AND Form OR Form
Commutative Law xy = yx x+y=y+x
 Derived from George Boole.
 Boolean algebra is a mathematical system for the manipulation of
variables that can have one of two values.
o In formal logic, these values are “true” and “false.”
o In digital systems, these values are “on” and “off,” 1 and 0, or
“high” and “low.”
 Boolean expressions are created by performing operations on Associative Law (xy) z = x (yz) (x + y) + z = x + (y + z)
Boolean variables.
o Common Boolean operations include AND, OR, and NOT.

AND
 In order for current to flow, both switches must be closed
 Logic notation A·B = C
(Sometimes AB = C)
Distributive Law x + yz = (x + y) (x + z) x (y + z) = xy + xz

OR Binary addition
 Current flows if either switch is closed. A B S C(arry)
 Logic notation A + B = C 0 0 0 0
1 0 1 0
0 1 1 0
1 1 0 1

Boolean Algebra
 Our last group of Boolean identities are perhaps the most useful.
 If you have studied set theory or formal logic, these laws are also
familiar to you.
Boolean Algebra Examples Identity name AND Form OR Form
 The truth table for the Boolean function: Absorption Law x (x + y) = x x + yz = x
F (x, y, z) = xz̄ + y DeMorgan’s Law (x̅ y̅ ) = x̅ + y̅ (x̅ + y̅ ) = x̅ y̅
 To make evaluation of the Boolean function easier, the truth table Double Complement Law (x̅ ) = x̅
contains extra (shaded) columns to hold evaluations of subparts of
the function. Boolean Algebra
 Sometimes it is more economical to build a circuit using the
F (x, y, z) = xz̄ + y
complement of a function (and complementing its result) than it is
x y z z̄ xz̄ xz̄ + y to implement the function directly.
0 0 0 1 0 0  DeMorgan’s law provides an easy way of finding the complement
0 0 1 0 0 0 of a Boolean function.
0 1 0 1 0 1  Recall DeMorgan’s law states:
0 1 1 0 0 1 (x̅ y̅ ) = x̅ + y̅ and (x̅ + y̅ ) = x̅ y̅
1 0 0 1 1 1
1 0 1 0 0 0 Digital Components
1 1 0 1 1 1  The main thing to remember is that combinations of gates
1 1 1 0 0 1 implement Boolean functions.
 The circuit below implements the Boolean function:
F (X, Y, Z) = X + Y̅ Z
Boolean Algebra
 Most Boolean identities have an AND (product) form as well as an
OR (sum) form. We give our identities using both forms. Our first
group is rather intuitive: X Y Z Y̅ Y̅ Z X + Y̅ Z
Identity Name AND Form OR Form 0 0 0 1 0 0
Identity Law 1x = x 0+x=x 0 0 1 1 1 1
Null Law 0x = 0 1+x=1 0 1 0 0 0 0
Idempotent Law xx = x x+x=x 0 1 1 0 0 0
Inverse Law xx̅ = 0 x + x̅ = 1 1 0 0 1 0 1
1 0 1 1 1 1
1 1 0 0 0 1
Boolean Algebra 1 1 1 0 0 1
 Our second group of Boolean identities should be familiar to you
from your study of algebra.
Inversion (NOT)
Logic: Q = A̅
A Q
0 1
1 0

EXERCISES ON LOGIC GATES

TRUE 1. Logic diagrams and truth tables are equally

powerful in expressing the processing of gates and circuits.

FALSE 2. A transistor is a small electronic circuit made of

one or more logic gates.

FALSE 3. A high-voltage supply is needed to operate a

transistor.

FALSE 4. Boolean expressions are more powerful than logic

diagrams in expressing the processing of gates and circuits.

FALSE 5. A NOT gate accepts two inputs

TRUE 6. The output value of an AND gate when both inputs

are 1 is 1.

FALSE 7. The AND & OR gates produce opposite results for

the same input.

TRUE 8. The output value of an OR gate when both inputs

are 1 is 1.

FALSE 9. The output of an OR gate when one input is 0 and

one input is 1 is 0.

FALSE 10. The output value of an XOR gate is 0 unless both

inputs are 1.

TRUE 11. A gate can be designed to accept more than two

inputs.

TRUE 12. A transistor is made of semiconductor material.

FALSE 13. The sum of two binary digits (ignoring the carry)
is expressed by an AND gate.

TRUE 14. Integrated circuits are classified by the number of

gates contained in them.

TRUE 15. A CPU is an integrated circuit.