Time-Dependent Behaviour of Digital Circuits With Feedback: DOC112: Computer Hardware Lecture 06 Slide 1
Time-Dependent Behaviour of Digital Circuits With Feedback: DOC112: Computer Hardware Lecture 06 Slide 1
Slide 1
Slide 2
A Curious Circuit
What is the output of this circuit? If input A is logic 0, R is logic 1, [0, 1] input to a NAND gate produces logic 1 and R is logic 1 .. ok..
Slide 3
A Curious Circuit
Given that A=1 Boolean algebra tells us: R = (R.A)' = (R.1)' = R' Impossible! Now what????
DOC112: Computer Hardware Lecture 06 Slide 4
Engineering Approach
When a model (like the Boolean algebra model of a digital gate) breaks down, and its behaviour is unpredictable, we must go down one "physical description" level and examine how the actual physical device was constructed. This may help us to predict what will happen. So what were those models from the last lecture?
DOC112: Computer Hardware Lecture 06 Slide 5
Quasi-Physical Models
Variable Resistance
These are needed only to construct a logical model which can be used to analyse unusual behaviour in the laboratory.
DOC112: Computer Hardware Lecture 06 Slide 6
Slide 7
We no longer have a valid Boolean signal output when changing from 0 to 1 and back.
DOC112: Computer Hardware Lecture 06 Slide 8
Analogue Model
The variable resistance model is not digital but analogue. The variable resistor can be adjusted continuously. To interpret its behaviour as a digital circuit we need to introduce the concept of a noise margin.
Slide 9
Noise Margin
The noise margin gives us a definite threshold (1.7volts) above which we know that our signal represents a Boolean 1, and similarly a a definite threshold (0.5Volts) below which we know our signal represents Boolean 0. We aim to design our circuits so that they operate well away from the threshold, so normally we aim to make Boolean 1 around 3.5 Volts, and Boolean 0 around 0.3 Volts
Slide 10
Potential Dividers
For any input voltage, the variable resistance model acts like a potential divider. So:
Rt is made up of the transistor resistance (Rvar) and the input resistance of the next gate (Rload)
DOC112: Computer Hardware Lecture 06 Slide 11
Slide 12
Fan-Out
The fan-out of a gate is the number of different gate inputs to which it is connected. If a transistor is connected to n gates, the circuit becomes:
Slide 13
Fan-Out
Resistors in parallel combine according to the inverse law: 1/R = 1/R1 + 1/R2 + 1/R3 + . . . So if a gate output is connected to 10 gate inputs the load resistance becomes 1/10 of a single gate. The operating voltages become:
Slide 14
Problem Time!
Given that Rsource=1000 Ohms, estimate the value of Rt when the circuit will fail, ie when the output voltage corresponding to Boolean 1 will be below 1.7.
Given Rvar is 3000 Ohms for logic 1 and Rload for a single gate (fanout=1) is 10000 Ohms, estimate the fan-out that will cause a failure.
DOC112: Computer Hardware Lecture 06 Slide 15
Solution
The output voltage is calculated by a potential divider. Vout = 5Rt/(Rsource+Rt) = 1.7 (5-1.7)Rt = 1.7Rsource Rt = (1.7/3.3) Rsource ~ Rsource/2 Rt is approximately 500 Ohms
Slide 16
Solution 2
1/Rload + 1/Rvar = 1/Rt Rt=500 Ohms causes failure 1/Rload + 1/3000 = 1/500 Rload = 600 For a fan out of n, Rload = 10000/n Do n = 10000/600 ~ 17
Slide 17
Fan-Out
Another undesirable property of large fan-outs is that the time delay increases. This is because the load capacitor increases.
Time delay is directly proportional to the load capacitor. Capacitors in parallel add.
Slide 18
Vin Vin=(Vout)'
Vout
Slide 20
What this model says is that the output of this circuit will settle at an invalid digital value around 1.2 volts.
DOC112: Computer Hardware Lecture 06 Slide 21
Slide 22
Feedback Circuits
The curious circuit we have been studying seems pretty useless! However we have at least learned how to begin to analyse circuits with feedback. For the moment we will ignore all the problems caused by fan-out, and use the simpler switch and delay model for our analysis.
Slide 23
Transition Table
A R (now)
0 0 1 1 0 1 0 1
Transition Diagram
00 01 10 Stable
A R (next)
0 0 1 1 1 1 1 0
11
Bistable
Slide 25
A BS R (next) 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1 0 1 1 1 0 1 1 1 0 1 1 0 0 1 1 0 1 0 1 1 1 0 0 1 1 0 1 1 1 0 0 1 1 1 1 1 1 1 0 1 1 1 1 0 1 1 0 0
Stable
Slide 27
Slide 28
Conclusions
From the diagram we see the following:
Input Input Input Input