Scribd
Upload
13 views

Tracing Logic Circuits

The document discusses truth tables and how to create them to summarize the logic of circuits. It provides examples of completing truth tables by evaluating logic expressions at each stage. Truth tables show all possible combinations of inputs and the corresponding outputs of a circuit. They are used to check the logic of a circuit design.

Uploaded by

festivesins14
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
13 views

Tracing Logic Circuits

The document discusses truth tables and how to create them to summarize the logic of circuits. It provides examples of completing truth tables by evaluating logic expressions at each stage. Truth tables show all possible combinations of inputs and the corresponding outputs of a circuit. They are used to check the logic of a circuit design.

Uploaded by

festivesins14
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/ 31

Truth tables and tracing logic

circuits
Do Now
The expressions below are not
matched to the correct symbol.
Draw the symbol, label with the
name and match to the correct
expression.

What value will the values be for C,D and Q given the inputs shown below.

Inputs Outputs
A B C D Q
0 0
0 1
1 0
1 1
The Exclusive Nor gate shown here is beyond the syllabus – were you able to infer its
purpose?
Inputs Outputs
A B C D Q
0 0 1 0 0
0 1 1 1 1
1 0 1 1 1
1 1 0 0 1
Truth Tables
A truth table is a way of
summarising and checking the logic
of a circuit. The table shows all
possible combinations of inputs and,
for each combination, the output
that the circuit will produce.
Creating Truth Tables

How many inputs does this logic circuit


have?

How many possible combinations are


there with 4 inputs?

2^ 4 = 16 combinations.

We will need a truth table with 16 rows


(and additional rows for headings)
Creating Truth Tables
INPUTS
What issues might we face attempting to complete the truth table below, ensuring we
complete all possible inputs and that we accurately evaluate the output at Q for every
X0 X1 X2 X3 Q
combination of inputs?
Creating Truth Tables
INPUTS OUTPUTS Complete the truth table for the logic circuit shown below.
• For the inputs, start at 0 (0000) and count up in binary until you reach
X0 X1 X2 X3 A B C D E Q 1111.
• Label the intermediate steps and evaluate.
Creating Truth Tables
INPUTS OUTPUTS Complete the truth table for the logic circuit shown below.
• For the inputs, start at 0 (0000) and count up in binary until you reach
X0 X1 X2 X3 A B C D E Q 1111.
0 0 0 0 • Label the intermediate steps and evaluate.
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0
0 1 0 1
0 1 1 0
0 1 1 1
1 0 0 0
1 0 0 1
1 0 1 0
1 0 1 1
1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 1
Creating Truth Tables
INPUTS OUTPUTS What is the expression at A?
__
x2

X0 X1 X2 X3 A B C D E Q
0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0
0 1 0 1
0 1 1 0
0 1 1 1
1 0 0 0
1 0 0 1
1 0 1 0
1 0 1 1
1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 1
Creating Truth Tables
INPUTS OUTPUTS What else can be evaluated at this stage?
__
x2

X0 X1 X2 X3 A B C D E Q
0 0 0 0 1
0 0 0 1 1
0 0 1 0 0
0 0 1 1 0
0 1 0 0 1
0 1 0 1 1
0 1 1 0 0
0 1 1 1 0
1 0 0 0 1
1 0 0 1 1
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 1
1 1 1 0 0
1 1 1 1 0
Creating Truth Tables
INPUTS OUTPUTS What is the expression at C?
__ ____
x2 X0.X1

X0 X1 X2 X3 A B C D E Q
0 0 0 0 1
0 0 0 1 1
0 0 1 0 0
0 0 1 1 0
0 1 0 0 1
0 1 0 1 1
0 1 1 0 0
0 1 1 1 0
1 0 0 0 1
1 0 0 1 1
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 1
1 1 1 0 0
1 1 1 1 0
Creating Truth Tables
INPUTS OUTPUTS C has been evaluated.
__
x2
____
X0.X1 What else can we evaluate at this stage?
X0 X1 X2 X3 A B C D E Q
0 0 0 0 1 1
0 0 0 1 1 1
0 0 1 0 0 1
0 0 1 1 0 1
0 1 0 0 1 1
0 1 0 1 1 1
0 1 1 0 0 1
0 1 1 1 0 1
1 0 0 0 1 1
1 0 0 1 1 1
1 0 1 0 0 1
1 0 1 1 0 1
1 1 0 0 1 0
1 1 0 1 1 0
1 1 1 0 0 0
1 1 1 1 0 0
Creating Truth Tables
INPUTS OUTPUTS What is the expression at B?
__ _ ____
x2 A.X1 X0.X1

X0 X1 X2 X3 A B C D E Q
0 0 0 0 1 1
0 0 0 1 1 1
0 0 1 0 0 1
0 0 1 1 0 1
0 1 0 0 1 1
0 1 0 1 1 1
0 1 1 0 0 1
0 1 1 1 0 1
1 0 0 0 1 1
1 0 0 1 1 1
1 0 1 0 0 1
1 0 1 1 0 1
1 1 0 0 1 0
1 1 0 1 1 0
1 1 1 0 0 0
1 1 1 1 0 0
Creating Truth Tables
INPUTS OUTPUTS B is now evaluated.
__
x2
_
A.X1
____
X0.X1 What can we evaluate now?
X0 X1 X2 X3 A B C D E Q
0 0 0 0 1 0 1
0 0 0 1 1 0 1
0 0 1 0 0 0 1
0 0 1 1 0 0 1
0 1 0 0 1 0 1
0 1 0 1 1 0 1
0 1 1 0 0 1 1
0 1 1 1 0 1 1
1 0 0 0 1 0 1
1 0 0 1 1 0 1
1 0 1 0 0 0 1
1 0 1 1 0 0 1
1 1 0 0 1 0 0
1 1 0 1 1 0 0
1 1 1 0 0 1 0
1 1 1 1 0 1 0
Creating Truth Tables
INPUTS OUTPUTS What is the expression at D?
__ _ ____
x2 A.X1 X0.X1 c.X2

X0 X1 X2 X3 A B C D E Q
0 0 0 0 1 0 1
0 0 0 1 1 0 1
0 0 1 0 0 0 1
0 0 1 1 0 0 1
0 1 0 0 1 0 1
0 1 0 1 1 0 1
0 1 1 0 0 1 1
0 1 1 1 0 1 1
1 0 0 0 1 0 1
1 0 0 1 1 0 1
1 0 1 0 0 0 1
1 0 1 1 0 0 1
1 1 0 0 1 0 0
1 1 0 1 1 0 0
1 1 1 0 0 1 0
1 1 1 1 0 1 0
Creating Truth Tables
INPUTS OUTPUTS D has been evaluated.
__
x2
_
A.X1
____
X0.X1 c.X2 Now what?
X0 X1 X2 X3 A B C D E Q
0 0 0 0 1 0 1 0
0 0 0 1 1 0 1 0
0 0 1 0 0 0 1 0
0 0 1 1 0 0 1 1
0 1 0 0 1 0 1 0
0 1 0 1 1 0 1 0
0 1 1 0 0 1 1 1
0 1 1 1 0 1 1 1
1 0 0 0 1 0 1 0
1 0 0 1 1 0 1 0
1 0 1 0 0 0 1 1
1 0 1 1 0 0 1 1
1 1 0 0 1 0 0 0
1 1 0 1 1 0 0 0
1 1 1 0 0 1 0 0
1 1 1 1 0 1 0 0
Creating Truth Tables
INPUTS OUTPUTS What is the expression at E?
__ _ ____
X2 A.X1 X0.X1 C.X2 B+D

X0 X1 X2 X3 A B C D E Q
0 0 0 0 1 0 1 0
0 0 0 1 1 0 1 0
0 0 1 0 0 0 1 0
0 0 1 1 0 0 1 1
0 1 0 0 1 0 1 0
0 1 0 1 1 0 1 0
0 1 1 0 0 1 1 1
0 1 1 1 0 1 1 1
1 0 0 0 1 0 1 0
1 0 0 1 1 0 1 0
1 0 1 0 0 0 1 1
1 0 1 1 0 0 1 1
1 1 0 0 1 0 0 0
1 1 0 1 1 0 0 0
1 1 1 0 0 1 0 0
1 1 1 1 0 1 0 0
Creating Truth Tables
INPUTS OUTPUTS And finally …
__ _ ____
X2 A.X1 X0.X1 c.X2 B+D

X0 X1 X2 X3 A B C D E Q
0 0 0 0 1 0 1 0 0
0 0 0 1 1 0 1 0 0
0 0 1 0 0 0 1 0 0
0 0 1 1 0 0 1 1 1
0 1 0 0 1 0 1 0 0
0 1 0 1 1 0 1 0 0
0 1 1 0 0 1 1 1 1
0 1 1 1 0 1 1 1 1
1 0 0 0 1 0 1 0 0
1 0 0 1 1 0 1 0 0
1 0 1 0 0 0 1 1 1
1 0 1 1 0 0 1 1 1
1 1 0 0 1 0 0 0 0
1 1 0 1 1 0 0 0 0
1 1 1 0 0 1 0 0 1
1 1 1 1 0 1 0 0 1
Creating Truth Tables
INPUTS OUTPUTS What is the expression at Q?
__ _ ____
X2 A.X1 X0.X1 c.X2 B+D X3+E

X0 X1 X2 X3 A B C D E Q
0 0 0 0 1 0 1 0 0
0 0 0 1 1 0 1 0 0
0 0 1 0 0 0 1 0 0
0 0 1 1 0 0 1 1 1
0 1 0 0 1 0 1 0 0
0 1 0 1 1 0 1 0 0
0 1 1 0 0 1 1 1 1
0 1 1 1 0 1 1 1 1
1 0 0 0 1 0 1 0 0
1 0 0 1 1 0 1 0 0
1 0 1 0 0 0 1 1 1
1 0 1 1 0 0 1 1 1
1 1 0 0 1 0 0 0 0
1 1 0 1 1 0 0 0 0
1 1 1 0 0 1 0 0 1
1 1 1 1 0 1 0 0 1
Creating Truth Tables
INPUTS OUTPUTS
__ _ ____
X2 A.X1 X0.X1 c.X2 B+D X3+E

X0 X1 X2 X3 A B C D E Q
0 0 0 0 1 0 1 0 0 0
0 0 0 1 1 0 1 0 0 1
0 0 1 0 0 0 1 0 0 0
0 0 1 1 0 0 1 1 1 1
0 1 0 0 1 0 1 0 0 0
0 1 0 1 1 0 1 0 0 1
0 1 1 0 0 1 1 1 1 1
0 1 1 1 0 1 1 1 1 1
1 0 0 0 1 0 1 0 0 0
1 0 0 1 1 0 1 0 0 1
1 0 1 0 0 0 1 1 1 1
1 0 1 1 0 0 1 1 1 1
1 1 0 0 1 0 0 0 0 0
1 1 0 1 1 0 0 0 0 1
1 1 1 0 0 1 0 0 1 1
1 1 1 1 0 1 0 0 1 1
Creating Truth Tables
INPUTS OUTPUTS What is the logical expression for this circuit?
__ _ ____
X2 A.X1 X0.X1 c.X2 B+D X3+E

X0 X1 X2 X3 A B C D E Q
____ __
0 0 0 0 1 0 1 0 0 0 Q = (((X0.X1).X2)+(X1.X2))+X3
0 0 0 1 1 0 1 0 0 1
0 0 1 0 0 0 1 0 0 0
0 0 1 1 0 0 1 1 1 1
0 1 0 0 1 0 1 0 0 0
0 1 0 1 1 0 1 0 0 1
0 1 1 0 0 1 1 1 1 1
0 1 1 1 0 1 1 1 1 1
1 0 0 0 1 0 1 0 0 0
1 0 0 1 1 0 1 0 0 1
1 0 1 0 0 0 1 1 1 1
1 0 1 1 0 0 1 1 1 1
1 1 0 0 1 0 0 0 0 0
1 1 0 1 1 0 0 0 0 1
1 1 1 0 0 1 0 0 1 1
1 1 1 1 0 1 0 0 1 1
Why do we need to do this…?
…consider this … 0 0 0 0 0 0 0 0

+ 0 0 + 0 1 + 1 0 + 1 1

Why is binary addition so = = = =

important?
0 1 0 1 0 1 0 1
Carry out these binary
+ 0 0 + 0 1 + 1 0 + 1 1
additions.
= = = =

1 0 1 0 1 0 1 0

+ 0 0 + 0 1 + 1 0 + 1 1
= = = =

1 1 1 1 1 1 1 1

+ 0 0 + 0 1 + 1 0 + 1 1
= = = =
Why do we need to do this…?
…consider this … 0 0 0 0 0 0 0 0

+ 0 0 + 0 1 + 1 0 + 1 1
= = = =
0 0 0 1 1 0 1 1
How is the ALU able to
process these calculations?
0 1 0 1 0 1 0 1

+ 0 0 + 0 1 + 1 0 + 1 1
= = = =
0 1 1 0 1 1 1 0 0

1 0 1 0 1 0 1 0

+ 0 0 + 0 1 + 1 0 + 1 1
= = = =
1 0 1 1 1 0 0 1 0 1

1 1 1 1 1 1 1 1

+ 0 0 + 0 1 + 1 0 + 1 1
= = = =
1 1 1 1 0 1 0 1 1 1 1
Why do we need to do this…?
A
…consider this …
B C D Q1 Q2 Carry
0 0 0 0 0 0 0 0

0 0 0 0 + 0 0 + 0 1 + 1 0 + 1 1
0 0 0 1 = = = =
0 0 0 1 1 0 1 1
0 0 1 0
0 0 1 1
0 1 0 0 0 1 0 1 0 1 0 1
0 1 0 1 + + + +
0 0 0 1 1 0 1 1
0 1 1 0
= = = =
0 1 1 1 0 1 1 0 1 1 1 0 0
1 0 0 0
1 0 0 1
1 0 1 0 1 0 1 0
1 0 1 0
1 0 1 1 + 0 0 + 0 1 + 1 0 + 1 1
1 1 0 0 = = = =
1 0 1 1 1 0 0 1 0 1
1 1 0 1
1 1 1 0
1 1 1 1 1 1 1 1
1 1 1 1
+ 0 0 + 0 1 + 1 0 + 1 1
= = = =
1 1 1 1 0 1 0 1 1 1 1

There is a logic circuit to carry


them out!
Why do we need to do this…?
A
…consider this …
B C D Carry Q1 Q2
0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 + 0 0 + 0 1 + 1 0 + 1 1
0 0 0 1 0 0 1 = = = =
0 0 0 0 0 1 0 1 0 0 1 1
0 0 1 0 0 1 0
0 0 1 1 0 1 1
0 1 0 0 0 0 1 0 1 0 1 0 1 0 1
0 1 0 1 0 1 0 + + + +
0 0 0 1 1 0 1 1
0 1 1 0 0 1 1
= = = =
0 1 1 1 1 0 0 0 0 1 0 1 0 0 1 1 1 0 0
1 0 0 0 0 1 0
1 0 0 1 0 1 1
1 0 1 0 1 0 1 0
1 0 1 0 1 0 0
1 0 1 1 1 0 1 + 0 0 + 0 1 + 1 0 + 1 1
1 1 0 0 0 1 1 = = = =
0 1 0 0 1 1 1 0 0 1 0 1
1 1 0 1 1 1 0
1 1 1 0 1 0 1
1 1 1 1 1 1 1 1
1 1 1 1 1 1 1
+ 0 0 + 0 1 + 1 0 + 1 1
= = = =
0 1 1 1 1 0 1 0 1 1 1 1

We will study this circuit in


due course.
Complete page 2 of your
worksheet.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy