Professional Documents
Culture Documents
Chapter
Chapt. 4 &5
ECEG122 [Ch-3] Microprocessor and Digital Logic
Content
• Synchronous and Asynchronous Operation
• S-R,J-K,T and D Flip Flops
• State Minimization
• Analysis of Synchronous and Asynchrony Sequential
Circuit
• Design using PLA and PAL
• ADC and DAC Circuit
• DRAWBACKS:
Asynchronous sequential circuits are more difficult to design.
Though they have a faster performance, their output is
uncertain
• If 0 is the input to the inverter at an instance, this 0 will propagate and the output is
1. This 1 is fed back as input. This 1 will propagate and the output is 0. The process
repeats and the result is a continuous oscillation of output between 0 and 1. There is
no stable state in this scenario.
• Now consider the following example of two inverters connected as shown
• R = 1 and S = 0
Gate 1 output in ‘always 0’ condition, Q=0
Gate 2 in ‘complement’ condition, so Q=0
• This is the (R)eset condition
• S = 0 and R to 0
Gate 2 remains in ‘complement’ condition, Q = 1
Gate 1 into ‘complement’ condition, Q = 0
• This is the hold condition
• S = 1 and R = 0
Gate 1 into ‘complement’ condition, Q =1
Gate 2 in ‘always 0’ condition, Q = 0
• S = 1 and R = 1
Gate 1 in ‘always 0’ condition, Q = 0
Gate 2 in ‘always 0’ condition, Q = 0
• • This is the illegal condition
0 S’ S’ R’ Q Q’
Q 1
0 0
0 1 1 0 Set
Q’ 0
1 0
1 R’ 1 1
X Y NAND
00 1
01 1
10 1
11 0
ECEG122 [Ch-3] Microprocessor and Digital Logic
2024.01.01 Sequential Circuits PJF - 27
SR Latch (NAND version)
1 S’ S’ R’ Q Q’
Q 1
0 0
0 1 1 0 Set
Q’ 0
1 0
1 R’ 1 1 1 0 Hold
X Y NAND
00 1
01 1
10 1
11 0
ECEG122 [Ch-3] Microprocessor and Digital Logic
2024.01.01 Sequential Circuits PJF - 28
SR Latch (NAND version)
1 S’ S’ R’ Q Q’
Q 0
0 0
0 1 1 0 Set
1 0 0 1 Reset
Q’ 1
0 R’ 1 1 1 0 Hold
X Y NAND
00 1
01 1
10 1
11 0
ECEG122 [Ch-3] Microprocessor and Digital Logic
2024.01.01 Sequential Circuits PJF - 29
SR Latch (NAND version)
1 S’ S’ R’ Q Q’
Q 0
0 0
0 1 1 0 Set
1 0 0 1 Reset
Q’ 1
1 R’ 1 1 1 0 Hold
0 1 Hold
X Y NAND
00 1
01 1
10 1
11 0
ECEG122 [Ch-3] Microprocessor and Digital Logic
2024.01.01 Sequential Circuits PJF - 30
SR Latch (NAND version)
0 S’ S’ R’ Q Q’
Q 1
0 0 1 1 Disallowed
0 1 1 0 Set
1 0 0 1 Reset
Q’ 1
0 R’ 1 1 1 0 Hold
0 1 Hold
X Y NAND
00 1
01 1
10 1
11 0
ECEG122 [Ch-3] Microprocessor and Digital Logic
2024.01.01 Sequential Circuits PJF - 31
Relation between NAND and time diagram
• If both S' and R' are asserted, then both Q and Q' are equal
to 1 as shown at time t4. If one of the input signals is de-
asserted earlier than the other, the latch will end up in the
state forced by the signal that was de-asserted later as
shown at time t5. At t5, R' is de-asserted first, so the latch
goes into the normal set state with Q = 1 and Q' = 0.
• A problem exists if both S' and R' are de-asserted at
exactly the same time as shown at time t6. If both gates
have exactly the same delay then they will both output a 0
at exactly the same time. Feeding the zeros back to the
gate input will produce a 1,
• again at exactly the same time, which again will produce a
0, and so on and on. This oscillating behavior, called the
critical race, will continue forever. If the two gates do not
have exactly the same
• delay then the situation is similar to de-asserting one input
before the other, and so the latch will go into one state or
the other. However, since we do not know which is the
faster gate, therefore, we do not know which state the
latch will go into. Thus, the latch’s next state is
undefined.
Example: Generally, we come across many counters in our daily life to count the
number of objects .For example to count the number of audience entering or
leaving an auditorium or to count number of vehicles in parking. In this when
any person enters in to auditorium the counter increments its value depending
on its present value. Similarly, it decrements its value depending on its previous
and present value. So Counter retains the present state of the counter to do next
operation.
Programmed by
selectively removing
connections in the AND
and OR planes –
controlled by fuses or
memory bits
a) XOR or XNOR gates b) NOR or NAND gates c) AND or OR gates d) AND or NOR gates
Answer B
2. For a D flip-flop, the next state is always equal to the D input . a) True b)
False Answer A
3. Which flip flop cannot accept two logic 1's on the inputs?
a) D Type b) T Type c) JK Type d) SR Type
Answer D
4. The JK flip-flop is in its set mode when input J = -------.and input K = ------.
a) J = 0 and K = 0 b) J = 0 and K = 1 c) J = 1 and K = 0 d) J = 1 and K = 1
Answer C
5.