Logic Design II (17.342) Spring Lecture Outline

Size: px
Start display at page:

Download "Logic Design II (17.342) Spring Lecture Outline"

Transcription

1 Logic Design II (17.342) Spring 2012 Lecture Outline Class # 05 February 23, 2012 Dohn Bowden 1

2 Today s Lecture Analysis of Clocked Sequential Circuits Chapter 13 2

3 Course Admin 3

4 Administrative Admin for tonight Syllabus review Lab #1 is due TONIGHT February 23 rd Exam # 1 NEXT WEEK March 1 st Covers Chapters 11 and 12» Intro to sequential circuits» Latches and flip-flops» Registers and Counters Open book/open notes exam 4

5 Syllabus Review Week Date Topics Chapter Lab Report Due 1 01/26/12 Review of combinational circuits /02/12 Intro to sequential circuits. Latches and flip-flops /09/12 Registers and Counters /16/12 Registers and Counters continued /23/12 Analysis of Clocked Sequential Circuits /01/12 Examination /08/12 Derivation of State Graphs and Tables 14 X 03/15/12 NO CLASSES Spring Break 8 03/22/12 Reduction of State Tables State Assignments /29/12 Sequential Circuit Design /05/12 Circuits for Arithmetic Operations /12/12 Examination /19/12 State Machine Design with SM Charts /26/12 Course Project Build/Troubleshoot in Lab Project /03/12 Final Exam/Course Project Brief & Demo Demo 5

6 Questions? 6

7 Chapter 13 ANALYSIS OF CLOCKED SEQUENTIAL CIRCUITS 7

8 Objectives 8

9 Objectives 1. Analyze a sequential circuit by signal tracing 2. Given a sequential circuit write the next-state equations for the flip-flops and derive the state graph or state table Using the state graph determine the state sequence and output sequence for a given input sequence 3. Explain the difference between a Mealy machine and a Moore machine 4. Given a state table construct the corresponding state graph and conversely 9

10 Objectives 5. Given a sequential circuit or a state table and an input sequence Draw a timing chart for the circuit Determine the output sequence from the timing chart neglecting any false outputs 6. Draw a general model for a clocked Mealy or Moore sequential circuit Explain the operation of the circuit in terms of these models Explain why a clock is needed to ensure proper operation of the circuit 10

11 Analysis of Clocked Sequential Circuits 11

12 Analysis of Clocked Sequential Circuits Counter designs thus far were Fixed sequence of states No inputs other than a clock pulse that causes the state to change Will now consider sequential circuits that have additional inputs Circuit outputs and flip-flop states will now depend on the input sequence which is applied to the circuit 12

13 Analysis of Clocked Sequential Circuits Flip-flop state and output sequence can be determined by Signal tracing (small circuits) Construction of state graph or state table The output and state sequences can be determine Also they are useful for the design of sequential circuits 13

14 A Sequential Parity Checker 14

15 A Sequential Parity Checker Parity bit An extra bit added for purposes of error detection when binary data is transmitted or stored Odd parity the total number of 1 bits in the block including the parity bit is odd 15

16 Example 16

17 A Sequential Parity Checker Example if data is being transmitted in groups of 7 bits an eighth bit can be added to each group of 7 bits to make the total number of 1 s in each block of 8 bits an odd number 17

18 Design a Parity Checker Circuit 18

19 Design a Parity Checker Circuit Design a parity checker such that Serial data input Clock input Output of the circuit should be Z = 1 if the total number of 1 inputs received is odd Z = 0 indicates that an error in transmission has occurred 19

20 Design a Parity Checker Circuit Design a parity checker Block diagram 20

21 Design a Parity Checker Circuit Design a parity checker X is read at the time of the active clock edge X input must be synchronized with the clock so that it assumes its next value before the next active clock edge Clock required to distinguish consecutive 0's or 1's on the X input 21

22 Design a Parity Checker Circuit Design a parity checker X is read at the time of the active clock edge X input must be synchronized with the clock so that it assumes its next value before the next active clock edge Clock required to distinguish consecutive 0's or 1's on the X input Typical input and output waveforms 22

23 Design a Parity Checker Circuit Design a parity checker Typical input and output waveforms 23

24 Design a Parity Checker Circuit Design a parity checker Construct a state graph Circuit must "remember" whether the total number of 1 inputs received is even or odd Therefore two states are required Designate these states as S 0 even and S 1 odd number of 1 's received 24

25 Design a Parity Checker Circuit Design a parity checker Construct a state graph Circuit must "remember" whether the total number of 1 inputs received is even or odd Therefore two states are required Designate these states as S 0 even and S 1 odd number of 1 's received 25

26 Design a Parity Checker Circuit Design a parity checker Start in state S 0 initially zero 1's have been received If the circuit is in state S 0 even number of 1's received and X = 0 is received The circuit must stay in S 0 because the number of 1's received is still even 26

27 Design a Parity Checker Circuit Design a parity checker If X = 1 is received the circuit goes to state S 1 because the number of 1's received is then odd 27

28 Design a Parity Checker Circuit Design a parity checker If in state S 1 odd number of 1's received A zero input causes no state change A one causes a change to S 0 because the number of 1's received is then even 28

29 Design a Parity Checker Circuit Design a parity checker Z should be 1 whenever the circuit is in state S 1 odd number of 1's received The output is listed below the state on the state graph 29

30 Design a Parity Checker Circuit Design a parity checker Create a State Table from the State Graph 30

31 Design a Parity Checker Circuit Design a parity checker Create a State Table from the State Graph 31

32 Design a Parity Checker Circuit Design a parity checker If the present state is S 0 32

33 Design a Parity Checker Circuit Design a parity checker If the present state is S 0 The output is Z = 0 33

34 Design a Parity Checker Circuit Design a parity checker If the present state is S 0 The output is Z = 0 and If the input is X= 1 34

35 Design a Parity Checker Circuit Design a parity checker If the present state is S 0 The output is Z = 0 and If the input is X= 1 the next state will be S 1 35

36 Design a Parity Checker Circuit Design a parity checker Only two states therefore a single flip-flop (Q) is needed Use a T Flip-flop 36

37 Design a Parity Checker Circuit Design a parity checker Q = 0 correspond to S 0 Q = 1 correspond to S 1 37

38 Design a Parity Checker Circuit Design a parity checker Q = 0 correspond to S 0 Q = 1 correspond to S 1 Table shows the next state of flip-flop Q as a function of the present state and X 38

39 Design a Parity Checker Circuit Design a parity checker Q = 0 correspond to S 0 Q = 1 correspond to S 1 Table shows the next state of flip-flop Q as a function of the present state and X For T flip-flop T = 1 whenever Q and Q+ differ 39

40 Design a Parity Checker Circuit Design a parity checker Q = 0 correspond to S 0 Q = 1 correspond to S 1 Table shows the next state of flip-flop Q as a function of the present state and X For T flip-flop T = 1 whenever Q and Q+ differ T input must be 1 whenever X= 1 40

41 Design a Parity Checker Circuit Design a parity checker When X = 1 the flip-flop changes state after the falling edge of the clock 41

42 Design a Parity Checker Circuit Design a parity checker Final value of Z is 0 Because an even number of 1 's was received 42

43 Design a Parity Checker Circuit Design a parity checker If the final value of Z = 1 The flip-flop would need to be reset prior to next sequence 43

44 Analysis by Signal Tracing and Timing Charts 44

45 Analysis by Signal Tracing and Timing Charts We can analyze clocked sequential circuits to find the output sequence resulting from a given input sequence by Tracing 0 and 1 signals through the circuit 45

46 Analysis by Signal Tracing and Timing Charts The basic procedure to analyze the circuit is 1. Assume an initial state of the flip-flops All flip-flops reset to 0 unless otherwise specified 2. For the first input in the given sequence determine the circuit output(s) and flip-flop inputs 3. Determine the new set of flip-flop states after the next active clock edge 4. Determine the output(s) that corresponds to the new states 5. Repeat 2 3 and 4 for each input in the sequence 46

47 Analysis by Signal Tracing and Timing Charts For the analysis Construct a timing chart which shows the relationship between the Input signal the clock the flip-flop states and the circuit output The circuit output may change at the time the flip-flops change state or at the time the input changes Depends on the type of circuit 47

48 Types of Clocked Sequential Circuits 48

49 Types of Clocked Sequential Circuits Two types of clocked sequential circuits First the output depends only on the present state of the flipflops Second those in which the output depends on both the Present state of the flip-flops and On the value of the circuit inputs 49

50 Moore Machine 50

51 Moore Machine Moore machine Output of a sequential circuit is a function of the present state only Two examples 51

52 Moore Machine Moore machine The state graph for a Moore machine has the output associated with the state 52

53 Mealy Machine 53

54 Mealy Machine Mealy machine Output is a function of both the present state and the input Example 54

55 Mealy Machine Mealy machine The state graph for a Mealy machine has the output associated with the arrow going between states 55

56 Example Moore Circuit Analysis 56

57 Moore Circuit Analysis Analyze the circuit below input sequence X = Initial state is A = B = 0 and all state changes occur after the rising edge of the clock X input is synchronized with the clock so that it assumes its next value after each rising edge 57

58 Moore Circuit Analysis Analyze the circuit below input sequence X = Initial state is A = B = 0 Z is a function only of the present state Z = A B output will only change when the state changes Moore Circuit! 58

59 Analysis by Signal Tracing and Timing Charts RECALL The basic procedure to analyze the circuit is 1. Assume an initial state of the flip-flops All flip-flops reset to 0 unless otherwise specified 2. For the first input in the given sequence determine the circuit output(s) and flip-flop inputs 3. Determine the new set of flip-flop states after the next active clock edge 4. Determine the output(s) that corresponds to the new states 5. Repeat 2 3 and 4 for each input in the sequence 59

60 Moore Circuit Analysis Analyze the circuit below input sequence X = Initial state is A = B = 0 Initially X = 0 so D A = 1 and D B = 0 The state will change to A = 1 and B = 0 after the first rising clock edge 60

61 Moore Circuit Analysis Analyze the circuit below input sequence X = Initial state is A = B = 0 When the circuit is reset to its initial state A = B = 0 the initial output is Z = 0 because this initial 0 is not in response to any X input it should be ignored 61

62 Moore Circuit Analysis Analyze the circuit below input sequence X = Then X changes to 1... so D A = 0 D B = 1 and the state changes to AB = 01 after the second rising clock edge 62

63 Moore Circuit Analysis Analyze the circuit below input sequence X = After the state change X remains 1 so D A = D B = 1 and the next rising edge causes the state to change to 11 63

64 Moore Circuit Analysis Analyze the circuit below input sequence X = When X changes to 0 D A = 0 and D B = 1 and the state changes to AB = 01 on the fourth rising edge 64

65 Moore Circuit Analysis Analyze the circuit below input sequence X = Then with X= 1 D A = D B = 1 so the fifth rising clock edge causes the state to change to AB = 11 65

66 Moore Circuit Analysis Analyze the circuit below input sequence X = The resulting output sequence Z =

67 Example Mealy Circuit Analysis 67

68 Mealy Circuit Analysis Analyze the circuit below input sequence X= The input is synchronized with the clock so that input changes occur after the falling edge 68

69 Mealy Circuit Analysis Analyze the circuit below input sequence X= The output depends on both the input.. X and the flip-flop states A and B so Z may change either when the input changes or when the flip-flops change state 69

70 Mealy Circuit Analysis Analyze the circuit below input sequence X= Initially flip-flop states are A = 0 B = 0 If X= 1 the output is Z = 1 and J B = K A = 1 70

71 Mealy Circuit Analysis Analyze the circuit below input sequence X= After the falling edge of the first clock pulse B changes to 1 so Z changes to 0 If the input is changed to X = 0 Z will change back to 1 71

72 Mealy Circuit Analysis Analyze the circuit below input sequence X= Flip-flop inputs = 0... so no state change occurs with the second falling edge When X is changed to 1 Z becomes 0 and J A = K A = J B = 1 72

73 Mealy Circuit Analysis Analyze the circuit below input sequence X= A changes to 1 on the third falling clock edge Z changes to 1 73

74 Mealy Circuit Analysis Analyze the circuit below input sequence X= X is changed to 0 Z becomes 0 and no state change occurs with the fourth clock pulse 74

75 Mealy Circuit Analysis Analyze the circuit below input sequence X= X is changed to 0 Z becomes 0 and no state change occurs with the fourth clock pulse 75

76 Mealy Circuit Analysis Analyze the circuit below input sequence X= X is changed to 1 Z becomes 1 Because J A = K A = J B = K B = 1 the fifth clock pulse returns the circuit to the initial state 76

77 Mealy Circuit Analysis For Mealy circuits After the circuit has changed state and before the input is changed the output may temporarily assume an incorrect value which we call a false output False value arises when the circuit has assumed a new state but the old input associated with the previous state is still present 77

78 False Outputs Moore circuit can change slate only when the Flip-flops change state and not when the input changes therefore No false outputs can appear in a Moore circuit False outputs are often referred to as glitches and spikes 78

79 State Tables and Graphs 79

80 State Tables and Graphs Previous analysis works for small circuits and short input sequences However the construction of state tables and graphs provides a more systematic approach which is useful for the analysis of larger circuits and which leads to a general synthesis procedure for sequential circuits State table specifies the next state and output of a sequential circuit in terms of Its present state and input 80

81 State Tables and Graphs The following method can be used to construct the state table 1. Determine the flip-flop input equations and the output equations from the circuit 2. Derive the next-state equation for each flip-flop from its input equations using one of the following relations D flip-flop Q + = D (13-1) D-CE flip-flop Q + = D CE + Q CE (13-2) T flip-flop Q + = T Q (13-3) S-R flip-flop Q + = S + R Q (13-4) J-K flip-flop Q + = JQ + K Q (13-5) 81

82 State Tables and Graphs 3. Plot a next-state map for each flip-flop 4. Combine these maps to form the state table Such a state table which gives the next state of the flipflops as a function of their present state and the circuit inputs is frequently referred to as a transition table 82

83 Example State Tables and Graphs 83

84 State Tables and Graphs Example derive the state table for the circuit below 84

85 State Tables and Graphs Example con t derive the state table for the circuit below Moore sequential circuit 85

86 State Tables and Graphs Example con t derive the state table for the circuit below 1. The flip-flop input equations and output equation are D A = X B D B = X + A Z = A B 86

87 State Tables and Graphs Example con t derive the state table for the circuit below 2. The next-state equations for the flip-flops are A + = X B B + = X + A 87

88 State Tables and Graphs Example con t derive the state table for the circuit below 3. The corresponding maps are A + = X B B + = X + A 88

89 State Tables and Graphs Recall the next-state map for each flip-flop are combined to form the state table (transition table) The state table gives The next state of the flip-flops as a function of their present state and the circuit inputs 89

90 State Tables and Graphs Example con t derive the state table for the circuit below 4. Combine the state maps to form the transition table which gives the next state of both flip-flops (A + B + ) as a function of the present state and input A + B + AB X=0 X=1 Z

91 State Tables and Graphs Example con t derive the state table for the circuit below 4. con t the output function Z is then added to the table in this example the output depends only on the present state of the flipflops and not on the input so only a single output column is required Z = A B A + B + AB X=0 X=1 Z

92 State Tables and Graphs Example con t derive the state table for the circuit below 4. Let AB = 00 correspond to circuit state S 0 01 to S 1 11 to S 2 and 10 to S 3 A + B + AB X=0 X=1 Z Present Next State Present State X = 0 X = 1 Output(Z) S 0 S 3 S 1 0 S 1 S 0 S 2 1 S 2 S 1 S 2 0 S 3 S 2 S

93 State Tables and Graphs Example con t derive the state table for the circuit below 4. Let AB = 00 correspond to circuit state S 0 01 to S 1 11 to S 2 and 10 to S 3 A + B + AB X=0 X=1 Z Present Next State Present State X = 0 X = 1 Output(Z) S 0 S 3 S 1 0 S 1 S 0 S 2 1 S 2 S 1 S 2 0 S 3 S 2 S

94 State Tables and Graphs Example con t derive the state table for the circuit below 4. Construct State Graph Present Next State Present State X = 0 X = 1 Output(Z) S 0 S 3 S 1 0 S 1 S 0 S 2 1 S 2 S 1 S 2 0 S 3 S 2 S

95 State Tables and Graphs Example con t derive the state table for the circuit below 4. Each node represents a state of the circuit Present Next State Present State X = 0 X = 1 Output(Z) S 0 S 3 S 1 0 S 1 S 0 S 2 1 S 2 S 1 S 2 0 S 3 S 2 S

96 State Tables and Graphs Example con t derive the state table for the circuit below 4. Each node represents a state of the circuit corresponding output is placed in the circle below the state symbol Present Next State Present State X = 0 X = 1 Output(Z) S 0 S 3 S 1 0 S 1 S 0 S 2 1 S 2 S 1 S 2 0 S 3 S 2 S

97 State Tables and Graphs Example con t derive the state table for the circuit below 4. Each node represents a state of the circuit corresponding output is placed in the circle below the state symbol the arc joining two nodes is labeled with the value of X which will cause a state change between these nodes Present Next State Present State X = 0 X = 1 Output(Z) S 0 S 3 S 1 0 S 1 S 0 S 2 1 S 2 S 1 S 2 0 S 3 S 2 S

98 State Tables and Graphs Example FINAL derive the state table for the circuit below Present Next State Present State X = 0 X = 1 Output(Z) S 0 S 3 S 1 0 S 1 S 0 S 2 1 S 2 S 1 S 2 0 S 3 S 2 S

99 Example State Tables and Graphs 99

100 State Tables and Graphs Example derive the state table for the circuit below 100

101 State Tables and Graphs Example con t derive the state table for the circuit below Mealy sequential circuit 101

102 State Tables and Graphs Example con t derive the state table for the circuit below 1. The flip-flop input equations and output equation are 102

103 State Tables and Graphs Example con t derive the state table for the circuit below 2... We can construct the next-state and output equations from the circuit diagram 103

104 State Tables and Graphs Example con t derive the state table for the circuit below 2... We can construct the next-state and output equations from the circuit diagram A + = J A A + K A A = XBA + X A B + = J B B + K B B = XB + (AX) B = XB + X B + A B Z = X A B + XB + XA 104

105 State Tables and Graphs Example con t derive the state table for the circuit below 3. The corresponding maps are A + = J A A + K A A = XBA + X A B + = J B B + K B B = XB + (AX) B = XB + X B + A B Z = X A B + XB + XA 105

106 State Tables and Graphs Example con t derive the state table for the circuit below 4. con t Combine the state maps to form the transition table 106

107 State Tables and Graphs Example con t derive the state table for the circuit below 4. con t Let AB = 00 correspond to circuit state S 0 01 to S 1 11 to S 2 and 10 to S 3 107

108 State Tables and Graphs Example con t derive the state table for the circuit below 4. con t Construct State Graph input/output 108

109 State Tables and Graphs Example FINAL derive the state table for the circuit below 109

110 Example State Tables and Graphs 110

111 Serial Adder Analysis Analyze the operation of a serial adder that adds two n-bit binary numbers x i and y i Serial adder is similar to the parallel adder except that the binary numbers are fed in serially one pair of bits at a time and the sum is read out serially one bit at a time 111

112 Serial Adder Analysis Analyze the operation of a serial adder First x 0 and y 0 are fed in a sum digit s 0 is generated and the carry c 1 is stored 112

113 Serial Adder Analysis Analyze the operation of a serial adder At the next clock time x 1 and y 1 are fed in and added to c 1 to give the next sum digit s 1 and the new carry c 2 which is stored This process continues until all bits have been added 113

114 Serial Adder Analysis Analyze the operation of a serial adder A full adder is used to add the x i, y i and c i bits to form c i+1 and s i A D flip-flop is used to store the carry (c i+1 ) on the rising edge of the clock. The x i and y i inputs must be synchronized with the clock 114

115 Serial Adder Analysis Analyze the operation of a serial adder timing diagram for the serial adder Example add to give a sum of and a final carry of 0 115

116 Serial Adder Analysis Analyze the operation of a serial adder timing diagram for the serial adder Example add to give a sum of and a final carry of 0 116

117 Serial Adder Analysis Analyze the operation of a serial adder timing diagram for the serial adder Example add to give a sum of and a final carry of 0 117

118 Serial Adder Analysis Analyze the operation of a serial adder truth table for the full adder 120

119 Serial Adder Analysis Analyze the operation of a serial adder construct a state graph 121

120 Example Mealy Sequential Circuit With Two Inputs/Outputs 123

121 Mealy Sequential Circuit With Two Inputs/Outputs State table for a Mealy sequential circuit with two inputs and two outputs along with corresponding state graph The notation 00,01/00 on the arc from S 3 to S 2 means if X 1 = X 2 = 0 or X 1 = 0 and X 2 = 1 then Z 1 = 0 and Z 2 = 0 124

122 Construction and Interpretation of Timing Charts 125

123 Construction and Interpretation of Timing Charts Several important points concerning the construction and interpretation of timing charts are 1. When constructing timing charts note that a state change can only occur after the rising (or falling) edge of the clock 2. The input will normally be stable immediately before and after the active clock edge 126

124 Construction and Interpretation of Timing Charts 3. For a Moore circuit The output can change only when the state changes For a Mealy circuit The output can change when the input changes as well as when the state changes A false output may occur between the time the state changes and the time the input is changes to its new value 127

125 Construction and Interpretation of Timing Charts 4. False outputs are difficult to determine from the state graph So use either signal tracing through the circuit or Use the state table when constructing timing charts for Mealy circuits 128

126 Construction and Interpretation of Timing Charts 5. When using a Mealy state table for constructing timing charts the procedure is as follows (a) For the first input read the present output and plot it (b) Read the next state and plot it following the active edge of the clock pulse (c) Go to the row in the table which corresponds to the next state and read the output under the old input column and plot it this may be a false output (d) Change to the next input and repeat steps (a) (b) and (c) 129

127 Construction and Interpretation of Timing Charts 6. For Mealy circuits the best time to read the output is just before the active edge of the clock Because the output should always be correct at that time A false output may occur after the state has changed and before the input has changed 130

128 Example 131

129 Example The following example shows the relationships among the State graph State table Circuits and Timing chart The input sequence is X =

130 133

131 134

132 135

133 136

134 137

135 138

136 139

137 FINAL X = Z =

138 PREVIEW Synthesis Procedure 148

139 PREVIEW --- Synthesis Procedure The synthesis procedure for sequential circuits Opposite of the procedure used for analysis Starting with the specifications for the sequential circuit to be synthesized A state graph is constructed This graph is then translated to a state table and The flip-flop output values are assigned for each state The flip-flop input equations are then derived The logic diagram for the circuit is drawn Will be discussed in Chapters

140 General Models for Sequential Circuits 150

141 General Models for Sequential Circuits A sequential circuit can be divided conveniently into two parts The flip-flops which serve as memory for the circuit and The combinational logic which realizes the input functions for the flip-flops and the output functions The combinational logic may be implemented with Gates With a ROM or With a PLA 151

142 General Models for Sequential Circuits This circuit is a general model for a clocked Mealy sequential circuit with m inputs n outputs and k clocked D flip-flops used as memory This model emphasizes the presence of feedback in the sequential circuit because the flip-flop outputs are fed back as inputs to the combinational subcircuit 152

143 Clock Synchronization 153

144 Clock Synchronization The clock synchronizes the operation of the flip-flops and prevents timing problems Gates in the combinational subcircuit have finite propagation delays Finite time is required before the flip-flop inputs reach their final values Gate delays are not all the same If the next active clock edge does not occur until all flip-flop input signals have reached their final steady-state values The unequal gate delays will not cause any timing problems 154

145 Clock Synchronization All flip-flops which must change state do so at the same time in response to the active edge of the clock When the flip-flops change state The new flip-flop outputs are fed back into the combinational subcircuit No further change in the flip-flop states can occur until the next clock pulse 155

146 Minimum Clock Period (Sequential Circuit) 156

147 Minimum Clock Period - Sequential Circuit We can determine the fastest clock speed which is also the minimum clock period from the general model of the Mealy circuit Following the active edge of the clock the flip-flops change state and the flip-flop output is stable after the propagation delay (t p ) The new values of Q then propagate through the combinational circuit so that the D values are stable after the combinational circuit delay (t c ) Then the flip-flop setup time (t su ) must elapse before the next active clock edge 157

148 Minimum Clock Period - Sequential Circuit Thus the propagation delay in the flip-flops the propagation delay in the combinational subcircuit and the setup time for the flip-flops determine how fast the sequential circuit can operate and the minimum clock period is t clk (min) = t p + t c + t su This assumes that the X inputs are stable no later than t c + t su before the next active clock edge If this is not the case then we must calculate the minimum clock period by t clk (min) = t x + t c + t su Where t x is the time after the active clock edge at which the X inputs are stable 158

149 Minimum Clock Period - Sequential Circuit 159

150 General Model Clocked Moore Circuit 160

151 General Model - Clocked Moore Circuit The general model for the clocked Moore circuit is similar to the clocked Mealy circuit 161

152 General Model - Clocked Moore Circuit The output subcircuit is drawn separately as the output is only a function of the present state of the flip-flops and not a function of the circuit inputs 162

153 General Model - Clocked Moore Circuit The Moore circuit is similar to that of the Mealy except when inputs applied resulting outputs do not appear until after the clock causes the flip-flops to change state 163

154 General Model - Clocked Moore Circuit For sequential circuits with multiple inputs and outputs symbols represent each combination of input and output values Example below 164

155 General Model - Clocked Moore Circuit Let X = 0 represent input combination X 1 X 2 = 00 Let X= 1 represent X 1 X 2 = 01 etc Same representation with Z 165

156 General Model - Clocked Moore Circuit With these representations we can specify the behavior of any sequential circuit in terms of A single input variable X and A single output variable Z 166

157 General Model - Clocked Moore Circuit Table below specifies two functions the next-state function and the output function The next-state function designated (delta) gives the next state of the circuit the state after the clock pulse in terms of the present state (S) and the present input (X) S + = (S, X) 167

158 General Model - Clocked Moore Circuit The output function designated λ (lambda) gives the output of the circuit (Z) in terms of the present state (S) and input (X) Z = λ (S, X) 168

159 General Model - Clocked Moore Circuit Values of S + and Z can be determined from the state table From the table Next State Output 169

160 Lab 170

161 LABS Lab #1 is due TONIGHT February 23 rd Lab #2 will be available on March 8 th Due date MAY change from current due date on the syllabus 171

162 Next Week 172

163 Next Week Topics Exam #1 In two weeks Chapter 14 Derivation of State Graphs and Tables Pages

164 Home Work 174

165 Homework 1. Exam #1 preparation 2. Read Due in two weeks Chapter 14 Derivation of State Graphs and Tables Pages

Logic Design II (17.342) Spring Lecture Outline

Logic Design II (17.342) Spring Lecture Outline Logic Design II (17.342) Spring 2012 Lecture Outline Class # 03 February 09, 2012 Dohn Bowden 1 Today s Lecture Registers and Counters Chapter 12 2 Course Admin 3 Administrative Admin for tonight Syllabus

More information

Sequential Logic Circuits

Sequential Logic Circuits Sequential Logic Circuits By Dr. M. Hebaishy Digital Logic Design Ch- Rem.!) Types of Logic Circuits Combinational Logic Memoryless Outputs determined by current values of inputs Sequential Logic Has memory

More information

Chapter 5: Synchronous Sequential Logic

Chapter 5: Synchronous Sequential Logic Chapter 5: Synchronous Sequential Logic NCNU_2016_DD_5_1 Digital systems may contain memory for storing information. Combinational circuits contains no memory elements the outputs depends only on the inputs

More information

ELCT201: DIGITAL LOGIC DESIGN

ELCT201: DIGITAL LOGIC DESIGN ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 8 Following the slides of Dr. Ahmed H. Madian محرم 1439 ه Winter

More information

Course Administration

Course Administration EE 224: INTRODUCTION TO DIGITAL CIRCUITS & COMPUTER DESIGN Lecture 5: Sequential Logic - 2 Analysis of Clocked Sequential Systems 4/2/2 Avinash Kodi, kodi@ohio.edu Course Administration 2 Hw 2 due on today

More information

Lecture 11: Synchronous Sequential Logic

Lecture 11: Synchronous Sequential Logic Lecture 11: Synchronous Sequential Logic Syed M. Mahmud, Ph.D ECE Department Wayne State University Aby K George, ECE Department, Wayne State University Contents Characteristic equations Analysis of clocked

More information

Final Exam review: chapter 4 and 5. Supplement 3 and 4

Final Exam review: chapter 4 and 5. Supplement 3 and 4 Final Exam review: chapter 4 and 5. Supplement 3 and 4 1. A new type of synchronous flip-flop has the following characteristic table. Find the corresponding excitation table with don t cares used as much

More information

Digital Logic Design I

Digital Logic Design I Digital Logic Design I Synchronous Sequential Logic Mustafa Kemal Uyguroğlu Sequential Circuits Asynchronous Inputs Combinational Circuit Memory Elements Outputs Synchronous Inputs Combinational Circuit

More information

Chapter 5 Synchronous Sequential Logic

Chapter 5 Synchronous Sequential Logic Chapter 5 Synchronous Sequential Logic Chih-Tsun Huang ( 黃稚存 ) http://nthucad.cs.nthu.edu.tw/~cthuang/ Department of Computer Science National Tsing Hua University Outline Introduction Storage Elements:

More information

Chapter 6. Flip-Flops and Simple Flip-Flop Applications

Chapter 6. Flip-Flops and Simple Flip-Flop Applications Chapter 6 Flip-Flops and Simple Flip-Flop Applications Basic bistable element It is a circuit having two stable conditions (states). It can be used to store binary symbols. J. C. Huang, 2004 Digital Logic

More information

Switching Circuits & Logic Design, Fall Final Examination (1/13/2012, 3:30pm~5:20pm)

Switching Circuits & Logic Design, Fall Final Examination (1/13/2012, 3:30pm~5:20pm) Switching Circuits & Logic Design, Fall 2011 Final Examination (1/13/2012, 3:30pm~5:20pm) Problem 1: (15 points) Consider a new FF with three inputs, S, R, and T. No more than one of these inputs can be

More information

Digital Logic Design ENEE x. Lecture 19

Digital Logic Design ENEE x. Lecture 19 Digital Logic Design ENEE 244-010x Lecture 19 Announcements Homework 8 due on Monday, 11/23. Agenda Last time: Timing Considerations (6.3) Master-Slave Flip-Flops (6.4) This time: Edge-Triggered Flip-Flops

More information

1. Convert the decimal number to binary, octal, and hexadecimal.

1. Convert the decimal number to binary, octal, and hexadecimal. 1. Convert the decimal number 435.64 to binary, octal, and hexadecimal. 2. Part A. Convert the circuit below into NAND gates. Insert or remove inverters as necessary. Part B. What is the propagation delay

More information

Unit 11. Latches and Flip-Flops

Unit 11. Latches and Flip-Flops Unit 11 Latches and Flip-Flops 1 Combinational Circuits A combinational circuit consists of logic gates whose outputs, at any time, are determined by combining the values of the inputs. For n input variables,

More information

EECS150 - Digital Design Lecture 19 - Finite State Machines Revisited

EECS150 - Digital Design Lecture 19 - Finite State Machines Revisited EECS150 - Digital Design Lecture 19 - Finite State Machines Revisited April 2, 2013 John Wawrzynek Spring 2013 EECS150 - Lec19-fsm Page 1 Finite State Machines (FSMs) FSM circuits are a type of sequential

More information

Sequential Circuits. Output depends only and immediately on the inputs Have no memory (dependence on past values of the inputs)

Sequential Circuits. Output depends only and immediately on the inputs Have no memory (dependence on past values of the inputs) Sequential Circuits Combinational circuits Output depends only and immediately on the inputs Have no memory (dependence on past values of the inputs) Sequential circuits Combination circuits with memory

More information

Digital Design, Kyung Hee Univ. Chapter 5. Synchronous Sequential Logic

Digital Design, Kyung Hee Univ. Chapter 5. Synchronous Sequential Logic Chapter 5. Synchronous Sequential Logic 1 5.1 Introduction Electronic products: ability to send, receive, store, retrieve, and process information in binary format Dependence on past values of inputs Sequential

More information

Chapter 3. Boolean Algebra and Digital Logic

Chapter 3. Boolean Algebra and Digital Logic Chapter 3 Boolean Algebra and Digital Logic Chapter 3 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple logic circuits. Understand how

More information

UNIT III. Combinational Circuit- Block Diagram. Sequential Circuit- Block Diagram

UNIT III. Combinational Circuit- Block Diagram. Sequential Circuit- Block Diagram UNIT III INTRODUCTION In combinational logic circuits, the outputs at any instant of time depend only on the input signals present at that time. For a change in input, the output occurs immediately. Combinational

More information

Lecture 8: Sequential Logic

Lecture 8: Sequential Logic Lecture 8: Sequential Logic Last lecture discussed how we can use digital electronics to do combinatorial logic we designed circuits that gave an immediate output when presented with a given set of inputs

More information

Logic Design ( Part 3) Sequential Logic- Finite State Machines (Chapter 3)

Logic Design ( Part 3) Sequential Logic- Finite State Machines (Chapter 3) Logic esign ( Part ) Sequential Logic- Finite State Machines (Chapter ) Based on slides McGraw-Hill Additional material 00/00/006 Lewis/Martin Additional material 008 Roth Additional material 00 Taylor

More information

Synchronous Sequential Logic

Synchronous Sequential Logic Synchronous Sequential Logic ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2017 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines Sequential

More information

Synchronous Sequential Logic. Chapter 5

Synchronous Sequential Logic. Chapter 5 Synchronous Sequential Logic Chapter 5 5-1 Introduction Combinational circuits contains no memory elements the outputs depends on the inputs Synchronous Sequential Logic 5-2 5-2 Sequential Circuits Sequential

More information

More design examples, state assignment and reduction. Page 1

More design examples, state assignment and reduction. Page 1 More design examples, state assignment and reduction Page 1 Serial Parity Checker We have only 2 states (S 0, S 1 ): correspond to an even and odd number of 1 s received so far. x Clock D FF Q Z = 1 whenever

More information

CHAPTER 4: Logic Circuits

CHAPTER 4: Logic Circuits CHAPTER 4: Logic Circuits II. Sequential Circuits Combinational circuits o The outputs depend only on the current input values o It uses only logic gates, decoders, multiplexers, ALUs Sequential circuits

More information

Part II. Chapter2: Synchronous Sequential Logic

Part II. Chapter2: Synchronous Sequential Logic 課程名稱 : 數位系統設計導論 P-/77 Part II Chapter2: Synchronous Sequential Logic 教師 : 郭峻因教授 INSTRUCTOR: Prof. Jiun-In Guo E-mail: jiguo@cs.ccu.edu.tw 課程名稱 : 數位系統設計導論 P-2/77 Special thanks to Prof. CHING-LING SU for

More information

CHAPTER 4: Logic Circuits

CHAPTER 4: Logic Circuits CHAPTER 4: Logic Circuits II. Sequential Circuits Combinational circuits o The outputs depend only on the current input values o It uses only logic gates, decoders, multiplexers, ALUs Sequential circuits

More information

D Latch (Transparent Latch)

D Latch (Transparent Latch) D Latch (Transparent Latch) -One way to eliminate the undesirable condition of the indeterminate state in the SR latch is to ensure that inputs S and R are never equal to 1 at the same time. This is done

More information

Logic Design. Flip Flops, Registers and Counters

Logic Design. Flip Flops, Registers and Counters Logic Design Flip Flops, Registers and Counters Introduction Combinational circuits: value of each output depends only on the values of inputs Sequential Circuits: values of outputs depend on inputs and

More information

1.b. Realize a 5-input NOR function using 2-input NOR gates only.

1.b. Realize a 5-input NOR function using 2-input NOR gates only. . [3 points] Short Questions.a. Prove or disprove that the operators (,XOR) form a complete set. Remember that the operator ( ) is implication such that: A B A B.b. Realize a 5-input NOR function using

More information

Analysis of Clocked Sequential Circuits

Analysis of Clocked Sequential Circuits Analysis of Clocked Sequential Circuits COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals Presentation Outline Analysis of Clocked Sequential circuits State

More information

CPS311 Lecture: Sequential Circuits

CPS311 Lecture: Sequential Circuits CPS311 Lecture: Sequential Circuits Last revised August 4, 2015 Objectives: 1. To introduce asynchronous and synchronous flip-flops (latches and pulsetriggered, plus asynchronous preset/clear) 2. To introduce

More information

Synchronous Sequential Logic

Synchronous Sequential Logic Synchronous Sequential Logic ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2012 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines Sequential

More information

Digital Fundamentals: A Systems Approach

Digital Fundamentals: A Systems Approach Digital Fundamentals: A Systems Approach Counters Chapter 8 A System: Digital Clock Digital Clock: Counter Logic Diagram Digital Clock: Hours Counter & Decoders Finite State Machines Moore machine: One

More information

CS8803: Advanced Digital Design for Embedded Hardware

CS8803: Advanced Digital Design for Embedded Hardware CS883: Advanced Digital Design for Embedded Hardware Lecture 4: Latches, Flip-Flops, and Sequential Circuits Instructor: Sung Kyu Lim (limsk@ece.gatech.edu) Website: http://users.ece.gatech.edu/limsk/course/cs883

More information

DIGITAL TECHNICS II. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute

DIGITAL TECHNICS II. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute 26.3.9. DIGITAL TECHNICS II Dr. Bálint Pődör Óbuda University, Microelectronics and Technology Institute 5. LECTURE: ANALYSIS AND SYNTHESIS OF SYNCHRONOUS SEQUENTIAL CIRCUITS 2nd (Spring) term 25/26 5.

More information

Advanced Digital Logic Design EECS 303

Advanced Digital Logic Design EECS 303 Advanced Digital Logic Design EECS 303 http://ziyang.eecs.northwestern.edu/eecs303/ Teacher: Robert Dick Office: L477 Tech Email: dickrp@northwestern.edu Phone: 847 467 2298 Outline Introduction Reset/set

More information

EECS150 - Digital Design Lecture 15 Finite State Machines. Announcements

EECS150 - Digital Design Lecture 15 Finite State Machines. Announcements EECS150 - Digital Design Lecture 15 Finite State Machines October 18, 2011 Elad Alon Electrical Engineering and Computer Sciences University of California, Berkeley http://www-inst.eecs.berkeley.edu/~cs150

More information

Previous Lecture Sequential Circuits. Slide Summary of contents covered in this lecture. (Refer Slide Time: 01:55)

Previous Lecture Sequential Circuits. Slide Summary of contents covered in this lecture. (Refer Slide Time: 01:55) Previous Lecture Sequential Circuits Digital VLSI System Design Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology, Madras Lecture No 7 Sequential Circuit Design Slide

More information

problem maximum score 1 28pts 2 10pts 3 10pts 4 15pts 5 14pts 6 12pts 7 11pts total 100pts

problem maximum score 1 28pts 2 10pts 3 10pts 4 15pts 5 14pts 6 12pts 7 11pts total 100pts University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences EECS150 J. Wawrzynek Spring 2002 4/5/02 Midterm Exam II Name: Solutions ID number:

More information

DIGITAL TECHNICS. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute

DIGITAL TECHNICS. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute 27.2.2. DIGITAL TECHNICS Dr. Bálint Pődör Óbuda University, Microelectronics and Technology Institute 6. LECTURE (ANALYSIS AND SYNTHESIS OF SYNCHRONOUS SEQUENTIAL CIRCUITS) 26/27 6. LECTURE Analysis and

More information

Unit 9 Latches and Flip-Flops. Dept. of Electrical and Computer Eng., NCTU 1

Unit 9 Latches and Flip-Flops. Dept. of Electrical and Computer Eng., NCTU 1 Unit 9 Latches and Flip-Flops Dept. of Electrical and Computer Eng., NCTU 1 9.1 Introduction Dept. of Electrical and Computer Eng., NCTU 2 What is the characteristic of sequential circuits in contrast

More information

Synchronous Sequential Logic

Synchronous Sequential Logic Synchronous Sequential Logic -A Sequential Circuit consists of a combinational circuit to which storage elements are connected to form a feedback path. The storage elements are devices capable of storing

More information

NH 67, Karur Trichy Highways, Puliyur C.F, Karur District UNIT-III SEQUENTIAL CIRCUITS

NH 67, Karur Trichy Highways, Puliyur C.F, Karur District UNIT-III SEQUENTIAL CIRCUITS NH 67, Karur Trichy Highways, Puliyur C.F, 639 114 Karur District DEPARTMENT OF ELETRONICS AND COMMUNICATION ENGINEERING COURSE NOTES SUBJECT: DIGITAL ELECTRONICS CLASS: II YEAR ECE SUBJECT CODE: EC2203

More information

More Digital Circuits

More Digital Circuits More Digital Circuits 1 Signals and Waveforms: Showing Time & Grouping 2 Signals and Waveforms: Circuit Delay 2 3 4 5 3 10 0 1 5 13 4 6 3 Sample Debugging Waveform 4 Type of Circuits Synchronous Digital

More information

`COEN 312 DIGITAL SYSTEMS DESIGN - LECTURE NOTES Concordia University

`COEN 312 DIGITAL SYSTEMS DESIGN - LECTURE NOTES Concordia University `OEN 32 IGITL SYSTEMS ESIGN - LETURE NOTES oncordia University hapter 5: Synchronous Sequential Logic NOTE: For more eamples and detailed description of the material in the lecture notes, please refer

More information

UNIT 1 NUMBER SYSTEMS AND DIGITAL LOGIC FAMILIES 1. Briefly explain the stream lined method of converting binary to decimal number with example. 2. Give the Gray code for the binary number (111) 2. 3.

More information

CS3350B Computer Architecture Winter 2015

CS3350B Computer Architecture Winter 2015 CS3350B Computer Architecture Winter 2015 Lecture 5.2: State Circuits: Circuits that Remember Marc Moreno Maza www.csd.uwo.ca/courses/cs3350b [Adapted from lectures on Computer Organization and Design,

More information

EE292: Fundamentals of ECE

EE292: Fundamentals of ECE EE292: Fundamentals of ECE Fall 2012 TTh 10:00-11:15 SEB 1242 Lecture 23 121120 http://www.ee.unlv.edu/~b1morris/ee292/ 2 Outline Review Combinatorial Logic Sequential Logic 3 Combinatorial Logic Circuits

More information

L5 Sequential Circuit Design

L5 Sequential Circuit Design L Sequential Circuit Design Sequential Circuit Design Mealy and Moore Characteristic Equations Design Procedure Example Sequential Problem from specification to implementation Ref: Unit 14 of text 9/2/2012

More information

Asynchronous (Ripple) Counters

Asynchronous (Ripple) Counters Circuits for counting events are frequently used in computers and other digital systems. Since a counter circuit must remember its past states, it has to possess memory. The chapter about flip-flops introduced

More information

MODULE 3. Combinational & Sequential logic

MODULE 3. Combinational & Sequential logic MODULE 3 Combinational & Sequential logic Combinational Logic Introduction Logic circuit may be classified into two categories. Combinational logic circuits 2. Sequential logic circuits A combinational

More information

Outline. CPE/EE 422/522 Advanced Logic Design L03. Review: Clocked D Flip-Flop with Rising-edge Trigger. Sequential Networks

Outline. CPE/EE 422/522 Advanced Logic Design L03. Review: Clocked D Flip-Flop with Rising-edge Trigger. Sequential Networks Outline PE/EE 422/522 Advanced Logic Design L3 Electrical and omputer Engineering University of Alabama in Huntsville What we know ombinational Networks Analysis, Synthesis, Simplification, Buiing Blocks,

More information

COMP sequential logic 1 Jan. 25, 2016

COMP sequential logic 1 Jan. 25, 2016 OMP 273 5 - sequential logic 1 Jan. 25, 2016 Sequential ircuits All of the circuits that I have discussed up to now are combinational digital circuits. For these circuits, each output is a logical combination

More information

Section 6.8 Synthesis of Sequential Logic Page 1 of 8

Section 6.8 Synthesis of Sequential Logic Page 1 of 8 Section 6.8 Synthesis of Sequential Logic Page of 8 6.8 Synthesis of Sequential Logic Steps:. Given a description (usually in words), develop the state diagram. 2. Convert the state diagram to a next-state

More information

Software Engineering 2DA4. Slides 9: Asynchronous Sequential Circuits

Software Engineering 2DA4. Slides 9: Asynchronous Sequential Circuits Software Engineering 2DA4 Slides 9: Asynchronous Sequential Circuits Dr. Ryan Leduc Department of Computing and Software McMaster University Material based on S. Brown and Z. Vranesic, Fundamentals of

More information

The basic logic gates are the inverter (or NOT gate), the AND gate, the OR gate and the exclusive-or gate (XOR). If you put an inverter in front of

The basic logic gates are the inverter (or NOT gate), the AND gate, the OR gate and the exclusive-or gate (XOR). If you put an inverter in front of 1 The basic logic gates are the inverter (or NOT gate), the AND gate, the OR gate and the exclusive-or gate (XOR). If you put an inverter in front of the AND gate, you get the NAND gate etc. 2 One of the

More information

ELE2120 Digital Circuits and Systems. Tutorial Note 8

ELE2120 Digital Circuits and Systems. Tutorial Note 8 ELE2120 Digital Circuits and Systems Tutorial Note 8 Outline 1. Register 2. Counters 3. Synchronous Counter 4. Asynchronous Counter 5. Sequential Circuit Design Overview 1. Register Applications: temporally

More information

Chapter 5 Synchronous Sequential Logic

Chapter 5 Synchronous Sequential Logic EEA051 - Digital Logic 數位邏輯 Chapter 5 Synchronous Sequential Logic 吳俊興國立高雄大學資訊工程學系 December 2005 Chapter 5 Synchronous Sequential Logic 5-1 Sequential Circuits 5-2 Latches 5-3 Flip-Flops 5-4 Analysis of

More information

B.Tech CSE Sem. 3 15CS202 DIGITAL SYSTEM DESIGN (Regulations 2015) UNIT -IV

B.Tech CSE Sem. 3 15CS202 DIGITAL SYSTEM DESIGN (Regulations 2015) UNIT -IV B.Tech CSE Sem. 3 5CS22 DIGITAL SYSTEM DESIGN (Regulations 25) UNIT -IV SYNCHRONOUS SEQUENTIAL CIRCUITS OUTLINE FlipFlops SR,D,JK,T Analysis of Synchronous Sequential Circuit State Reduction and Assignment

More information

CSE115: Digital Design Lecture 23: Latches & Flip-Flops

CSE115: Digital Design Lecture 23: Latches & Flip-Flops Faculty of Engineering CSE115: Digital Design Lecture 23: Latches & Flip-Flops Sections 7.1-7.2 Suggested Reading A Generic Digital Processor Building Blocks for Digital Architectures INPUT - OUTPUT Interconnect:

More information

Logic and Computer Design Fundamentals. Chapter 7. Registers and Counters

Logic and Computer Design Fundamentals. Chapter 7. Registers and Counters Logic and Computer Design Fundamentals Chapter 7 Registers and Counters Registers Register a collection of binary storage elements In theory, a register is sequential logic which can be defined by a state

More information

Administrative issues. Sequential logic

Administrative issues. Sequential logic Administrative issues Midterm #1 will be given Tuesday, October 29, at 9:30am. The entire class period (75 minutes) will be used. Open book, open notes. DDPP sections: 2.1 2.6, 2.10 2.13, 3.1 3.4, 3.7,

More information

CS61C : Machine Structures

CS61C : Machine Structures inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 24 State Circuits : Circuits that Remember Senior Lecturer SOE Dan Garcia www.cs.berkeley.edu/~ddgarcia Bio NAND gate Researchers at Imperial

More information

Chapter 1: Switching Algebra Chapter 2: Logical Levels, Timing & Delays. Introduction to latches Chapter 9: Binary Arithmetic

Chapter 1: Switching Algebra Chapter 2: Logical Levels, Timing & Delays. Introduction to latches Chapter 9: Binary Arithmetic 12.12.216 Chapter 5 Flip Flops Dr.-ng. Stefan Werner /14 Table of content Chapter 1: Switching Algebra Chapter 2: Logical Levels, Timing & Delays Chapter 3: Karnaugh-Veitch-Maps Chapter 4: Combinational

More information

MC9211 Computer Organization

MC9211 Computer Organization MC9211 Computer Organization Unit 2 : Combinational and Sequential Circuits Lesson2 : Sequential Circuits (KSB) (MCA) (2009-12/ODD) (2009-10/1 A&B) Coverage Lesson2 Outlines the formal procedures for the

More information

REPEAT EXAMINATIONS 2004 SOLUTIONS

REPEAT EXAMINATIONS 2004 SOLUTIONS REPET EXMINTIONS 24 SOLUTIONS MODULE: EE Digital Electronics COURSE:.Eng. in Electronic Engineering (year ).Eng. in Info and Communications Engineering (year ).Eng. in Mechatronic Engineering (year 2).Eng.

More information

Objectives. Combinational logics Sequential logics Finite state machine Arithmetic circuits Datapath

Objectives. Combinational logics Sequential logics Finite state machine Arithmetic circuits Datapath Objectives Combinational logics Sequential logics Finite state machine Arithmetic circuits Datapath In the previous chapters we have studied how to develop a specification from a given application, and

More information

CS 110 Computer Architecture. Finite State Machines, Functional Units. Instructor: Sören Schwertfeger.

CS 110 Computer Architecture. Finite State Machines, Functional Units. Instructor: Sören Schwertfeger. CS 110 Computer Architecture Finite State Machines, Functional Units Instructor: Sören Schwertfeger http://shtech.org/courses/ca/ School of Information Science and Technology SIST ShanghaiTech University

More information

CSE Latches and Flip-flops Dr. Izadi. NOR gate property: A B Z Cross coupled NOR gates: S M S R Q M

CSE Latches and Flip-flops Dr. Izadi. NOR gate property: A B Z Cross coupled NOR gates: S M S R Q M CSE-4523 Latches and Flip-flops Dr. Izadi NOR gate property: A B Z A B Z Cross coupled NOR gates: S M S R M R S M R S R S R M S S M R R S ' Gate R Gate S R S G R S R (t+) S G R Flip_flops:. S-R flip-flop

More information

Synchronous sequential circuits

Synchronous sequential circuits 8.6.5 Synchronous sequential Table of content. Combinational circuit design. Elementary combinatorial for data transmission. Memory structures 4. Programmable logic devices 5. Algorithmic minimization

More information

CS61C : Machine Structures

CS61C : Machine Structures inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #21 State Elements: Circuits that Remember 2008-3-14 Scott Beamer, Guest Lecturer www.piday.org 3.14159265358979323 8462643383279502884

More information

Review of digital electronics. Storage units Sequential circuits Counters Shifters

Review of digital electronics. Storage units Sequential circuits Counters Shifters Review of digital electronics Storage units Sequential circuits ounters Shifters ounting in Binary A counter can form the same pattern of 0 s and 1 s with logic levels. The first stage in the counter represents

More information

Digital Circuit And Logic Design I. Lecture 8

Digital Circuit And Logic Design I. Lecture 8 Digital Circuit And Logic Design I Lecture 8 Outline Sequential Logic Design Principles (1) 1. Introduction 2. Latch and Flip-flops 3. Clocked Synchronous State-Machine Analysis Panupong Sornkhom, 2005/2

More information

Outline. CPE/EE 422/522 Advanced Logic Design L04. Review: 8421 BCD to Excess3 BCD Code Converter. Review: Mealy Sequential Networks

Outline. CPE/EE 422/522 Advanced Logic Design L04. Review: 8421 BCD to Excess3 BCD Code Converter. Review: Mealy Sequential Networks Outline PE/EE 422/522 Advanced Logic Design L4 Electrical and omputer Engineering University of Alabama in Huntsville What we know ombinational Networks Analysis, Synthesis, Simplification, Hazards, Building

More information

Digital Circuit And Logic Design I

Digital Circuit And Logic Design I Digital Circuit And Logic Design I Lecture 8 Outline Sequential Logic Design Principles (1) 1. Introduction 2. Latch and Flip-flops 3. Clocked Synchronous State-Machine Panupong Sornkhom, 2005/2 2 1 Sequential

More information

Read-only memory (ROM) Digital logic: ALUs Sequential logic circuits. Don't cares. Bus

Read-only memory (ROM) Digital logic: ALUs Sequential logic circuits. Don't cares. Bus Digital logic: ALUs Sequential logic circuits CS207, Fall 2004 October 11, 13, and 15, 2004 1 Read-only memory (ROM) A form of memory Contents fixed when circuit is created n input lines for 2 n addressable

More information

CHAPTER 6 COUNTERS & REGISTERS

CHAPTER 6 COUNTERS & REGISTERS CHAPTER 6 COUNTERS & REGISTERS 6.1 Asynchronous Counter 6.2 Synchronous Counter 6.3 State Machine 6.4 Basic Shift Register 6.5 Serial In/Serial Out Shift Register 6.6 Serial In/Parallel Out Shift Register

More information

Digital Circuit Engineering

Digital Circuit Engineering Digital Circuit Engineering 2nd Distributive ( + A)( + B) = + AB Circuits that work in a sequence of steps Absorption + A = + A A+= THESE CICUITS NEED STOAGE TO EMEMBE WHEE THEY AE STOAGE D MU G M MU S

More information

EE 109 Homework 6 State Machine Design Name: Score:

EE 109 Homework 6 State Machine Design Name: Score: EE 9 Homework 6 State Machine esign Name: Score: ue: See Blackboard Blackboard ONLY Submission. While the Blackboard submission may not require you to go through all the design steps (such as drawing out

More information

Spring 2017 EE 3613: Computer Organization Chapter 5: The Processor: Datapath & Control - 1

Spring 2017 EE 3613: Computer Organization Chapter 5: The Processor: Datapath & Control - 1 Spring 27 EE 363: Computer Organization Chapter 5: The Processor: atapath & Control - Avinash Kodi epartment of Electrical Engineering & Computer Science Ohio University, Athens, Ohio 457 E-mail: kodi@ohio.edu

More information

Universidad Carlos III de Madrid Digital Electronics Exercises

Universidad Carlos III de Madrid Digital Electronics Exercises 1. Complete the chronogram for the circuit given in the figure. inst7 NOT A INPUT VCC AND2 inst5 DFF D PRN Q CLRN inst XOR inst2 TFF PRN T Q CLRN inst8 OUTPUT OUTPUT Q Q1 CLK INPUT VCC CLEARN INPUT VCC

More information

CS6201 UNIT I PART-A. Develop or build the following Boolean function with NAND gate F(x,y,z)=(1,2,3,5,7).

CS6201 UNIT I PART-A. Develop or build the following Boolean function with NAND gate F(x,y,z)=(1,2,3,5,7). VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur-603203 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Academic Year: 2015-16 BANK - EVEN SEMESTER UNIT I PART-A 1 Find the octal equivalent of hexadecimal

More information

Computer Organization & Architecture Lecture #5

Computer Organization & Architecture Lecture #5 Computer Organization & Architecture Lecture #5 Shift Register A shift register is a register in which binary data can be stored and then shifted left or right when a shift signal is applied. Bits shifted

More information

Chapter Contents. Appendix A: Digital Logic. Some Definitions

Chapter Contents. Appendix A: Digital Logic. Some Definitions A- Appendix A - Digital Logic A-2 Appendix A - Digital Logic Chapter Contents Principles of Computer Architecture Miles Murdocca and Vincent Heuring Appendix A: Digital Logic A. Introduction A.2 Combinational

More information

ASYNCHRONOUS COUNTER CIRCUITS

ASYNCHRONOUS COUNTER CIRCUITS ASYNCHRONOUS COUNTER CIRCUITS Asynchronous counters do not have a common clock that controls all the Hipflop stages. The control clock is input into the first stage, or the LSB stage of the counter. The

More information

Principles of Computer Architecture. Appendix A: Digital Logic

Principles of Computer Architecture. Appendix A: Digital Logic A-1 Appendix A - Digital Logic Principles of Computer Architecture Miles Murdocca and Vincent Heuring Appendix A: Digital Logic A-2 Appendix A - Digital Logic Chapter Contents A.1 Introduction A.2 Combinational

More information

More on Flip-Flops Digital Design and Computer Architecture: ARM Edition 2015 Chapter 3 <98> 98

More on Flip-Flops Digital Design and Computer Architecture: ARM Edition 2015 Chapter 3 <98> 98 More on Flip-Flops Digital Design and Computer Architecture: ARM Edition 2015 Chapter 3 98 Review: Bit Storage SR latch S (set) Q R (reset) Level-sensitive SR latch S S1 C R R1 Q D C S R D latch Q

More information

CprE 281: Digital Logic

CprE 281: Digital Logic CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Registers and Counters CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev

More information

Sri Vidya College of Engineering And Technology. Virudhunagar Department of Electrical and Electronics Engineering

Sri Vidya College of Engineering And Technology. Virudhunagar Department of Electrical and Electronics Engineering Sri Vidya College of Engineering And Technology Virudhunagar 626 005 Department of Electrical and Electronics Engineering Year/ Semester/ Class : II/ III/ EEE Academic Year: 2017-2018 Subject Code/ Name:

More information

CHAPTER1: Digital Logic Circuits

CHAPTER1: Digital Logic Circuits CS224: Computer Organization S.KHABET CHAPTER1: Digital Logic Circuits 1 Sequential Circuits Introduction Composed of a combinational circuit to which the memory elements are connected to form a feedback

More information

FLIP-FLOPS AND RELATED DEVICES

FLIP-FLOPS AND RELATED DEVICES C H A P T E R 5 FLIP-FLOPS AND RELATED DEVICES OUTLINE 5- NAND Gate Latch 5-2 NOR Gate Latch 5-3 Troubleshooting Case Study 5-4 Digital Pulses 5-5 Clock Signals and Clocked Flip-Flops 5-6 Clocked S-R Flip-Flop

More information

DIGITAL CIRCUIT LOGIC UNIT 11: SEQUENTIAL CIRCUITS (LATCHES AND FLIP-FLOPS)

DIGITAL CIRCUIT LOGIC UNIT 11: SEQUENTIAL CIRCUITS (LATCHES AND FLIP-FLOPS) DIGITAL CIRCUIT LOGIC UNIT 11: SEQUENTIAL CIRCUITS (LATCHES AND FLIP-FLOPS) 1 iclicker Question 16 What should be the MUX inputs to implement the following function? (4 minutes) f A, B, C = m(0,2,5,6,7)

More information

Combinational / Sequential Logic

Combinational / Sequential Logic Digital Circuit Design and Language Combinational / Sequential Logic Chang, Ik Joon Kyunghee University Combinational Logic + The outputs are determined by the present inputs + Consist of input/output

More information

CS61C : Machine Structures

CS61C : Machine Structures CS 6C L4 State () inst.eecs.berkeley.edu/~cs6c/su5 CS6C : Machine Structures Lecture #4: State and FSMs Outline Waveforms State Clocks FSMs 25-7-3 Andy Carle CS 6C L4 State (2) Review (/3) (2/3): Circuit

More information

UNIT IV. Sequential circuit

UNIT IV. Sequential circuit UNIT IV Sequential circuit Introduction In the previous session, we said that the output of a combinational circuit depends solely upon the input. The implication is that combinational circuits have no

More information

YEDITEPE UNIVERSITY DEPARTMENT OF COMPUTER ENGINEERING. EXPERIMENT VIII: FLIP-FLOPS, COUNTERS 2014 Fall

YEDITEPE UNIVERSITY DEPARTMENT OF COMPUTER ENGINEERING. EXPERIMENT VIII: FLIP-FLOPS, COUNTERS 2014 Fall YEDITEPE UNIVERSITY DEPARTMENT OF COMPUTER ENGINEERING EXPERIMENT VIII: FLIP-FLOPS, COUNTERS 2014 Fall Objective: - Dealing with the operation of simple sequential devices. Learning invalid condition in

More information

To design a sequential logic circuit using D-Flip-flop. To implement the designed circuit.

To design a sequential logic circuit using D-Flip-flop. To implement the designed circuit. 6.1 Objectives To design a sequential logic circuit using D-Flip-flop. To implement the designed circuit. 6.2 Sequential Logic So far we have implemented digital circuits whose outputs depend only on its

More information

Find the equivalent decimal value for the given value Other number system to decimal ( Sample)

Find the equivalent decimal value for the given value Other number system to decimal ( Sample) VELAMMAL COLLEGE OF ENGINEERING AND TECHNOLOGY, MADURAI 65 009 Department of Information Technology Model Exam-II-Question bank PART A (Answer for all Questions) (8 X = 6) K CO Marks Find the equivalent

More information

Chapter. Synchronous Sequential Circuits

Chapter. Synchronous Sequential Circuits Chapter 5 Synchronous Sequential Circuits Logic Circuits- Review Logic Circuits 2 Combinational Circuits Consists of logic gates whose outputs are determined from the current combination of inputs. Performs

More information