Sequential Logic and Clocked Circuits

Transcription

1 Sequential Logic and Clocked Circuits Clock or Timing Device Input Variables State or Memory Element Combinational Logic Elements From combinational logic, we move on to sequential logic. Sequential logic differs from combinational logic in several ways: Its outputs depend not only on logic inputs but also the internal state of the logic. Sequential logic output does not necessarily change when an input changes, but is synchronized to some triggering event. Sequential logic is often synchronized or triggered by a series of regular pulses on a serial input line, which is referred to as a clock. That is, the outputs normally change as a function of the timing element. Sequential logic may (usually will) have combinational parts. Output

2 2 The University of Texas at Dallas The Simple R-S Flip-Flop The simplest example of a sequential logic device is the R-S flip-flop (R-S FF). This is a non-clocked device that consisting of two cross-connected 2-input NAND gates (may also be made from other gates). Inputs are negative-true input logic (inputs are active at logic state 0). When = ; = 0, the R-S FF is set. Likewise, when = 0; =, the flip-flop is reset. and will always have opposite states. The R-S FF is bistable. That is, it is at rest in either of its two states ( set or reset ) until an input forces it to change. S R R-S Flip-Flop

3 The Simple R-S Flip-Flop (2) 3 If the R-S FF is in the set state, it will not go reset until the Reset line goes true (in this case, to 0). Likewise, when reset, it will not go set unless the Set line goes to 0. Note also that once set, if Set goes to 0 more than once, the FF simply stays set. Likewise, when reset, more Reset s do not affect the circuit; it remains reset. Note: The triggering signal of an input (Set or Reset) is always assumed to be momentary. That is, a Set or Reset signal is considered to last a VERY short time (in the case of real circuits, this is nanoseconds or less). Thus the R-S FF has an output that depends not only on the inputs but the current state. S R R-S Flip-Flop

4 R-S Flip-Flop Set Cycle 4 Assume the ff is reset ( = 0). Also, since the Set and Reset inputs are not active, both input are at. Thus Set =, Reset =, = 0; =. Then the cycle is:. Set goes active (Set 0). 2. Then must (output of a NAND = if any input = 0). 3. Then both inputs to bottom NAND are, and The other input to the upper NAND is now 0. Thus, when the Set signal goes S back high, remains at, since the other input is still 0. R R-S Flip-Flop 5. Likewise, since both inputs to the lower NAND are now, then the value of remains The reverse cycle (set-to-reset) occurs in the identical way, except that the change is initiated by reset going low.

5 RS FF Set Cycle Pictorially 5 = 0 =

6 The Simple Latch or R-S Flip-Flop (4) S 6 R R-S Flip-Flop The truth table for the R-S FF is relatively simple, as shown below: Inputs Current Outputs New Outputs S R or 0 0 or Same Same Same Same Same Same 0* 0* or 0 0 or * * * This is a race condition and not stable. The S-R input 0-0 is forbidden.

7 Forbidden RS FF Inputs S 7 R As noted on the truth table, 0-input to both R and S is forbidden. Note the race condition that is triggered by R=S=0: = = Then, so both other 2-NAND inputs are. If S and R go to simultaneously, then all 4 inputs of the two 2-input NAND gates are and both outputs go to 0(!) The result is a race to see which output gets to 0 first, getting one 2- NAND input to 0, and therefore forcing that NAND output to. The result of the race cannot be predicted. Thus R and S = 0 together is forbidden, since the output state is not stable.

8 Flip-Flops and Memory Many circuits in the modern computer are either based on or related to the R-S FF. If an RS FF has its output changed to or 0, the output stays in that state until the opposite input is triggered. Thus the RS flip-flop or latch has the property of remembering a one-bit binary number: It can be set to or 0. Thus, we can use flip-flops to store binary numbers in a computer. Groups of flip-flops that store large binary numbers are called registers. S R can be set to or 0. Thus the output can be said to remember one bit. 8

9 Simple Flip-Flops Either two-input ANDs or ORs with may be used to create a simple RS FF. However, either the inputs or the output must be inverted. The examples to the left show the possible RS FF s that can be constructed from 2-input gates. NAND OR, inverted inputs NOR AND, inverted inputs 9

10 Simple Flip-Flops (2) Even though any of these four constructs can operate as a FF, their inputs are slightly different, and the labeling of R and S varies. However, there is a foolproof method to analyze any 2-inputport, 2-output FF to determine its correct operation. NAND OR, inverted inputs NOR AND, inverted inputs 0

11 Analyzing Flip-Flop Operation There is a 00%, absolutely-guaranteed method to analyze ANY of the basic flip-flops and determine its correct operation. It is a 3-step method that can easily show you how a 2-gate flip-flop operates what inputs trigger it and how its states change. It depends on analyzing the flip-flop based on the fact that, from combinational logic theory, we know exactly how each of the four gate types shown earlier operates.

12 Analyzing Flip-Flop Operation (2) 2 Flip-flop analysis method:. Remember that is always the top output. is always the bottom output. 2. Three analysis steps: a) Assume a state for the output (either Set or Reset). b) Assume a quiescent state for the inputs (both will either be 0 or when not activated). c) When the quiescent state is validated, let one input be active and observe the result. NAND OR, inverted inputs NOR AND, inverted inputs

13 Analyzing Flip-Flop Operation (3) Let re-analyze our original NANDgate RS FF using the method:. First, we remember that and - NOT are as shown always on top. 2. Now we need to assume a state. The choice is irrelevant, but let s assume the FF is SET. 3. Thus the FF looks as shown in the second diagram, below. = = 0 3

14 4 Analyzing Flip-Flop Operation (4) Remember: at this point, we do not know what input is SET and which is RESET. 4. Now, lets assume a state for both inputs when quiescent (inactive). 5. Again, the choice doesn t matter, but lets assume both inputs are at logic 0. (second diagram). 6. Whoa! If we do that, then (remembering how a NAND works), both FF outputs must be (third diagram)! = = 0 = = 0 = =

15 Analyzing Flip-Flop Operation (5) 5 Analysis continued: 7. Since an RS FF is always SET or RESET, (both stable states), the inactive state for the inputs cannot be 0, as the RS FF state is not possible when the inputs are inactive. 8. Therefore the inputs must be logic in the inactive state (second diagram). 9. Checking, we see that with both inputs at logic, the RS FF output is stable, as we assumed. Had we assumed that the inputs were logic originally, we would have verified that level, as the outputs of the RS FF would have been proper. 0 0 = = = = 0

16 Analyzing Flip-Flop Operation (6) Analysis continued: 0. Having completed Step 2, we know that the flip-flop is stable, and that its inputs are logic when quiescent or inactive.. For the third step, we now let one of the inputs become active. Again, the choice is arbitrary, but lets let the bottom input 0 (second diagram). 2. We note immediately that any NAND gate with a 0 input has an output of. 3. Then the upper NAND has two -inputs. Thus its output 0 (third diagram). 0 0 = = = = = =

17 Analyzing Flip-Flop Operation (7) The RS FF has been RESET. Thus the bottom input must be RESET and the top SET (top diagram). Note that the lower NAND gate will NOT change its output, as the output is whether one or both inputs are 0. Also note that the RESET signal is a pulse. It will quickly end. But the FF stays RESET (bottom diagram). S R 0 S R = 0 = = 0 = 7

18 Analyzing Flip-Flop Operation (8) We have successfully analyzed the NAND-gate, RS FF. Its inputs are normally quiescent or inactive at logic. S = 0 They activate by going to logic 0. The upper input activates the SET condition. R = The lower input activates RESET. Since the inputs go to 0 (i.e., in the negative direction) to activate, we label them R and S (diagram). 8

19 Exercise This exercise can improve your understanding of RS flip-flops AND our analysis method. The circuit below is one of the RS flip-flops that we saw earlier. and are labeled. Complete the truth table and label R and S (including their polarity). Inputs 2 Current Outputs 0 0 or 0 0 or or 0 or 0 New Outputs 9

20 Clocked Circuits () Logic 20 Time Stream of Clock Pulses ( Square Wave or Pulse Train ) The majority of all sequential logic circuits are clocked logic circuits. Clocked circuits are circuits that are regulated by a clocking element, ( square wave ), which determines when state changes occur. In a clocked sequential circuit, in general, the circuit can only change states on a tick of the clock element. We refer to a circuit as a clocked circuit when sequential elements in the circuit change states in synchronization to a train of pulses. Such a pulse train is shown below. The clock pulses change regularly from 0 to and back. Logic 0

21 Clocked Circuits (2) The period T of a sequential logic clock is the distance between identical points on the pulse train, e.g., two rising edges or two falling edges. The clock has only two states: 0 and. The clock alternates between the states. The amount of time that the clock spends in each of the two states is called the duty cycle. The clock below has a 50/50 duty cycle; it spends equal time each period in the and 0 states. 2 T T 0

22 Clocked Circuits (3) The clock below does not have a 50/50 duty cycle. It stays in the state about 35% of the time, and in the 0 state about 65% of the time. Thus we say that the clock has a 35/65 duty cycle. In the same way, a clock can have a 70/30 cycle time (i.e., it stays in the state 70% of the time), and so forth. Note that the period T is defined in the same way as before. T T 0 22

23 Clocked Flip-Flops All ff s have the same basic configuration: Both true and false outputs ( and -not ). Set is when =. Triggered by set and reset inputs. The most useful ff s are not simple asynchronous (non-clocked) ff s, however, but synchronous ( clocked ) ff s. Clocked ff s are very similar to non-clocked ff s -- the main difference is that in addition to a set or reset input to cause the outputs to change, there must also be the presence of a clock signal in its true state (normally ). Thus clocked ff s do not change states, regardless of the set or reset inputs, until the clock ticks. 23

24 The Clocked R-S Flip-Flop Set+ Clock+ Reset+ S R Clocked R-S Flip-Flop 24 The simplest clocked ff is the clocked R-S FF, shown above (NAND version). In addition to the set and reset inputs, the clock input is present. Since when clock is low (0), neither set or reset input affect the circuit, we say that the clock gates the set or reset signal to the RS FF. In this case, the set or reset input must be high () to set or reset the ff when the clock goes true (0 ). Having set and reset at the same time is forbidden as for the RS FF; simultaneous set and reset true causes a race condition when clock is high.

25 Clocked R-S Flip-Flop Truth Table Set+ Clock+ S 25 Reset+ R Clocked R-S Flip-Flop Inputs Current Outputs New Outputs Clock S R 0 X X or 0 0 or Same Same 0 0 or 0 0 or Same Same Same Same Same Same * * or 0 0 or * * * This is a race condition and not stable, as for the non-clocked RS FF.

26 The D Flip-Flop The D FF is a bistable circuit with D only one input plus the clock. The S term D refers to data. Clock+ Since the D FF is limited to one R input, there is no chance that a D (R+) race condition will occur. Clocked D Flip-Flop The clocked D FF can be created simply by replacing the reset input with an inverted set input in the clocked RS FF. In this configuration, we can see that if the D input =, when the clock is high, the ff will go into the set state ( set input=, reset =0). When the D input = 0, then the ff goes into the reset state when clock goes high ( set input=0, reset =). When clock = 0, the ff is idle. There is no forbidden state here -- the D FF output is defined (see truth table, next page) for ALL inputs. (S+) 26

27 D Flip-Flop Truth Table D Clock+ D (S+) (R+) Clocked D Flip-Flop Inputs Current Outputs New Outputs Clock D 0 X or 0 or 0 Same Same S R Same Same Same Same

28 . Draw a representation of a duty cycle clock (pulse train). Exercise 2 2. What is the period of the clock shown, to the nearest nsec? What is the duty cycle (nearest %)? 3. Using the gates shown on the next page, make a clocked D FF. Label inputs and outputs. Time 8 nsec Time 5 nsec Period = 8 nsec; duty cycle 78/22 28

29 Exercise 2 (continued) 29

30 New Information uiz 30 This is also one of the four RS FF types we saw earlier. Determine the inputs in the same way the example was worked. Label the signals Set, Reset,, -not, and show the input polarities (indicating whether the signals are active high or low).

31 Clock Timing Diagrams Time 0 It is important when designing sequential circuits to understand the timing relationships between circuit elements. This is normally done by plotting the transitions -- the changes between logic and logic 0 -- of the elements of interest. All event timing is normally related to the clock. In any fundamental timing diagram, unless specifically instructed to do otherwise, always start with the clock (it goes best at the diagram bottom). Always assume a 50/50 clock, if duty cycle not specified. 3

32 Timing Diagrams (Continued) Output D Input Clock 0 To illustrate D FF timing by plotting the D FF output: Remember that a D FF output is normally triggered when clock =. Assume D FF is originally reset. Then on the rising edge of the clock, the D FF output goes to set (), when the D input is. On successive clock pulses, the D FF changes as D changes. Principle: Output of a simple D FF tracks D when the clock ticks! Note: The clock is shown above running continuously. In some cases, the clock may tick only some times. 32

33 Exercise 3 The incomplete timing diagram below shows the clock input as the basis for the diagram and a D FF input, but not the output. In this case, the clock does not run continuously, but on a sporadic basis. Based on the discussion so far, plot the timing of the output of the D FF (assume the D FF starts out in the reset condition). Note that you do not need to see the ff diagram itself to do the plot. 33 D Clock Time 0

34 Master-Slave, or Delay Flip-Flops It is often desirable to have a flip-flop whose output does not change immediately when its internal state is altered from set ( = ) to reset ( = 0), or vice-versa. This sort of ff is called a master-slave or delay ff. The idea behind the master-slave ff is to have a master (i.e., controlling) ff change states on one edge of a clock pulse (normally the leading edge) and have a second ff connected to the first change to the same state as the master on the trailing edge, or backside of a clock pulse. In this way, the internal state of the ff changes one-half clock cycle prior to the time in which the changed state appears on the circuit outputs. 34

35 The Master-Slave D Flip-Flop D Clock+ Master Slave D FF converted to master-slave type. The slave (basically a clocked RS FF) always mirrors the state of the master. The slave circuit changes state /2 cycle after the master. The device still operates as a D FF; no indeterminate state. 35

36 Timing of Master-Slave D Flip-Flop D Clock+ Master Slave Slave FF () 36 Master FF () D Clock 0

37 D Flip-Flop Symbols 37 Flip-flop detail is not usually shown in diagrams. One symbol for a D FF is shown to the right. There is no small circle on either input. Therefore, is the active state (when clock and D =, output will ). D FF s with asynchronous set and reset are also available. Circles on S and R inputs mean that set and reset are negative-true signals (active at level 0). -not output is also available. Set and reset have the same problems discussed before: If S = R = 0, output may be indeterminate. D C Simple D FF D C S R D FF With Asynchronous S/R

38 The J-K Master-Slave Flip-Flop It is often useful to have a FF that will not have indeterminate outputs when S and R inputs are both simultaneously. The J-K FF, shown above, fits those requirements. The J input corresponds to Set, while K corresponds to Reset. The J-K FF is designed so that the condition of J = K = does not result in an indeterminate output when clocked. There may still be asynchronous RS inputs with the usual cautions. However, the J-K inputs are not restricted. 38

39 Internals of the J-K Flip-Flop J OR K Clock+ J-K Master-Slave Flip Flop A master-slave J-K FF can be designed as shown above. The key states are J=K=, for either output state (set or reset). If = ( Set ) and J = K =, output of the OR = 0, so the ff will reset. Likewise, if = 0 ( Reset ) and J = K =, OR =, and the ff will be set. (For J= and K=0, or J=0 and K=) normal set or reset occurs.) Then for J = K =, when the clock ticks the opposite state. 39

40 JK Flip Flop Truth Table J 3 K 2 4 Clock+ 40 Inputs Outputs AND Outputs OR Outputs New Outputs J K Same Same Same Same Same Same Same Same

41 The Toggle Flip-Flop T J K Clock+ T Master-Slave Flip-Flop The T FF is like a JK FF with J and K tied together (K input inverted). Then if T =, and clock =, the ff toggles to the opposite state. If T = 0, the ff does not change state on the clock tick. The T FF is a master-slave ff; output changes on the back edge of the clock. Set T = permanently, and the T FF toggles on every clock pulse. Note tied to the K input and -not tied to the J input. This feedback, along with the connected J and K inputs, enables the T FF to work properly. 4

42 Toggle Flip Flop Truth Table T J 3 K 2 4 Clock+ Input T Outputs T Master-Slave Flip-Flop AND Outputs OR Outputs New Outputs Same Same Same Same

43 Master-Slave T FF as a Frequency Divider Clock (at frequency f) Reset f/2 f/4 f/8 All T FF s shown are masterslave. T FF #3 T FF #2 T FF # Clock 0 43

44 Timing (Continued) Clock Reset f/2 f/4 f/8 Pulse Out Clock frequency = f Suppose that we want to decode a state of the frequency divider circuit seen on the last slide. When the /8 and /4 and /2 outputs are high, we want to AND those signals with clock to get a decoded pulse to perform some operation (see diagram above). How do we show the timing on this sequential decoder? 44

45 Timing (Continued) Clock (f) f/2 2 f/4 3 f/8 Pulse Out Reset 45 T FF #3 T FF #2 T FF # Clock We know that the output of FF # clocks FF#2, and #2 clocks #3. On the first falling edge of the clock, FF # toggles. On the falling edge of the output of FF #, FF #2 toggles, etc. 0

46 Timing (Concluded) Clock (f) f/2 2 f/4 3 f/8 Pulse Out Reset Pulse T FF #3 T FF #2 46 T FF # Clock 0 On the timing diagram, we look for the time when the three s are high. We then diagram Pulse Out based on the AND of the 3 signals plus clock.

47 Flip Flop Summary We have devoted a good deal of time to the study of the latch, or flip-flop, because it is important in modern computer circuitry. The primary uses for latches are: D FF: ALU registers, input/output buffers, shift registers, fast memory. J-K FF: Control functions and status indicators. T FF: Frequency division and counter circuits. We will study more complex ff circuits next. 47