Documente Academic
Documente Profesional
Documente Cultură
INTRODUCTION
Fundamental Mode:
In a fundamental mode, only one input is allowed to change at a time and the
inputs are considered to be levels, (0 or 1).
Pulse mode:
In the pulse mode, only one input is allowed to change at a time and the inputs are considered to pulse (false-true-false)
and the input pulses must be long enough to initiate a state change.
1
CS8351-DPSD / UNIT-IV
Transition Table:
Flow Table:
1. A flow table is similar to transition table (State table) except that the internal states are symbolized with letter
symbols rather than binary numbers.
2. This includes the output values of the circuit for each state table.
Analysis Procedure:
Problem:
1. Derive the transition table and primitive flow table for the fundamental mode asnchronous sequential circuit shown in
fig :
2
CS8351-DPSD / UNIT-IV
3
CS8351-DPSD / UNIT-IV
4
CS8351-DPSD / UNIT-IV
2. D
5
CS8351-DPSD / UNIT-IV
6
CS8351-DPSD / UNIT-IV
1. Pule mode circuits rely on input pulses rather than levels. They allow only one input variable to change at a
time.
2. This can be implemented by employing a basic flip-flop commonly referred to as an SR latch.
The SR latch is a digital circuit with two inputs S and R and two cross coupled NORgates or two cross coupled
NAND gates as shown in fig.
In order to analyze the cricuit by transition table method, redrawing the above circuit,
7
CS8351-DPSD / UNIT-IV
Transition table: From the transition table, writing truth table ,
S R Q Q’
1 0 1 0
0 0 1 0
0 1 0 1
0 0 0 1
1 1 0 0
From the truth table we can understand that, With SR=10, the output Y=Q=1 and the latch is said to be
in set state. Changing S to 0 leaves the circuit in the set state.With SR=01, the output Y=Q=0, and latch is said
to be reset. A change of R back to 0 leaves the circuit in the reset sate. The circuit exhibits some difficulty when
both S and R are qual to 1. In normal operation, S and R inputs are not applied ‘1’ simultaneously. This
candition can be expressed by the boolean function SR=0, which the state ANDing of S and R must always
result in a 0.
From this, we deduce SR’=S when SR=0. Therefore the excitiation function
or boolean function can be expressed as,
S R Q Q’
1 0 0 1
8
CS8351-DPSD / UNIT-IV
1 1 0 1
0 1 1 0
1 1 1 0
0 0 1 1
Note:
9
CS8351-DPSD / UNIT-IV
10
CS8351-DPSD / UNIT-IV
Race Conditions
Race condition:
● two or morebinary state variables will change value when one input variable changes
● Cannot predict state sequence if unequal delay is encountered
Non-critical race:
● The final stable state does not depend on the change order ofstate variables
Critical race:
● The change order of state variables will result in different stable states
● Should be avoided!!
11
CS8351-DPSD / UNIT-IV
Race-Free State Assignment
- Race can be avoided by properstate assignment:
� Direct the circuit throughintermediate unstable states witha unique state-variable change
�It is said to have a cycle
-Must ensure that a cycle willterminate with a stable state. Otherwise, the circuit willkeepgoing in unstable
states
Stability Check:
● Asynchronous sequential circuits may oscillate between unstable states due to the feedback
● It is Must to check for stability, to ensure proper operations
● The stability can be easily checked from the transition table
● If any column has no stable states, then it is unstable
Ex: when x1x2=11 in Fig. (b), Y and y are never the same
Y = x’1x2 + x2y’
12
CS8351-DPSD / UNIT-IV
Hazards:
[Hazard is an unwanted transient i.e., spike or glitch that occurs due to unequal path or unequal propagation
delays through a combinational circuit.]
● Hazards are unwanted switching transients that may appear at the output of a circuit because different paths
exhibit different propagation delays.
● Hazards occur in combinational circuits, where they may cause a temporary false-output value.
● When this condition occurs in asynchronous sequential circuits, it may result in a transition to a wrong stable
state.
● A glitch is an unwanted pulse at the output of a combinational logic circuit. A circuit with the possible for a
glitch is said to have a hazard
Types of Hazards:
1. Static Hazard:i).Static-1 hazard & ii).Static-0 hazard
2. Dynamic Hazard
3. Essential hazard
Static Hazard:
Incorrect output due to change in a single input variable, when the output is expected to remain in the same
state.
Two types of static hazard are: (i) Static-0 hazard (ii) Static-1 hazard
● Static-0 hazard: When the output is to remain at the value 0, the output momentarily changes to 1 before
settling on 0 is known as static-0 hazard.
[When the output may momentarily (temporarily) go to 1 when it should remain 0. This is
referred to as a static 0-hazard]
● Static-1 hazard: When the output is to remain at the value 1, the output momentarily changes to 0 before
settling on 1 is known as static-1 hazard.
[When the output may momentarily (temporarily) go to 0 when it should remain 1. This is
referred to as a static 1-hazard]
Dynamic Hazard:
13
CS8351-DPSD / UNIT-IV
1. Dynamic hazards occur when the output of a network is to change between its two logic states, but a
momentary false output signal occurs during the transient behavior.
2. Dynamic hazards often occur in larger logic circuits where there are different routes to the output (from
the input).
3. Dynamic hazards are more complex to resolve, but note that if all static hazards have been eliminated
from a circuit, then dynamic hazards cannot occur.
1 Momentary 1 output
1 time
1
0
0 time 0
Dynamic hazard Momentary ‘0’ output
Essential Hazard:
1. Essentialhazard is a type ofhazard that exists only in asynchronous sequential circuits with two
or more feedbacks.
2. An essential hazard is caused by unequal delays along two or more paths that originate from the same
input.
Cycle: A cycle occurs when an asynchronous machine makes a transition througha series of
unstable states. A cycle may exist that eventually reaches a stable state.
14
CS8351-DPSD / UNIT-IV
Solution: Fig. (a) shows the K-map with minimum covering of 1's of the function. The adjacent’1’s at minterm
locations (0, 4), (2, 6), (7, 15) and (10, 11)are not covered in the same sub-cube.Adding product terms to cover
these adjacent ‘1’ s results in a logic hazard-free function asshownin Fig. (b).
15
CS8351-DPSD / UNIT-IV
Example:
Implement the switching function f(x1, x2, x3)= x1x2+ x 2 x3by a static hazard free 2 AND-OR gate network.
16