Scribd
Upload
62 views

Digital Logic: Tutorial CPSC 401

Digital Logic - Logic circuits are built from logic gates that correspond to Boolean operations like AND, OR, and NOT. - Gates have inputs and outputs that can be represented using binary 1s and 0s in truth tables. - Circuits can be represented as Boolean expressions or by connecting logic gates in different configurations. - NAND and NOR gates are considered universal because any logic circuit can be built using only one of these gate types.

Uploaded by

Shikha Nayyar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
62 views

Digital Logic: Tutorial CPSC 401

Digital Logic - Logic circuits are built from logic gates that correspond to Boolean operations like AND, OR, and NOT. - Gates have inputs and outputs that can be represented using binary 1s and 0s in truth tables. - Circuits can be represented as Boolean expressions or by connecting logic gates in different configurations. - NAND and NOR gates are considered universal because any logic circuit can be built using only one of these gate types.

Uploaded by

Shikha Nayyar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

Digital Logic

Tutorial CPSC 401


Boolean Algebra to Logic Gates

• Logic circuits are built from components called


logic gates.
• The logic gates correspond to Boolean operations
+, *, ’.

OR AND NOT
+ * ’

• Binary operations have two inputs, unary has one


AND
A
Logic Gate: A*B Truth Table:
B
A B A*B
0 0 0
A B 0 1 0
Series Circuit: 1 0 0
1 1 1

A*B
OR

A
Logic Gate: A+B Truth Table:
B
A B A+B
A
0 0 0
0 1 1
Parallel Circuit: 1 0 1
B 1 1 1

A+B
NOT
Logic Gate: A A’ or A
(also called an inverter)

Truth Table:

a A
0 1
1 0
n-input Gates
• Because + and * are binary operations, they can be
cascaded together to OR or AND multiple inputs.

A A
B A+B+C B ABC
C

A A
B A+B+C B ABC
C C
n-bit Inputs
• For convenience, it is sometimes useful to think
of the logic gates processing n-bits at a time. This
really refers to n instances of the logic gate, not a
single logic date with n-inputs.
1101100101
?
0100110111

10001111 ?
00111100

110001 ?
Logic Circuits ≡ Boolean Expressions

• All logic circuits are equivalent to Boolean expressions and any boolean expression
can be rendered as a logic circuit.
• AND-OR logic circuits are equivalent to sum-of-products form.
• Consider the following circuits:

A
B abc
C
aBc
y

Ab
y=abc+aBc+Ab
Find Output ?

B Y

C
Find output ?

x
y
NAND and NOR Gates
• NAND and NOR gates can greatly simplify circuit diagrams. As we
will see, can you use these gates wherever you could use AND, OR,
and NOT.
A B AB
0 0 1
NAND 0 1 1
1 0 1
1 1 0

A B AB
NOR 0 0 1
0 1 0
1 0 0
1 1 0
XOR and XNOR Gates
• XOR is used to choose between two mutually exclusive
inputs. Unlike OR, XOR is true only when one input or
the other is true, not both. A B AB
0 0 0
XOR 0 1 1
1 0 1
1 1 0

A B A B
XNOR 0 0 1
0 1 0
1 0 0
1 1 1
Properties of NAND AND NOR
• NAND and NOR have special properties, but
neither satisfies the distributive or associative
laws.
NAND NOR
x1=X x0=X
x  0=1 x  1=0
x  x=X x  x=X
x  y=X+Y x  y=XY
X  Y=x+y X  Y=xy
not (x  y)=xy not (x  y)=x+y

It should be clear by looking at these properties that


NAND and NOR are duals.
NAND and NOR as Universal Logic Gates
• Any logic circuit
can be built using
only NAND gates,
or only NOR
gates. They are
the only logic gate
needed.
• Here are the
NAND
equivalents:
NAND and NOR as Universal Logic Gates (cont)

• Here are the NOR


equivalents:
• NAND and NOR
can be used to
reduce the
number of
required gates in
a circuit.
Example Problem
• A hall light is controlled by two light switches, one at
each end. Find (a) a truth function, (b) a Boolean
expression, and (c) a logic network that allows the
light to be switched on or off by either switch.
Let x and y be the switches:
x y f(x,y)
0 0 0
0 1 1
1 0 1 (What kind of
1 1 0 gate has this
truth table?
References
• Eck, David. The Most Complex Machine
• Gersting, Judith, Mathematical Structures for
Computer Science
Thank You !

You might also like