Logic Design II (17.342) Spring Lecture Outline


 Bryce Waters
 8 months ago
 Views:
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 flipflops» 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 flipflops /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 nextstate equations for the flipflops 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 flipflop states will now depend on the input sequence which is applied to the circuit 12
13 Analysis of Clocked Sequential Circuits Flipflop 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 flipflop (Q) is needed Use a T Flipflop 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 flipflop 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 flipflop Q as a function of the present state and X For T flipflop 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 flipflop Q as a function of the present state and X For T flipflop 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 flipflop 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 flipflop 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 flipflops All flipflops reset to 0 unless otherwise specified 2. For the first input in the given sequence determine the circuit output(s) and flipflop inputs 3. Determine the new set of flipflop 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 flipflop states and the circuit output The circuit output may change at the time the flipflops 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 flipflops 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 flipflops All flipflops reset to 0 unless otherwise specified 2. For the first input in the given sequence determine the circuit output(s) and flipflop inputs 3. Determine the new set of flipflop 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 flipflop states A and B so Z may change either when the input changes or when the flipflops change state 69
70 Mealy Circuit Analysis Analyze the circuit below input sequence X= Initially flipflop 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= Flipflop 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 Flipflops 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 flipflop input equations and the output equations from the circuit 2. Derive the nextstate equation for each flipflop from its input equations using one of the following relations D flipflop Q + = D (131) DCE flipflop Q + = D CE + Q CE (132) T flipflop Q + = T Q (133) SR flipflop Q + = S + R Q (134) JK flipflop Q + = JQ + K Q (135) 81
82 State Tables and Graphs 3. Plot a nextstate map for each flipflop 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 flipflop 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 nextstate equations for the flipflops 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 nextstate map for each flipflop are combined to form the state table (transition table) The state table gives The next state of the flipflops 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 flipflops (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 flipflop 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 nextstate 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 nextstate 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 nbit 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 flipflop 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 flipflop output values are assigned for each state The flipflop 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 flipflops which serve as memory for the circuit and The combinational logic which realizes the input functions for the flipflops 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 flipflops used as memory This model emphasizes the presence of feedback in the sequential circuit because the flipflop 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 flipflops and prevents timing problems Gates in the combinational subcircuit have finite propagation delays Finite time is required before the flipflop inputs reach their final values Gate delays are not all the same If the next active clock edge does not occur until all flipflop input signals have reached their final steadystate values The unequal gate delays will not cause any timing problems 154
145 Clock Synchronization All flipflops which must change state do so at the same time in response to the active edge of the clock When the flipflops change state The new flipflop outputs are fed back into the combinational subcircuit No further change in the flipflop 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 flipflops change state and the flipflop 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 flipflop 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 flipflops the propagation delay in the combinational subcircuit and the setup time for the flipflops 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 flipflops 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 flipflops 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 nextstate function and the output function The nextstate 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
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 flipflop has the following characteristic table. Find the corresponding excitation table with don t cares used as much
More informationChapter 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 information1. 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 informationEECS150  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  Lec19fsm Page 1 Finite State Machines (FSMs) FSM circuits are a type of sequential
More informationDigital 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 informationDigital 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 informationCHAPTER 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 informationUnit 9 Latches and FlipFlops. Dept. of Electrical and Computer Eng., NCTU 1
Unit 9 Latches and FlipFlops 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 informationDIGITAL 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 informationChapter 5 Synchronous Sequential Logic
EEA051  Digital Logic 數位邏輯 Chapter 5 Synchronous Sequential Logic 吳俊興國立高雄大學資訊工程學系 December 2005 Chapter 5 Synchronous Sequential Logic 51 Sequential Circuits 52 Latches 53 FlipFlops 54 Analysis of
More informationObjectives. 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 informationThe basic logic gates are the inverter (or NOT gate), the AND gate, the OR gate and the exclusiveor 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 exclusiveor gate (XOR). If you put an inverter in front of the AND gate, you get the NAND gate etc. 2 One of the
More informationELE2120 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 informationComputer 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 informationCombinational / 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 informationINC 253 Digital and electronics laboratory I
INC 253 Digital and electronics laboratory I Laboratory 9 Sequential Circuit Author: ID CoAuthors: 1. ID 2. ID 3. ID Experiment Date: Report received Date: Comments For Instructor Full Marks Pre lab 10
More informationEXPERIMENT 13 ITERATIVE CIRCUITS
EE 2449 Experiment 13 Revised 4/17/2017 CALIFORNIA STATE UNIVERSITY LOS ANGELES Department of Electrical and Computer Engineering EE246 Digital Logic Lab EXPERIMENT 13 ITERATIVE CIRCUITS Text: Mano, Digital
More informationPractice Homework Problems for Module 3
Practice Homework Problems for Module 3. Given the following state transition diagram, complete the timing chart below. d 0 0 0 0d dd 0 d X Y A B 0 d0 00 0 A B X Y 2. Given the following state transition
More informationSynchronous 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 informationCHAPTER 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 informationMUHAMMAD NAEEM LATIF MCS 3 RD SEMESTER KHANEWAL
1. A stage in a shift register consists of (a) a latch (b) a flipflop (c) a byte of storage (d) from bits of storage 2. To serially shift a byte of data into a shift register, there must be (a) one click
More informationASYNCHRONOUS 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 informationComputer Architecture and Organization
A1 Appendix A  Digital Logic Computer Architecture and Organization Miles Murdocca and Vincent Heuring Appendix A Digital Logic A2 Appendix A  Digital Logic Chapter Contents A.1 Introduction A.2 Combinational
More informationMidterm Exam 15 points total. March 28, 2011
Midterm Exam 15 points total March 28, 2011 Part I Analytical Problems 1. (1.5 points) A. Convert to decimal, compare, and arrange in ascending order the following numbers encoded using various binary
More informationCHAPTER1: 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 informationDALHOUSIE UNIVERSITY Department of Electrical & Computer Engineering Digital Circuits  ECED 220. Experiment 4  Latches and FlipFlops
DLHOUSIE UNIVERSITY Department of Electrical & Computer Engineering Digital Circuits  ECED 0 Experiment  Latches and FlipFlops Objectives:. To implement an RS latch memory element. To implement a JK
More informationFor Teacher's Use Only Q Total No. Marks. Q No Q No Q No
FINALTERM EXAMINATION Spring 2010 CS302 Digital Logic Design (Session  4) Time: 90 min Marks: 58 For Teacher's Use Only Q 1 2 3 4 5 6 7 8 Total No. Marks Q No. 9 10 11 12 13 14 15 16 Marks Q No. 17 18
More information11.1 As mentioned in Experiment 10, sequential logic circuits are a type of logic circuit where the output
EE 2449 Experiment JL and NWP //8 CALIFORNIA STATE UNIVERSITY LOS ANGELES Department of Electrical and Computer Engineering EE2449 Digital Logic Lab EXPERIMENT SEQUENTIAL CIRCUITS Text: Mano and Ciletti,
More informationExperiment 8 Introduction to Latches and FlipFlops and registers
Experiment 8 Introduction to Latches and FlipFlops and registers Introduction: The logic circuits that have been used until now were combinational logic circuits since the output of the device depends
More informationELCT201: 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 6 Following the slides of Dr. Ahmed H. Madian ذو الحجة 1438 ه Winter
More informationEXPERIMENT: 1. Graphic Symbol: OR: The output of OR gate is true when one of the inputs A and B or both the inputs are true.
EXPERIMENT: 1 DATE: VERIFICATION OF BASIC LOGIC GATES AIM: To verify the truth tables of Basic Logic Gates NOT, OR, AND, NAND, NOR, ExOR and ExNOR. APPARATUS: mention the required IC numbers, Connecting
More informationELE2120 Digital Circuits and Systems. Tutorial Note 7
ELE2120 Digital Circuits and Systems Tutorial Note 7 Outline 1. Sequential Circuit 2. Gated SR Latch 3. Gated Dlatch 4. EdgeTriggered D FlipFlop 5. Asynchronous and Synchronous reset Sequential Circuit
More informationChapter 4. Logic Design
Chapter 4 Logic Design 4.1 Introduction. In previous Chapter we studied gates and combinational circuits, which made by gates (AND, OR, NOT etc.). That can be represented by circuit diagram, truth table
More informationName Of The Experiment: Sequential circuit design Latch, Flipflop and Registers
EEE 304 Experiment No. 07 Name Of The Experiment: Sequential circuit design Latch, Flipflop and Registers Important: Submit your Prelab at the beginning of the lab. Prelab 1: Construct a SR Latch and
More informationDecade Counters Mod5 counter: Decade Counter:
Decade Counters We can design a decade counter using cascade of mod5 and mod2 counters. Mod2 counter is just a single flipflop with the two stable states as 0 and 1. Mod5 counter: A typical mod5
More informationP U Q Q*
ECE 27 Learning Outcome 3   Practice Exam / Solution LEARNING OUTCOME #3: an ability to analyze and design sequential logic circuits. Multiple Choice select the single most appropriate response for each
More informationECE 331 Digital System Design
ECE 331 Digital System Design Counters (Lecture #20) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design, 6 th Edition, by Roth and Kinney, and were used
More informationECE 301 Digital Electronics
ECE 301 Digital Electronics Counters (Lecture #20) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design, 6 th Edition, by Roth and Kinney, and were used with
More informationDigital Logic Design ENEE x. Lecture 24
Digital Logic Design ENEE 244010x Lecture 24 Announcements Homework 9 due today Thursday Office Hours (12/10) from 2:304pm Course Evaluations at the end of class today. https://www.courseevalum.umd.edu/
More informationDIGITAL SYSTEM DESIGN UNIT I (2 MARKS)
DIGITAL SYSTEM DESIGN UNIT I (2 MARKS) 1. Convert Binary number (111101100) 2 to Octal equivalent. 2. Convert Binary (1101100010011011) 2 to Hexadecimal equivalent. 3. Simplify the following Boolean function
More informationCHAPTER 1 LATCHES & FLIPFLOPS
CHAPTER 1 LATCHES & FLIPFLOPS 1 Outcome After learning this chapter, student should be able to; Recognize the difference between latches and flipflops Analyze the operation of the flip flop Draw the output
More informationCARLETON UNIVERSITY. The TugofWar Game. Player 1 RESET
ARLETON UNIVERSITY Deparment of Electronics ELE 3500 Digital Electronics October 17, 2006. The TugofWar Game Rev 11. 1.0 The Game : Overview The players of this game see a row of 7 LEDs represented by
More informationIntroduction to Microprocessor & Digital Logic
ME262 Introduction to Microprocessor & Digital Logic (Sequential Logic) Summer 2 Sequential Logic Definition The output(s) of a sequential circuit depends d on the current and past states of the inputs,
More informationProblems with DLatch
Problems with Latch If changes while is true, the new value of will appear at the output. The latch is transparent. If the stored value can change state more than once during a single clock pulse, the
More informationFigure 1: segment of an unprogrammed and programmed PAL.
PROGRAMMABLE ARRAY LOGIC The PAL device is a special case of PLA which has a programmable AND array and a fixed OR array. The basic structure of Rom is same as PLA. It is cheap compared to PLA as only
More informationIntroduction. NAND Gate Latch. Digital Logic Design 1 FLIPFLOP. Digital Logic Design 1
2007 Introduction BK TP.HCM FLIPFLOP So far we have seen Combinational Logic The output(s) depends only on the current values of the input variables Here we will look at Sequential Logic circuits The
More informationECE 3401 Lecture 12. Sequential Circuits (II)
EE 34 Lecture 2 Sequential ircuits (II) Overview of Sequential ircuits Storage Elements Sequential circuits Storage elements: Latches & Flipflops Registers and counters ircuit and System Timing Sequential
More informationReport on 4bit Counter design Report 1, 2. Report on D Flipflop. Course project for ECE533
Report on 4bit Counter design Report 1, 2. Report on D Flipflop Course project for ECE533 I. Objective: REPORTI The objective of this project is to design a 4bit counter and implement it into a chip
More informationEE 121 June 4, 2002 Digital Design Laboratory Handout #34 CLK
EE 2 June 4, 22 igital esign Laboratory Handout #34 Midterm Examination #2 Solutions Open book, open notes. Time limit: 75 minutes. (2 points) Setup and hold times. The flipflops below have setup time
More informationEKT 121/4 ELEKTRONIK DIGIT 1
EKT 2/4 ELEKTRONIK DIGIT Kolej Universiti Kejuruteraan Utara Malaysia Sequential Logic Circuits  COUNTERS  LATCHES (review) SR R Latch SR R Latch ActiveLOW input INPUTS OUTPUTS S R Q Q COMMENTS Q
More informationLAB #4 SEQUENTIAL LOGIC CIRCUIT
LAB #4 SEQUENTIAL LOGIC CIRCUIT OBJECTIVES 1. To learn how basic sequential logic circuit works 2. To test and investigate the operation of various latch and flip flop circuits INTRODUCTIONS Sequential
More informationDeltaSigma ADC
http://www.allaboutcircuits.com/vol_4/chpt_13/9.html DeltaSigma ADC One of the more advanced ADC technologies is the socalled deltasigma, or Σ (using the proper Greek letter notation). In mathematics
More informationCprE 281: Digital Logic
CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ T FlipFlops & JK FlipFlops CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander
More informationPRE J. Figure 25.1a JK flipflop with Asynchronous Preset and Clear inputs
Asynchronous Preset and Clear Inputs The SR, JK and D inputs are known as synchronous inputs because the outputs change when appropriate input values are applied at the inputs and a clock signal is applied
More informationChapter 9. Timing Design. (Based on Chapter 7 and Chapter 8 of Wakerly) Data Path Comb. Logic. Reg. Reg. Reg C <= A + B
Chapter 9 Timing esign (Based on Chapter 7 and Chapter 8 of Wakerly) Timing Check X State machine Next State Logic * * 0 1 State Memory 0 1 EN Counter * 0 * Incrementer 1 0 1 A B Reg Reg ata Path Comb.
More informationENGN3213 Digital Systems and Microprocessors Sequential Circuits
ENGN3213 Digital Systems and Microprocessors Sequential Circuits 1 ENGN3213: Digital Systems and Microprocessors L#910 Why have sequential circuits? Sequential systems are time sequential devices  many
More informationWINTER 15 EXAMINATION Model Answer
Important Instructions to examiners: 1) The answers should be examined by key words and not as wordtoword as given in the model answer scheme. 2) The model answer and the answer written by candidate
More informationUNIT 1: DIGITAL LOGICAL CIRCUITS What is Digital Computer? OR Explain the block diagram of digital computers.
UNIT 1: DIGITAL LOGICAL CIRCUITS What is Digital Computer? OR Explain the block diagram of digital computers. Digital computer is a digital system that performs various computational tasks. The word DIGITAL
More informationSequential Circuits: Latches & FlipFlops
Sequential Circuits: Latches & FlipFlops Overview Storage Elements Latches SR, JK, D, and T Characteristic Tables, Characteristic Equations, Eecution Tables, and State Diagrams Standard Symbols FlipFlops
More information6. Sequential Logic FlipFlops
ection 6. equential Logic FlipFlops Page of 5 6. equential Logic FlipFlops ombinatorial components: their output values are computed entirely from their present input values. equential components: their
More informationECE 25 Introduction to Digital Design. Chapter 5 Sequential Circuits ( ) Part 1 Storage Elements and Sequential Circuit Analysis
EE 25 Introduction to igital esign hapter 5 Sequential ircuits (5.15.4) Part 1 Storage Elements and Sequential ircuit Analysis Logic and omputer esign Fundamentals harles Kime & Thomas Kaminski 2008 Pearson
More informationChapter 9. Design of Counters
Chapter 9 Design of Counters 9.0 Introduction Counter is another class of sequential circuits that tally a series of input pulses which may be regular or irregular in nature. Counter can be divided into
More informationCPSC 121: Models of Computation Lab #5: FlipFlops and Frequency Division
CPSC 121: Models of Computation Lab #5: FlipFlops and Frequency Division Objectives In this lab, you will see two types of sequential circuits: latches and flipflops. Latches and flipflops can be used
More informationSequential Logic and Clocked Circuits
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
More informationModule 4:FLIPFLOP. Quote of the day. Never think you are nothing, never think you are everything, but think you are something and achieve anything.
Module 4:FLIPFLOP Quote of the day Never think you are nothing, never think you are everything, but think you are something and achieve anything. Albert Einstein Sequential and combinational circuits
More information! Two inverters form a static memory cell " Will hold value as long as it has power applied
equential Logic! equential Circuits " imple circuits with feedback " Latches " Edgetriggered flipflops! Timing Methodologies " Cascading flipflops for proper operation " Clock skew! Basic egisters "
More informationModule for Lab #16: Basic Memory Devices
Module for Lab #16: Basic Memory evices evision: November 14, 2004 LAB Overview This lab introduces the concept of electronic memory. Memory circuits store the voltage present on an input signal (LHV or
More informationSequential Logic. Sequential Circuits. ! Timing Methodologies " Cascading flipflops for proper operation " Clock skew
equential Logic! equential Circuits " imple circuits with feedback " Latches " Edgetriggered flipflops! Timing Methodologies " Cascading flipflops for proper operation " Clock skew! Basic egisters "
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science
MASSACHUSETTS INSTITUTE OF TECHNOLOGY epartment of Electrical Engineering and Computer Science 6.374: Analysis and esign of igital Integrated Circuits Problem Set # 5 Fall 2003 Issued: 10/28/03 ue: 11/12/03
More informationModeling Latches and Flipflops
Lab Workbook Introduction Sequential circuits are digital circuits in which the output depends not only on the present input (like combinatorial circuits), but also on the past sequence of inputs. In effect,
More informationCHAPTER 4 RESULTS & DISCUSSION
CHAPTER 4 RESULTS & DISCUSSION 3.2 Introduction This project aims to prove that Modified BaughWooley Two s Complement Signed Multiplier is one of the high speed multipliers. The schematic of the multiplier
More informationFlipFlops A) Synchronization: Clocks and Latches B) Two Stage Latch C) Memory Requires Feedback D) Simple FlipFlop Gate
Lecture 19: November 5, 2001 Midterm in Class Wed. Nov 7 th Covers Material 6 th 10 th week including W#10 Closed Book, Closed Notes, Bring Calculator, Paper Provided Last Name AK 2040 Valley LSB; Last
More informationChapter 6 Registers and Counters
EEA051  Digital Logic 數位邏輯 Chapter 6 Registers and Counters 吳俊興國立高雄大學資訊工程學系 January 2006 Chapter 6 Registers and Counters 61 Registers 62 Shift Registers 63 Ripple Counters 64 Synchronous Counters
More informationESE 570 STATIC SEQUENTIAL CMOS LOGIC CELLS. Kenneth R. Laker, University of Pennsylvania, updated 25Mar15
ESE 570 STATIC SEQUENTIAL CMOS LOGIC CELLS 1 Classes of Logic Circuits two stable op. pts. Latch level triggered. FlipFlop edge triggered. one stable op. pt. Oneshot single pulse output no stable op.
More informationDigital Logic. ECE 206, Fall 2001: Lab 1. Learning Objectives. The Logic Simulator
Learning Objectives ECE 206, : Lab 1 Digital Logic This lab will give you practice in building and analyzing digital logic circuits. You will use a logic simulator to implement circuits and see how they
More informationPractice Homework Solution for Module 3
Practice Homework Solution for Module 3. Given the following state transition diagram, complete the timing chart below. d d dd d X Y A B d A B X Y MODULE 3 PRACTICE HOMEWORK SOLUTION Page 2. Given the
More informationEKT 121/4 ELEKTRONIK DIGIT 1
EKT 121/4 ELEKTRONIK DIGIT 1 Kolej Universiti Kejuruteraan Utara Malaysia Bistable Storage Devices and Related Devices Introduction Latches and flipflops are the basic singlebit memory elements used
More informationReview of FlipFlop. Divya Aggarwal. Student, Department of Physics and AstroPhysics, University of Delhi, New Delhi. their state.
pp. 49 Krishi Sanskriti Publications http://www.krishisanskriti.org/jbaer.html Review of FlipFlop Divya Aggarwal Student, Department of Physics and AstroPhysics, University of Delhi, New Delhi Abstract:
More informationSection I: Digital System Analysis and Review
Section I: Digital System Analysis and Review CEG 36/56; EE 45/65 Digital System Design Dr. Travis Doom, Assistant Professor Department of Computer Science and Engineering Wright State University Thanks
More information2.6 Reset Design Strategy
2.6 Reset esign Strategy Many design issues must be considered before choosing a reset strategy for an ASIC design, such as whether to use synchronous or asynchronous resets, will every flipflop receive
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Sciences
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Sciences Introductory Digital Systems Lab (6.111) Quiz #2  Spring 2003 Prof. Anantha Chandrakasan and Prof. Don
More informationIn this lecture we will work through a design example from problem statement to digital circuits.
Lecture : A Design Example  Traffic Lights In this lecture we will work through a design example from problem statement to digital circuits. The Problem: The traffic department is trying out a new system
More informationContents Slide Set 6. Introduction to Chapter 7 of the textbook. Outline of Slide Set 6. An outline of the first part of Chapter 7
CM 69 W4 Section Slide Set 6 slide 2/9 Contents Slide Set 6 for CM 69 Winter 24 Lecture Section Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary
More informationCS150 Fall 2012 Solutions to Homework 4
CS150 Fall 2012 Solutions to Homework 4 September 23, 2012 Problem 1 43 CLBs are needed. For one bit, the overall requirement is to simulate an 11LUT with its output connected to a flipflop for the state
More informationModeling Latches and Flipflops
Lab Workbook Introduction Sequential circuits are the digital circuits in which the output depends not only on the present input (like combinatorial circuits), but also on the past sequence of inputs.
More informationProject 6: Latches and flipflops
Project 6: Latches and flipflops Yuan Ze University epartment of Computer Engineering and Science Copyright by RungBin Lin, 1999 All rights reserved ate out: 06/5/2003 ate due: 06/25/2003 Purpose: This
More informationAsynchronous counters
Asynchronous counters In the previous section, we saw a circuit using one JK flipflop that counted backward in a twobit binary sequence, from 11 to 10 to 01 to 00. Since it would be desirable to have
More informationLaboratory Exercise 7
Laboratory Exercise 7 Finite State Machines This is an exercise in using finite state machines. Part I We wish to implement a finite state machine (FSM) that recognizes two specific sequences of applied
More informationBachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 151) Pass Marks: 24
2065 Computer Science and Information Technology (CSc. 151) Pass Marks: 24 Time: 3 hours. Candidates are required to give their answers in their own words as for as practicable. Attempt any TWO questions:
More informationECE 3401 Lecture 11. Sequential Circuits
EE 3401 Lecture 11 Sequential ircuits Overview of Sequential ircuits Storage Elements Sequential circuits Storage elements: Latches & Flipflops Registers and counters ircuit and System Timing Sequential
More informationFE REVIEW LOGIC. The AND gate. The OR gate A B AB A B A B 0 1 1
FE REVIEW LOGIC The AD gate f A, B AB The AD gates output will achieve its active state, ACTIVE HIGH, when BOTH of its inputs achieve their active state, ACTIVE E HIGH. A B AB f ( A, B) AB m (3) The OR
More informationOperating Manual Ver.1.1
Johnson Counter Operating Manual Ver.1.1 An ISO 9001 : 2000 company 94101, Electronic Complex Pardesipura, Indore 452010, India Tel : 91731 2570301/02, 4211100 Fax: 91731 2555643 e mail : info@scientech.bz
More informationSide Street. Traffic Sensor. Main Street. Walk Button. Traffic Lights
6.111 Laboratory 2 1 Laboratory 2 Finite State Machines Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.111  Introductory Digital Systems Laboratory Handout
More informationCopyright 2011 by Enoch Hwang, Ph.D. and Global Specialties. All rights reserved. Printed in Taiwan.
Copyright 2011 by Enoch Hwang, Ph.D. and Global Specialties All rights reserved. Printed in Taiwan. No part of this publication may be reproduced, stored in a retrieval system or transmitted, in any form
More informationLaboratory 1  Introduction to Digital Electronics and Lab Equipment (Logic Analyzers, Digital Oscilloscope, and FPGAbased Labkit)
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.  Introductory Digital Systems Laboratory (Spring 006) Laboratory  Introduction to Digital Electronics
More informationData Conversion and Lab (17.368) Fall Lecture Outline
Data Conversion and Lab (17.368) Fall 2013 Lecture Outline Class # 11 November 14, 2013 Dohn Bowden 1 Today s Lecture Outline Administrative Detailed Technical Discussions Lab Microcontroller and Sensors
More informationRegisters & Counters. Logic and Digital System Design  CS 303 Erkay Savaş Sabanci University
Registers & ounters Logic and igital System esign  S 33 Erkay Savaş Sabanci University Registers Registers like counters are clocked sequential circuits A register is a group of flipflops Each flipflop
More informationDigital Systems Based on Principles and Applications of Electrical Engineering/Rizzoni (McGraw Hill
Digital Systems Based on Principles and Applications of Electrical Engineering/Rizzoni (McGraw Hill Objectives: Analyze the operation of sequential logic circuits. Understand the operation of digital counters.
More informationNotes on Digital Circuits
PHYS 331: Junior Physics Laboratory I Notes on Digital Circuits Digital circuits are collections of devices that perform logical operations on two logical states, represented by voltage levels. Standard
More informationRegisters, Register Transfers and Counters Dr. Fethullah Karabiber
36 OMPUTER HARWARE Registers, Register Transfers and ounters r. Fethullah Karabiber Overview 2 Registers, Microoperations and Implementations Registers and load enable Register transfer operations Microoperations
More information