Download presentation

Presentation is loading. Please wait.

Published byDylan Boyle Modified over 3 years ago

1
P.Rajasekar & C.M.T.Karthigeyan Asst.Professor SRM University, Kattankulathur 1

2
The contents of the slides are solely for the purpose of teaching students at SRM University. All copyrights and Trademarks of organizations/persons apply even if not specified explicitly. 2

3
3

4
Synchronous Sequential Logic Introduction to sequential circuits Types of sequential circuits Storage elements Latches Flip-flops Sequential circuit analysis State tables Design Procedure 4

5
A Sequential circuit contains: Storage elements: Latches or Flip-Flops Combinational Logic: Implements a multiple-output switching function Inputs are signals from the outside. Outputs are signals to the outside. Other inputs, State or Present State, are signals from storage elements. The remaining outputs, Next State are inputs to storage elements. Combina- tional Logic Storage Elements Inputs Outputs State Next State 5

6
Combinatorial Logic Next state function Next State = f(Inputs, State) Output function (Mealy) Outputs = g(Inputs, State) Output function (Moore) Outputs = h(State) Output function type depends on specification and affects the design significantly Combina- tional Logic Storage Elements Inputs Outputs State Next State 6

7
7 Depends on the times at which: storage elements observe their inputs, and storage elements change their state Synchronous Behavior defined from knowledge of its signals at discrete instances of time Storage elements observe inputs and can change state only in relation to a timing signal (clock pulses from a clock) Asynchronous Behavior defined from knowledge of inputs an any instant of time and the order in continuous time in which inputs change If clock just regarded as another input, all circuits are asynchronous! Nevertheless, the synchronous abstraction makes complex designs tractable!

8
Cross-Coupling two NAND gates gives the S -R Latch: Which has the time sequence behavior: S = 0, R = 0 is forbidden as input pattern Q S (set) R (reset) Q 1101Now Q remembers Both go high 11??Unstable! Time 8

9
Cross-coupling two NOR gates gives the S – R Latch: Which has the time sequence behavior: S (set) R (reset) Q Q 9

10
Adding two NAND gates to the basic S - R NAND latch gives the clocked S – R latch: Has a time sequence behavior similar to the basic S- R latch except that the S and R inputs are only observed when the line C is high. C means control or clock. S R Q C Q 10

11
The Clocked S-R Latch can be described by a table: The table describes what happens after the clock [at time (t+1)] based on: current inputs (S,R) and current state Q(t). S R Q Q C 11

12
Adding an inverter to the S-R Latch, gives the D Latch: Note that there are no indeterminate states! Q D Q(t+1) Comment No change Set Q Clear Q No Change C D Q Q D Q C Q 12

13
The latch timing problem Master-slave flip-flop Edge-triggered flip-flop Standard symbols for storage elements Direct inputs to flip-flops 13

14
In a sequential circuit the changes should take place with clock transitions and not with levels. 14

15
Consists of two clocked S-R latches in series with the clock on the second latch inverted The input is observed by the first latch with C = 1 The output is changed by the second latch with C = 0 The path from input to output is broken by the difference in clocking values (C = 1 and C = 0). The behavior demonstrated by the example with D driven by Y given previously is prevented since the clock must change from 1 to 0 before a change in Y based on D can occur. C S R Q Q C R Q Q C S R Q S Q 15

16
Use edge-triggering instead of master- slave An edge-triggered flip-flop ignores the pulse while it is at a constant level and triggers only during a transition of the clock signal Edge-triggered flip-flops can be built directly at the electronic circuit level, or A master-slave D flip-flop which also exhibits edge-triggered behavior can be used. 16

17
The edge-triggered D flip-flop is the same as the master- slave D flip-flop It can be formed by: Replacing the first clocked S-R latch with a clocked D latch or Adding a D input and inverter to a master-slave S-R flip-flop The change of the D flip-flop output is associated with the negative edge at the end of the pulse It is called a negative-edge triggered flip-flop C S R Q Q C Q Q C D Q D Q 17

18
The edge-triggered flip-flop consists of two latches: master and slave. 18

19
Other types of flip-flops may be constructed from D flip-flop. Two other types less commonly used are JK and T flip flops. 19

20
20

21
21

22
22

23
General Model Current State at time (t) is stored in an array of flip-flops. Next State at time (t+1) is a Boolean function of State and Inputs. Outputs at time (t) are a Boolean function of State(t) &(sometimes)Inputs (t). Combina- tional Logic Inputs State Next State Outputs Storage Elements CLK 23

24
Input:x(t) Output:y(t) State:((A(t), B(t)) What is the Output Function? What is the Next State Function? 24

25
State table – a multiple variable table with the following four sections: Present State – the values of the state variables for each allowed state. Input – the input combinations allowed. Next-state – the value of the state at time (t+1) based on the present state and the input. Output – the value of the output as a function of the present state and (sometimes) the input. From the viewpoint of a truth table: the inputs are Input, Present State and the outputs are Output, Next State 25

26
The state table can be filled in using the next state and output equations: A(t+1) = A(t)x(t) + B(t)x(t) B(t+1) = A (t)x(t) y(t) = x (t)(B(t) + A(t)) 26

27
2-dimensional table that matches well to a K- map. Present state rows and input columns in Gray code order. A(t+1) = A(t)x(t) + B(t)x(t) B(t+1) = A (t)x(t) y(t) = x (t)(B(t) + A(t)) 27

28
28

29
Determine flip-flop input equations in terms of present state and inputs. For each JKFF determine J=f(Q(t),x(t)) and K=g(Q(t),x(t)) Using the flip-flop characteristic table determine the next state values in the state table. Substitute equations for J and K into Q(t+1)=JQ+KQ to calculate the values of next-states 29

30
30

31
31

32
32

33
Input equations for D-FF is obtained directly from next state For JK and T FFs FF input equations cannot be obtained easily from state table. A table that lists the inputs for a given change of state is needed. It is called excitation table 33

34
34

35
35

36
36

37
37

38
A register capable of shifting the binary information held in each cell to its neighboring cell, is called a shift register. Serial input is shifted to right with each clock pulse.After four clock pulses serial input appears at the Serial output. 38

39
A digital system operates at serial mode: information transferred and manipulated one bit at a time. Serial transfers take place with the system clock. In the next clock contents of shift register A is transferred to shift register B. 39

40
40

41
41

42
Two binary numbers to be added are stored in two shift registers A and B. The shift registers are shifted right starting with least significant bit, the bits are added by the full adder and carry is stored in a D flip-flop. When the addition is completed the sum is in regiater A. Serial adder will require n clock pulses for adding n-bit numbers. A parallel adder can perform the n-bit addition in one clock pulse period. However a parallel adder will have n full adders. 42

43
Clear control Shift-right Shift left Parallel load Parallel output 43

44
A register that goes through a prescribed sequence of states upon application of input pulses is called a counter. A counter that follows binary number sequence is called a binary counter n-bit binary counter consists of n flip-flops and count from 0 to 2^n-1. 44

45
Two categories: ripple counters and synchronous counters In a ripple counter the clock input of flip- flops is connected to output of other flip flops Ripple counters do not have a common clock (not synchronous circuit) Synchronous counters have common clock connected to clock input of flip-flops 45

46
Chapter 6 - Fall 10 46

47
47

48
48

49
49

50
50

51
Chapter 6 - Fall 10 51

52
52

53
53

54
Charles H. Roth- Jr., Fundamentals of logic design, Thomson Asia,5th edition-2004 (CH1,CH2,CH3,CH4,CH5,CH6,CH7,CH9,CH11, CH12) M. Morris Mano, Digital Logic and Computer Design, Prentice Hall of India Floyd, Digital Fundamentals, Universal Book Stall, 3rd Edition,1986 Morris Mano, Digital Design, Prentice Hall of India, 2nd Edition 1991 Bigell & Donovan, Digital Electronics, Thomson Asia Pvt. Ltd., 4th Edition 54

55
1. State the difference between combinational circuits and sequential circuits? 2. What do you mean by Latches? 3. Give the difference between latches and flip flops? 4. Define Flipflops? 5. List the design procedures for designing a sequential circuit? 6. State the operation of S-R flipflop? 7. State the operation of T-fliflop? 8. State the features of clocked T flipflop? 55

56
9. Give the characteristics equation for S-R, T,J-K and D-flipflop? 10. What is a counter? 11. What is a buffer register? 12. List the types of shift register? 13. How do you convert JR flipflop into D flipflop? 14. How do you convert T flipflop into D- flipflop? 15. Give the counter applications? 56

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google