Scribd
Upload
66 views21 pages

Chapter 3 - Logic Gates v2

Uploaded by

dynzhaa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
66 views21 pages

Chapter 3 - Logic Gates v2

Uploaded by

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

ITT270 Digital

Electronics
Chapter 3 Logic Gates
Logic Gates

❑ The basic building block of any digital circuit are


logic gates.
❑ OR, AND and NOT gates are the most basic
gates.
❑ All other gates can be constructed using these
three gates. Four other gates are NOR, NAND,
XOR and XNOR gates.
Logic Gates

❑ A logic gate has at least one input and only one


output
❑ Logic gates operate with binary numbers. A
binary 0 will mean a Low voltage (+0 volt) and a
binary 1 will mean a High voltage (+5 volt).
❑ All possible input combinations for A and B and
the output Y can be shown using a truth table.
Logic Gates
OR Gate

❑ The output of an OR gate is 1 if any of the inputs


are 1.
❑ The parallel circuit shows the idea of an OR
gate. The output lamp Y will light when either or
both of the input switches are closed.
OR Gate
❑ The Boolean expression for an OR gate is
Y=A+B.
❑ Note that the plus (+) sign means OR in Boolean
algebra. It is read as A OR B equals Y.
❑ The OR gate operation can be expressed as
follows:
OR Gate
❑ A 3 input OR logic gate will have 23 = 8 input
combinations. The input variables are A, B and
C. Note that if any of the inputs are 1, the output
will be 1.
AND Gate
❑ The output of an AND gate is 1 if all of the inputs
are 1.
❑ The serial circuit shows the idea of an AND gate.
❑ The output lamp Y will light when both of the
input switches are closed.
AND Gate
❑ The Boolean expression for an AND gate is
Y=A•B. Note that the dot (•) sign means AND in
Boolean algebra.
❑ It is read as A AND B equals Y.
❑ The dot sign is generally omitted, so that the
expression becomes Y=AB.
❑ The AND gate operation can be expressed as
follows:
NOT Gate
❑ The NOT gate has only 1 input. It is also called
an inverter.
❑ The NOT gate produces an output that is the
opposite of the input.
❑ If the input is 0, the output is 1. If the input is 1,
the output is 0.
❑ Thus, the NOT gate inverts, or complement the
input.
❑ The Boolean expression is , read as ‘A
inverted’, ‘A bar’ or ‘A NOT’.
2.4 NOT Gate
NOR Gate
❑ NOR gate means ‘NOT OR’.
❑ It is actually an OR gate followed by an inverter.
❑ In other words, the output of an OR gate is
inverted to form a NOR gate.
❑ The NOR gate symbol is an OR gate with an
invert bubble at the output. The Boolean
expression is:
NAND Gate
❑ NAND gate means ‘NOT AND’. It is actually an
AND gate followed by an inverter.
❑ The output of an AND gate is inverted to form a
NAND gate. The NOR gate symbol is an AND
gate with an invert bubble at the output. The
Boolean expression is

NAND Gate Symbol


XOR Gate
❑ XOR gate is Exclusive-OR gate.
❑ The output is 1 if an odd number of 1s appear at
the inputs. The input 01 and 10 of the truth table
have odd numbers of 1s, and therefore the
output is 1. The Boolean expression is:
XNOR Gate
❑ XNOR gate is exclusive-NOR gate.
❑ The output of an XNOR gate is the complement
of the XOR gate. The Boolean expression for
XNOR gate is:
Combining logic gates
❑ Logic gates are combined to form a new logic
function.
❑ This logic circuit is also known as combinational
logic circuit.
❑ The output of the circuit is determined by the
Boolean expression (its current state of input).
Combining logic gates
Implementing a function from a Boolean expression
❑ Example:
❑ Implement the expression
Combinational logic gates
❑ Generating a Boolean expression from a logic
diagram
❑ Example:
Combinational logic gates
❑Example (continued)
❑ Work progressively from the inputs to the output
adding logic expressions to the output of each
gate in turn.
❑Implementing a logic function from a truth table
❑Example : Draw the truth table for the following
Boolean expression:

A B C Y
0 0 0 0 0 0 0
0 0 1 1 0 0 1
0 1 0 0 0 0 0
0 1 1 0 0 0 0
1 0 0 0 0 0 0
1 0 1 0 1 0 1
1 1 0 0 0 1 1
1 1 1 0 0 0 0
❑ Example (continued)
❑The logic function
can then be implemented as follows:

You might also like