Synchronous Sequential Logic Part I
|
|
|
- Melvyn Booker
- 5 years ago
- Views:
Transcription
1 Synchronous Sequential Logic Part I Mantıksal Tasarım BBM23 section instructor: Ufuk Çelikcan
2 Sequential Logic Digital circuits we have learned, so far, have been combinational no memory, outputs are entirely defined by the current inputs However, many digital systems encountered in everyday life are sequential (i.e. they have memory) the memory elements remember past inputs outputs of sequential circuits are not only dependent on the current input but also the state of the memory elements. 2
3 Sequential Circuits Model inputs Combinational Circuit outputs current state next state Memory Elements 3 current state is a function of past inputs + initial state
4 Classification There are 2 types of sequential circuits. Synchronous Signals affect the memory elements at discrete instants of time. Discrete instants of time requires synchronization. Synchronization is usually achieved through the use of a common clock. A clock generator is a device that generates a periodic train of pulses. 4
5 Classification. Synchronous The state of the memory elements are updated with the arrival of each pulse This type of logical circuit is also known as clocked sequential circuits. 2. Asynchronous No clock Behavior of an asynchronous sequential circuit depends upon the input signals at any instant of time and the order in which the inputs change. Memory elements in asynchronous circuits are regarded as time-delay elements 5
6 Clocked Sequential Circuits Memory elements are flip-flops which are logic devices, each of which is capable of storing one bit of information. inputs Combinational Circuit outputs current state next state clock Flip-Flops 6
7 Clocked Sequential Circuits The outputs of a clocked sequential circuit can come from the combinational circuit, the outputs of the flip-flops or both. The state of the flip-flops can change only during a clock pulse transition i.e. low-to-high and high-to-low clock edge When the clock maintains its value, the flip-flop output does not change The transition from one state to the next occurs at the clock edge. 7
8 Machine Machine ( Inputs {X}, States {D}, Outputs {Z}, Output Function {F : X D Z}, Next State Function {G : X D D} ) 8
9 Representation with State Diagram d d 2 x x 2 x i x l d i d j,z d r- d r 9
10 Assign a Node to Each State x k /z k x p /z p d i d j Machine is at state d i, input x k comes, the next state will be again d i and the output is z k Machine is at state d i, input x p comes, the next state will be d j and the output is z p
11 Assign a Node to Each State?/??/??? Machine is at state d m, input x t comes, the next state will be again d m and the output is z t Machine is at state d m, input x u comes, the next state will be d n and the output is z u
12 Notation Let Ik be an input sequence with length equal to k, i.e. Ik = xx2 xk f(ik,di) = zz2 zk g(ik,di) = didi2 dik is an output sequence is a state sequence di Ik dik : Follower of di after the input sequence Ik 2
13 Example - Fill out the rest A E, D, B F, D, C E, B, D F, B, E C, F, F B, C, A D B E C F 3
14 Example A E, D, B F, D, C E, B, D F, B, E C, F, F B, C, Let I5=, find g(i5,c) and f(i5,c) I5 g(i5,c) f(i5,c) I5 follower of C :? 4
15 Example A E, D, B F, D, C E, B, D F, B, E C, F, F B, C, Let I5=, find g(i5,c) and f(i5,c) I5 g(i5,c) C B F C B F f(i5,c) I5 follower of C is F 5
16 D Flip-Flop clk D C D FF Q Positive edge-triggered D Flip-Flop Characteristic equation Q(t+) = D D Q(t+) Characteristic Table 6
17 Timing Diagram of D Flip-Flop
18 8 Other Flip-Flops D flip-flop is the most common since it requires the fewest number of gates to construct. Two other widely used flip-flops JK flip-flops T flip-flops JK flip-flops Three FF operations. Set 2. Reset 3. Complement
19 JK Flip-Flops J K C Q J K Q(t+) next state Q(t) no change Reset Set Q (t) Complement Characteristic Table Characteristic Equation of JK flip-flop? 9
20 JK Flip-Flops 2 J Q C K J K Q(t) Q(t+) J K Q(t+) next state Q(t) no change Reset Set Q (t) Complement Characteristic Table
21 JK Flip-Flops J Q C K J K Q(t) Q(t+) J K Q(t+) next state Q(t) no change Reset Set Q (t) Complement Characteristic Table K,Q(t) J 2 Q(t+) =?
22 JK Flip-Flops J Q C K J K Q(t) Q(t+) J K Q(t+) next state Q(t) no change Reset Set Q (t) Complement Characteristic Table K,Q(t) J 22 Q(t+) =?
23 JK Flip-Flops J K C Q J K Q(t+) next state Q(t) no change Reset Set Q (t) Complement Characteristic Table Characteristic equation Q(t+) = JQ (t) + K Q(t) 23
24 T (Toggle) Flip-Flop Complementing flip-flop T C Q T Q(t+) next state Q(t) no change Q (t) Complement Characteristic Table Characteristic equation Q(t+) =? T J Q T D Q C C K 24
25 T (Toggle) Flip-Flop Complementing flip-flop T C Q T Q(t+) next state Q(t) no change Q (t) Complement Characteristic Table Characteristic equation Q(t+) = Q(t) T T J Q T D Q C C K 25
26 Characteristic Equations The logical properties of a flip-flop can be expressed algebraically using characteristic equations : D flip-flop Q(t+) = D JK flip-flop Q(t+) = JQ (t) + K Q(t) T flip-flop Q(t+) = Q(t) T 26
27 What if we have Q(t+) and Q(t), and looking for J and K values? Q(t)Q(t+) J,K,X,X X, X, J= K= Q(t+) X Q(t+) X Q(t)= Q(t)= Q(t)= Q(t)= 27
28 What if we have Q(t+) and Q(t), and looking for D value? Q(t)Q(t+) D D= Q(t+) 28
29 What if we have Q(t+) and Q(t), and looking for T value? Q(t)Q(t+) T T= Q(t) Q(t+) 29
30 Asynchronous Inputs of Flip-Flops They are used to force the flip-flop to a particular state independent of clock Preset (direct set) set FF state to Clear (direct reset) set FF state to They are especially useful at startup. In digital circuits when the power is turned on, the state of flip-flops are unknown. Asynchronous inputs are used to bring all flip-flops to a known starting state prior to clock operation. 3
31 Asynchronous Inputs data D Q clk C R D reset Q reset reset C D Q Q X X Starting State 3
32 Analysis of Clocked Sequential Circuits Goal: to determine the behavior of clocked sequential circuits Behavior is determined from Inputs Outputs State of the flip-flops We have to obtain Boolean expressions for output and next state output & state equations (state) table (state) diagram 32
33 Analyze the circuit
34 Run it and check the timing diagram
35
36 State Equations Also known as transition equations specify the next state as a function of the present state and inputs Example A(t+) D Q A x C A B(t+) D Q B C B y 36 clk
37 Output and State Equations A(t+) = B(t+) = y = input of a flip-flop determines the value of the next state (i.e., the state reached after the clock transition) A(t+) D Q A x C A B(t+) D Q B C B 37 clk y
38 Output and State Equations A(t+) = ( A(t) B(t) ) x B(t+) = (B(t)) x y = A(t)B(t) x A(t+) D Q A x C A B(t+) D Q B C B 38 clk y
39 Flip Flop Input Equations Flip-Flop input (excitation) equations Same as the state equations in D flip-flops 39
40 Example: State (Transition) Table A(t+) = B(t+) = y = ( AB + A B ) x B x ABx Present state input Next state output A B x A B y A sequential circuit with m FFs and n inputs needs 2 m+n rows in the transition table 4
41 4 Example: State (Transition) Table y B A x B A output Next state input Present state A sequential circuit with m FFs and n inputs needs 2 m+n rows in the transition table A(t+) = B(t+) = y = ( AB + A B ) x B x ABx
42 Example: State Diagram Present state input Next state output A B x A B y What is this circuit doing? State diagram provides the same information as state table 42
43 Example: State Diagram / / / / / / / / Present state What is this circuit doing? input Next state output A B x A B y State diagram provides the same information as state table 43
44 44 Analysis with JK Flip-Flops For a D flip-flop, the state equation is the same as the flip-flop input equation Q(t+) = D For JK flip-flops, situation is different Goal is to find state equations Method. determine flip-flop input equations 2. List the binary values of each input equation 3. Use the corresponding flip-flop characteristic table to determine the next state values in the state table
45 Example: Analysis with JK FFs x J A J Q A K A K C clk J B JD C K Q B K B y Flip-flop input equations J A = and K A = 45 J B = and K B =
46 Example: Analysis with JK FFs J A = Bx and K A = x +B J B = x and K B = present State input next state FF inputs A B x A B J A K A J B K B 46
47 47 Example: Analysis with JK FFs J A = Bx and K A = x +B J B = x and K B = K B J B K A J A B A x B A FF inputs next state input present State Characteristic equations A(t+) =? B(t+) =? y =?
48 Example: Analysis with JK FFs Characteristic equations A(t+) = J A A + K A A B(t+) = J B B + K B B y = ABx Input equations J A = Bx and K A = x +B J B = x and K B = State equations A(t+) = = B(t+) = 48
49 Example: Analysis with JK FFs Characteristic equations A(t+) = J A A + K A A B(t+) = J B B + K B B y = ABx Input equations J A = Bx and K A = x +B J B = x and K B = State equations A(t+) B(t+) = A Bx + (x +B) A = A Bx + AB x = (A B) x = B x 49
50 State Diagram Present state input Next state output A B x A B y 5 What is the circuit doing?
51 State Diagram / / / / / / / / Present state input Next state output A B x A B y 5 What is the circuit doing?
52 Analysis with T Flip-Flops Method is the same Example T A = T B = x T A T Q A y C A(t+) = B(t+) = clk T B TD C Q B y reset y = A y = B 52
53 Example: Analysis with T Flip-Flops Characteristic equation A(t+) = T A A B(t+) = T B B Input equations T A = Bx T B = x Output equations y = A y = B State equations A(t+) = B(t+) = 53
54 A(t+) = xb A B(t+) = x B y = A; y = B State Table & Diagram Present state input Next state output A B x A B y y 54
55 A(t+) = xb A B(t+) = x B y = A; y = B State Table & Diagram Present state input Next state output A B x A B y y 55
56 State Table & Diagram A(t+) = xb A B(t+) = x B y = A; y = B Present state input Next state output A B x A B y y 56
57 Mealy and Moore Models There are two models for sequential circuits Mealy Moore They differ in the way the outputs are generated Mealy: output is a function of both present states and inputs Moore output is a function of present state only 57
58 Example: Mealy and Moore Machines x y clock D C Q C reset S a Mealy machine External inputs x and y are asynchronous Thus, outputs may have momentary (incorrect) values Inputs must be synchronized with clocks Outputs must be sampled only during clock edges 58
59 Example: Moore Machines x T C Q A y clk TD C Q B reset Outputs are already synchronized with clock. They change synchronously with the clock edge. 59
60 Design Example - Implement the following state diagram with D FFs. / / / / x Q(t) Q(t+) D Z 6
61 Design Example - Implement the following state diagram with D FFs. / / / / x Q(t) Q(t+) D Z 6
62 Design Example - Implement the following state diagram with D FFs. / / / / x Q(t) Q(t+) D Z 62
63 Design Example - Implement the following state diagram with D FFs. / / / / x D Q Z clk x Q(t) Q(t+) D Z 63
64 Design Example - 2 Design a sequential circuit that counts up (,,,,, ) when x=, and counts down (,,,,, ) when x=. Use JK FFs. 64
65 Design Example - 2 Design a sequential circuit that counts up (,,,,, ) when x=, and counts down (,,,,, ) when x=. Use JK FFs. 65
66 Design Example - 2 Design a sequential circuit that counts up (,,,,, ) when x=, and counts down (,,,,, ) when x=. Use JK FFs. x= x= x= x= x= 66
67 Design Example - 2 x A B A(t+) B(t+) JA KA JB KB x= x= x= x= x= 67
68 Design Example - 2 x A B A(t+) B(t+) JA KA JB KB x= x= x= x= x= 68
69 Design Example - 2 x A B A(t+) B(t+) JA KA JB KB Q(t+) Q(t)= J= X Q(t)= x= x= x= x= x= K= 69 Q(t+) X Q(t)= Q(t)=
70 Design Example - 2 x A B A(t+) B(t+) JA KA JB KB X X X X Q(t+) Q(t)= J= X Q(t)= x= x= x= x= x= K= 7 Q(t+) X Q(t)= Q(t)=
71 Design Example - 2 x A B A(t+) B(t+) JA KA JB KB X X X X X X X X Q(t+) Q(t)= J= X Q(t)= x= x= x= x= x= K= 7 Q(t+) X Q(t)= Q(t)=
72 Design Example - 2 x A B A(t+) B(t+) JA KA JB KB X X X X X X X X X X X X Q(t+) Q(t)= J= X Q(t)= x= x= x= x= x= K= 72 Q(t+) X Q(t)= Q(t)=
73 Design Example - 2 x A B A(t+) B(t+) JA KA JB KB X X X X X X X X X X X X X X X X Q(t+) Q(t)= J= X Q(t)= x= x= x= x= x= K= 73 Q(t+) X Q(t)= Q(t)=
74 Design Example - 2 x A B A(t+) B(t+) JA KA JB KB X X X X X X X X X X X X X X X X x= x= x= x= x= J A =? K A =? J B =? K B =? 74
75 Design Example - 2 x A B A(t+) B(t+) JA KA JB KB X X X X X X X X X X X X X X X X x= x= x= x= x= AB x X X AB x X X 75 X X X X
76 Design Example - 2 JA = xb+x B KA = xb+x B JB= KB= Let s draw the circuit 76
77 Design Example - 3 OUTPUTS: design with JK flip-flops STATE TRANSITIONS: 77
78 Design Example - 3 A(t) B(t) C(t) A (t+) B (t+) C (t+) z z2 z3 z4 z5 z6 JA KA JB KB JC KC J= Q(t+) X Q(t)= Q(t)= K= Q(t+) X Q(t)= Q(t)= Mealy or Moore? 78
79 Design Example - 3 A B C A(t) B(t) C(t) (t+) (t+) (t+) z z2 z3 z4 z5 z6 JA KA JB KB JC KC J= Q(t+) X Q(t)= Q(t)= K= Q(t+) X Q(t)= Q(t)= 79
80 Design Example - 3 A B C A(t) B(t) C(t) (t+) (t+) (t+) z z2 z3 z4 z5 z6 JA KA JB KB JC KC J= Q(t+) X Q(t)= Q(t)= K= Q(t+) X Q(t)= Q(t)= 8
81 Design Example - 3 A B C A(t) B(t) C(t) (t+) (t+) (t+) z z2 z3 z4 z5 z6 JA KA JB KB JC KC X X X X X X X J= Q(t+) X Q(t)= Q(t)= K= Q(t+) X Q(t)= Q(t)= 8
82 Design Example - 3 A B C A(t) B(t) C(t) (t+) (t+) (t+) z z2 z3 z4 z5 z6 JA KA JB KB JC KC X X X X X X X J= Q(t+) X Q(t)= Q(t)= K= Q(t+) X Q(t)= Q(t)= 82
83 Design Example - 3 A B C A(t) B(t) C(t) (t+) (t+) (t+) z z2 z3 z4 z5 z6 JA KA JB KB JC KC X X X X X X X X X X X X X X X X X X J= Q(t+) X Q(t)= Q(t)= K= Q(t+) X Q(t)= Q(t)= 83
84 Design Example - 3 A B C A(t) B(t) C(t) (t+) (t+) (t+) z z2 z3 z4 z5 z6 JA KA JB KB JC KC X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X BC A BC A X X X X X X X X X X 84 JA= KA=
85 Design Example - 3 A B C A(t) B(t) C(t) (t+) (t+) (t+) z z2 z3 z4 z5 z6 JA KA JB KB JC KC X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X BC A BC A X X X X X X X X X X 85 JA=BC KA=C
86 Design Example - 3 A B C A(t) B(t) C(t) (t+) (t+) (t+) z z2 z3 z4 z5 z6 JA KA JB KB JC KC X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X BC A X X BC A X X X X X X X X 86 JB= KB=
87 Design Example - 3 A B C A(t) B(t) C(t) (t+) (t+) (t+) z z2 z3 z4 z5 z6 JA KA JB KB JC KC X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X BC A X X BC A X X X X X X X X 87 JB=A C KB=C
88 Design Example - 3 A B C A(t) B(t) C(t) (t+) (t+) (t+) z z2 z3 z4 z5 z6 JA KA JB KB JC KC X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X BC A X X BC A X X X X X X X X 88 JC= KC=
89 Design Example - 3 A B C A(t) B(t) C(t) (t+) (t+) (t+) z z2 z3 z4 z5 z6 JA KA JB KB JC KC X X X X X X X X X X X X X X X X X X X X X X X X X X X X X X BC A X X BC A X X X X X X X X 89 JC= KC=
90 Design Example - 3 JA QA JB QB JC QC C C C KA KB KC 9 We can also solve for outputs z-z6 by looking at K-maps of A(t),B(t),C(t)
91 Design Example - 3 A B C A(t) B(t) C(t) (t+) (t+) (t+) z z2 z3 z4 z5 z6 JA KA JB KB JC KC JA=BC JB=A C JC= KA=C KB=C KC= 9
92 Design Example - 3 A B C A(t) B(t) C(t) (t+) (t+) (t+) z z2 z3 z4 z5 z6 JA KA JB KB JC KC JA=BC JB=A C JC= KA=C KB=C KC= 92
93 Design Example - 3 A B C A(t) B(t) C(t) (t+) (t+) (t+) z z2 z3 z4 z5 z6 JA KA JB KB JC KC JA=BC JB=A C JC= A(t+)=BCA +C A B(t+)=A CB +C B C(t+)=C KA=C KB=C KC= 93
94 Design Example - 3 A B C A(t) B(t) C(t) (t+) (t+) (t+) z z2 z3 z4 z5 z6 JA KA JB KB JC KC 94
95 Design Example - 3 now let s redo the design with D FFs 95
96 Design Example - 3 A B C A(t) B(t) C(t) (t+) (t+) (t+) z z2 z3 z4 z5 z6 DA DB DC A(t+)=BCA +C A = B(t+)=A CB +C B = C(t+)=C = 96
97 Design Example - 3 A B C A(t) B(t) C(t) (t+) (t+) (t+) z z2 z3 z4 z5 z6 DA DB DC A(t+)=BCA +C A = DA B(t+)=A CB +C B = DB C(t+)=C = DC 97
98 Design Example - 3 A B C A(t) B(t) C(t) (t+) (t+) (t+) z z2 z3 z4 z5 z6 DA DB DC A(t+)=BCA +C A = DA B(t+)=A CB +C B = DB C(t+)=C = DC 98
99 Design Example - 4 Design a logic circuit with JK flip-flops that detects the sequence and outputs in that case, otherwise. 99
100 Design Example - 4?
101 Design Example - 4
102 Design Example - 4 X
103 Design Example - 4 I.C.
104 Design Example - 4 consider the sequence:
105 consider the sequence: I.C. ()
106 Design Example - 4 / / / / / I.C. / / 6 /
107 Design Example - 4 now we represent with states / / / / / / / 7 /
108 Design Example - 4 x(t) A(t) B(t) A B (t+) (t+) Z JA KA JB KB 8
109 Design Example - 4 A B x(t) A(t) B(t) (t+) (t+) 9 Z JA KA JB KB
110 Design Example - 4 A B x(t) A(t) B(t) (t+) (t+) Z JA KA JB KB X X X X X X X X X X X X X X X X
111 Design Example - 4 AB x AB x JA= AB x KA= AB x JB= KB=
112 Design Example - 4 AB x X X X X JA=x B AB x X X X X JB=x AB x X X X X KA=xB+x B AB x X X X X KB=x 2
113 Design Example - 4 JA QA JB QB C C KA KB 3
114 Design Example - 4 DA QA DB QB C C 4
Synchronous Sequential Logic Part I. BME208 Logic Circuits Yalçın İŞLER
Synchronous Sequential Logic Part I BME28 Logic Circuits Yalçın İŞLER islerya@yahoo.com http://me.islerya.com Sequential Logic Digital circuits we have learned, so far, have been combinational no memory,
Chapter 5 Synchronous Sequential Logic
Chapter 5 Synchronous Sequential Logic Sequential circuit: A circuit that includes memory elements. In this case the output depends not only on the current input but also on the past inputs. Memory A synchronous
Analysis and Design of Sequential Circuits: Examples
COSC3410 Analysis and Design of Sequential Circuits: Examples J. C. Huang Department of Computer Science University of Houston Sequential machine slide 1 inputs combinational circuit outputs memory elements
Synchronous Sequential Logic
1 IT 201 DIGITAL SYSTEMS DESIGN MODULE4 NOTES Synchronous Sequential Logic Sequential Circuits - A sequential circuit consists of a combinational circuit and a feedback through the storage elements in
Sequential Synchronous Circuit Analysis
Sequential Synchronous Circuit Analysis General Model Current State at time (t) is stored in an array of flip-flops. Next State at time (t+1) is a Boolean function of State and Inputs. Outputs at time
Digital Logic and Design (Course Code: EE222) Lecture 19: Sequential Circuits Contd..
Indian Institute of Technology Jodhpur, Year 2017-2018 Digital Logic and Design (Course Code: EE222) Lecture 19: Sequential Circuits Contd.. Course Instructor: Shree Prakash Tiwari Email: sptiwari@iitj.ac.in
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 7 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 7 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering SEQUENTIAL CIRCUITS: LATCHES Overview Circuits require memory to store intermediate
Lecture (08) Synchronous Sequential Logic
Lecture (08) Synchronous Sequential Logic By: Dr. Ahmed ElShafee ١ Dr. Ahmed ElShafee, ACU : Spring 2018, CSE303 Logic design II Analysis of Clocked Sequential Circuits The behavior of a clocked sequential
Different encodings generate different circuits
FSM State Encoding Different encodings generate different circuits no easy way to find best encoding with fewest logic gates or shortest propagation delay. Binary encoding: K states need log 2 K bits i.e.,
Chapter 4 Part 2 Sequential Circuits
University of Wisconsin - Madison ECE/Comp Sci 352 Digital Systems Fundamentals Kewal K. Saluja and Yu Hen Hu Spring 2002 Chapter 4 Part 2 Sequential Circuits Originals by: Charles R. Kime and Tom Kamisnski
Sequential Circuit Design
Sequential Circuit esign esign Procedure. Specification 2. Formulation Obtain a state diagram or state table 3. State Assignment Assign binary codes to the states 4. Flip-Flop Input Equation etermination
Finite State Machine. By : Ali Mustafa
Finite State Machine By : Ali Mustafa So Far We have covered the memory elements issue and we are ready to implement the sequential circuits. We need to know how to Deal(analyze) with a sequential circuit?
Sequential Circuit Analysis
Sequential Circuit Analysis Last time we started talking about latches and flip-flops, which are basic one-bit memory units. Today we ll talk about sequential circuit analysis and design. First, we ll
ELE2120 Digital Circuits and Systems. Tutorial Note 9
ELE2120 Digital Circuits and Systems Tutorial Note 9 Outline 1. Exercise(1) Sequential Circuit Analysis 2. Exercise (2) Sequential Circuit Analysis 3. Exercise (3) Sequential Circuit Analysis 4. Ref. Construction
King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department
King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department Page 1 of 13 COE 202: Digital Logic Design (3-0-3) Term 112 (Spring 2012) Final
3. Complete the following table of equivalent values. Use binary numbers with a sign bit and 7 bits for the value
EGC22 Digital Logic Fundamental Additional Practice Problems. Complete the following table of equivalent values. Binary. Octal 35.77 33.23.875 29.99 27 9 64 Hexadecimal B.3 D.FD B.4C 2. Calculate the following
Sequential vs. Combinational
Sequential Circuits Sequential vs. Combinational Combinational Logic: Output depends only on current input TV channel selector (-9) inputs system outputs Sequential Logic: Output depends not only on current
The Design Procedure. Output Equation Determination - Derive output equations from the state table
The Design Procedure Specification Formulation - Obtain a state diagram or state table State Assignment - Assign binary codes to the states Flip-Flop Input Equation Determination - Select flipflop types
Sequential Circuits Sequential circuits combinational circuits state gate delay
Sequential Circuits Sequential circuits are those with memory, also called feedback. In this, they differ from combinational circuits, which have no memory. The stable output of a combinational circuit
Lecture 8: Sequential Networks and Finite State Machines
Lecture 8: Sequential Networks and Finite State Machines CSE 140: Components and Design Techniques for Digital Systems Spring 2014 CK Cheng, Diba Mirza Dept. of Computer Science and Engineering University
CprE 281: Digital Logic
CprE 281: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Synchronous Sequential Circuits Basic Design Steps CprE 281: Digital Logic Iowa State University, Ames,
Philadelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, Second Semester: 2015/2016 Dept. of Computer Engineering Course Title: Logic Circuits Date: 08/06/2016
CHW 261: Logic Design
CHW 26: Logic Design Instructors: Prof. Hala Zayed Dr. Ahmed Shalaby http://www.bu.edu.eg/staff/halazayed4 http://bu.edu.eg/staff/ahmedshalaby4# Slide Digital Fundamentals CHAPTER 8 Counters Slide 2 Counting
Chapter 7 Sequential Logic
Chapter 7 Sequential Logic SKEE2263 Digital Systems Mun im/ismahani/izam {munim@utm.my,e-izam@utm.my,ismahani@fke.utm.my} March 28, 2016 Table of Contents 1 Intro 2 Bistable Circuits 3 FF Characteristics
COE 202: Digital Logic Design Sequential Circuits Part 4. Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
COE 202: Digital Logic Design Sequential Circuits Part 4 Dr. Ahmad Almulhem Email: ahmadsm AT kfupm Phone: 860-7554 Office: 22-324 Objectives Registers Counters Registers 0 1 n-1 A register is a group
11.1 As mentioned in Experiment 10, sequential logic circuits are a type of logic circuit where the output of
EE 2449 Experiment 11 Jack Levine and Nancy Warter-Perez CALIFORNIA STATE UNIVERSITY LOS ANGELES Department of Electrical and Computer Engineering EE-2449 Digital Logic Lab EXPERIMENT 11 SEQUENTIAL CIRCUITS
COE 202: Digital Logic Design Sequential Circuits Part 3. Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
COE 202: Digital Logic Design Sequential Circuits Part 3 Dr. Ahmad Almulhem Email: ahmadsm AT kfupm Phone: 860-7554 Office: 22-324 Objectives Important Design Concepts State Reduction and Assignment Design
Topic 8: Sequential Circuits
Topic 8: Sequential Circuits Readings : Patterson & Hennesy, Appendix B.4 - B.6 Goals Basic Principles behind Memory Elements Clocks Applications of sequential circuits Introduction to the concept of the
Lecture 10: Synchronous Sequential Circuits Design
Lecture 0: Synchronous Sequential Circuits Design. General Form Input Combinational Flip-flops Combinational Output Circuit Circuit Clock.. Moore type has outputs dependent only on the state, e.g. ripple
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 Following the slides of Dr. Ahmed H. Madian Lecture 10 محرم 1439 ه Winter
COE 202: Digital Logic Design Sequential Circuits Part 3. Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
COE 202: Digital Logic Design Sequential Circuits Part 3 Dr. Ahmad Almulhem Email: ahmadsm AT kfupm Phone: 860-7554 Office: 22-324 Objectives State Reduction and Assignment Design of Synchronous Sequential
Lecture 14: State Tables, Diagrams, Latches, and Flip Flop
EE210: Switching Systems Lecture 14: State Tables, Diagrams, Latches, and Flip Flop Prof. YingLi Tian Nov. 6, 2017 Department of Electrical Engineering The City College of New York The City University
Introduction EE 224: INTRODUCTION TO DIGITAL CIRCUITS & COMPUTER DESIGN. Lecture 6: Sequential Logic 3 Registers & Counters 5/9/2010
EE 224: INTROUCTION TO IGITAL CIRCUITS & COMPUTER ESIGN Lecture 6: Sequential Logic 3 Registers & Counters 05/10/2010 Avinash Kodi, kodi@ohio.edu Introduction 2 A Flip-Flop stores one bit of information
Overview of Chapter 4
Overview of hapter 4 Types of Sequential ircuits Storage Elements Latches Flip-Flops Sequential ircuit Analysis State Tables State Diagrams Sequential ircuit Design Specification Assignment of State odes
Clocked Synchronous State-machine Analysis
Clocked Synchronous State-machine Analysis Given the circuit diagram of a state machine: Analyze the combinational logic to determine flip-flop input (excitation) equations: D i = F i (Q, inputs) The input
Roger L. Tokheim. Chapter 8 Counters Glencoe/McGraw-Hill
Digital Electronics Principles & Applications Sixth Edition Roger L. Tokheim Chapter 8 Counters 2003 Glencoe/McGraw-Hill INTRODUCTION Overview of Counters Characteristics of Counters Ripple Up Counter
Philadelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, First Semester: 2017/2018 Dept. of Computer Engineering Course Title: Logic Circuits Date: 29/01/2018
Chapter 5 Synchronous Sequential Logic
Chapter 5 Synchronous Sequential Logic Sequential Circuits Latches and Flip Flops Analysis of Clocked Sequential Circuits HDL Optimization Design Procedure Sequential Circuits Various definitions Combinational
Fundamentals of Digital Design
Fundamentals of Digital Design Digital Radiation Measurement and Spectroscopy NE/RHP 537 1 Binary Number System The binary numeral system, or base-2 number system, is a numeral system that represents numeric
Sequential Logic. Rab Nawaz Khan Jadoon DCS. Lecturer COMSATS Lahore Pakistan. Department of Computer Science
Sequential Logic Rab Nawaz Khan Jadoon DCS COMSATS Institute of Information Technology Lecturer COMSATS Lahore Pakistan Digital Logic and Computer Design Sequential Logic Combinational circuits with memory
Synchronous Sequential Circuit
Synchronous Sequential Circuit The change of internal state occurs in response to the synchronized clock pulses. Data are read during the clock pulse (e.g. rising-edge triggered) It is supposed to wait
King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department
King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department Page of COE 22: Digital Logic Design (3--3) Term (Fall 22) Final Exam Sunday January
Gates and Flip-Flops
Gates and Flip-Flops Chris Kervick (11355511) With Evan Sheridan and Tom Power December 2012 On a scale of 1 to 10, how likely is it that this question is using binary?...4? What s a 4? Abstract The operation
UNIVERSITY OF BOLTON SCHOOL OF ENGINEERING BENG (HONS) ELECTRICAL & ELECTRONICS ENGINEERING EXAMINATION SEMESTER /2017
UNIVERSITY OF BOLTON TW35 SCHOOL OF ENGINEERING BENG (HONS) ELECTRICAL & ELECTRONICS ENGINEERING EXAMINATION SEMESTER 2-2016/2017 INTERMEDIATE DIGITAL ELECTRONICS AND COMMUNICATIONS MODULE NO: EEE5002
FSM model for sequential circuits
1 FSM model for sequential circuits The mathematical model of a sequential circuit is called finite-state machine. FSM is fully characterized by: S Finite set of states ( state ~ contents of FFs) I Finite
CS221: Digital Design. Dr. A. Sahu. Indian Institute of Technology Guwahati
CS221: Digital Design Counter&Registers Dr. A. Sahu DeptofComp.Sc.&Engg. Indian Institute of Technology Guwahati Outline Counter : Synchronous Vs Asynchronous Counter: Finite it State t Machine Mhi A register
Synchronous Sequential Logic. Chapter 5
Synchronous Sequential Logic Chapter 5 Other Flip Flops D flip flops requires smallest number of gates. Thus, they are commonly used Other flip flops are JK flip flops T flip flops
Week-5. Sequential Circuit Design. Acknowledgement: Most of the following slides are adapted from Prof. Kale's slides at UIUC, USA.
Week-5 Sequential Circuit Design Acknowledgement: Most of the following slides are adapted from Prof. Kale's slides at UIUC, USA. Storing a value: SR = 00 What if S = 0 and R = 0? The equations on the
EE 209 Logic Cumulative Exam Name:
EE 209 Logic Cumulative Exam Name: 1.) Answer the following questions as True or False a.) A 4-to-1 multiplexer requires at least 4 select lines: true / false b.) An 8-to-1 mux and no other logi can be
I. Motivation & Examples
I. Motivation & Examples Output depends on current input and past history of inputs. State embodies all the information about the past needed to predict current output based on current input. State variables,
LOGIC CIRCUITS. Basic Experiment and Design of Electronics
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Outline Combinational logic circuits Output
Sequential Logic Circuits
Chapter 4 Sequential Logic Circuits 4 1 The defining characteristic of a combinational circuit is that its output depends only on the current inputs applied to the circuit. The output of a sequential circuit,
/ M Morris Mano Digital Design Ahmad_911@hotmailcom / / / / wwwuqucscom Binary Systems Introduction - Digital Systems - The Conversion Between Numbering Systems - From Binary To Decimal - Octet To Decimal
Memory Elements I. CS31 Pascal Van Hentenryck. CS031 Lecture 6 Page 1
Memory Elements I CS31 Pascal Van Hentenryck CS031 Lecture 6 Page 1 Memory Elements (I) Combinational devices are good for computing Boolean functions pocket calculator Computers also need to remember
Digital Electronics Circuits 2017
JSS SCIENCE AND TECHNOLOGY UNIVERSITY Digital Electronics Circuits (EC37L) Lab in-charge: Dr. Shankraiah Course outcomes: After the completion of laboratory the student will be able to, 1. Simplify, design
Chapter 14 Sequential logic, Latches and Flip-Flops
Chapter 14 Sequential logic, Latches and Flip-Flops Flops Lesson 4 JK Flip Flop Ch14L4-"Digital Principles and Design", Raj Kamal, Pearson Education, 2006 2 JK Flip-Flop ve edge triggered Output Q and
ELEC Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10)
ELEC 2200-002 Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and Computer Engineering
or 0101 Machine
Synchronous State Graph or Synchronous State Graph or Detector Design a state graph for a machine with: One input X, one output Z. Z= after receiving the complete sequence or Overlapped sequences are detected.
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 6 Following the slides of Dr. Ahmed H. Madian محرم 1439 ه Winter
LOGIC CIRCUITS. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Digital IC packages TTL (transistor-transistor
Synchronous Sequential Circuit Design. Digital Computer Design
Synchronous Sequential Circuit Design Digital Computer Design Races and Instability Combinational logic has no cyclic paths and no races If inputs are applied to combinational logic, the outputs will always
ENGG 1203 Tutorial _03 Laboratory 3 Build a ball counter. Lab 3. Lab 3 Gate Timing. Lab 3 Steps in designing a State Machine. Timing diagram of a DFF
ENGG 1203 Tutorial _03 Laboratory 3 Build a ball counter Timing diagram of a DFF Lab 3 Gate Timing difference timing for difference kind of gate, cost dependence (1) Setup Time = t2-t1 (2) Propagation
Vidyalankar S.E. Sem. III [ETRX] Digital Circuits and Design Prelim Question Paper Solution
![Vidyalankar S.E. Sem. III [ETRX] Digital Circuits and Design Prelim Question Paper Solution](/thumbs/79/79145081.jpg "Vidyalankar S.E. Sem. III [ETRX] Digital Circuits and Design Prelim Question Paper Solution")
S.E. Sem. III [ETRX] Digital Circuits and Design Prelim uestion Paper Solution. (a) Static Hazard Static hazards have two cases: static and static. static- hazard exists when the output variable should
Topic 8: Sequential Circuits. Bistable Devices. S-R Latches. Consider the following element. Readings : Patterson & Hennesy, Appendix B.4 - B.
Topic 8: Sequential Circuits Bistable Devices Readings : Consider the following element Patterson & Hennesy, Appendix B.4 - B.6 Goals Basic Principles behind Memory Elements Clocks Applications of sequential
ECE380 Digital Logic. Synchronous sequential circuits
ECE38 Digital Logic Synchronous Sequential Circuits: State Diagrams, State Tables Dr. D. J. Jackson Lecture 27- Synchronous sequential circuits Circuits here a clock signal is used to control operation
Chapter 6 Introduction to state machines
9..7 hapter 6 Introduction to state machines Dr.-Ing. Stefan Werner Table of content hapter : Switching Algebra hapter : Logical Levels, Timing & Delays hapter 3: Karnaugh-Veitch-Maps hapter 4: ombinational
Q: Examine the relationship between X and the Next state. How would you describe this circuit? A: An inverter which is synched with a clock signal.
/2/2 OF 7 Next, let s reverse engineer a T-Flip flop Prob. (Pg 529) Note that whenever T is equal to, there is a state change, otherwise, there isn t. In this circuit, (x) determines whether the output
MAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI
DEPARTMENT: ECE MAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI 6 QUESTION BANK SUBJECT NAME: DIGITAL ELECTRONICS UNIT : Design of Sequential Circuits PART A ( Marks). Draw the logic diagram 4: Multiplexer.(AUC
Synchronous Sequential Circuit Design
Synchronous Sequential Circuit Design 1 Sequential circuit design In sequential circuit design, we turn some description into a working circuit We first make a state table or diagram to express the computation
Lecture 17: Designing Sequential Systems Using Flip Flops
EE210: Switching Systems Lecture 17: Designing Sequential Systems Using Flip Flops Prof. YingLi Tian April 11, 2019 Department of Electrical Engineering The City College of New York The City University
Chapter 15 SEQUENTIAL CIRCUITS ANALYSIS, STATE- MINIMIZATION, ASSIGNMENT AND CIRCUIT IMPLEMENTATION
Chapter 15 SEQUENTIAL CIRCUITS ANALYSIS, STATE- MINIMIZATION, ASSIGNMENT AND CIRCUIT IMPLEMENTATION Lesson 2 ANALYSIS OF CLOCKED SEQUENTIAL CIRCUIT Ch15L2- "Digital Principles and Design", Raj Kamal, Pearson
MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified) State any two Boolean laws. (Any 2 laws 1 mark each)
Subject Code: 17333 Model Answer Page 1/ 27 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in the model answer scheme. 2) The model
FYSE420 DIGITAL ELECTRONICS
FYSE42 IGITAL ELECTRONICS Lecture 4 [] [2] [3] IGITAL LOGIC CIRCUIT ANALYSIS & ESIGN Nelson, Nagle, Irvin, Carrol ISBN -3-463894-8 IGITAL ESIGN Morris Mano Fourth edition ISBN -3-98924-3 igital esign Principles
Digital Circuits and Systems
EE201: Digital Circuits and Systems 4 Sequential Circuits page 1 of 11 EE201: Digital Circuits and Systems Section 4 Sequential Circuits 4.1 Overview of Sequential Circuits: Definition The circuit whose
Ch 7. Finite State Machines. VII - Finite State Machines Contemporary Logic Design 1
Ch 7. Finite State Machines VII - Finite State Machines Contemporary Logic esign 1 Finite State Machines Sequential circuits primitive sequential elements combinational logic Models for representing sequential
Appendix B. Review of Digital Logic. Baback Izadi Division of Engineering Programs
Appendix B Review of Digital Logic Baback Izadi Division of Engineering Programs bai@engr.newpaltz.edu Elect. & Comp. Eng. 2 DeMorgan Symbols NAND (A.B) = A +B NOR (A+B) = A.B AND A.B = A.B = (A +B ) OR
Sample Test Paper - I
Scheme G Sample Test Paper - I Course Name : Computer Engineering Group Marks : 25 Hours: 1 Hrs. Q.1) Attempt any THREE: 09 Marks a) Define i) Propagation delay ii) Fan-in iii) Fan-out b) Convert the following:
Chapter 4. Sequential Logic Circuits
Chapter 4 Sequential Logic Circuits 1 2 Chapter 4 4 1 The defining characteristic of a combinational circuit is that its output depends only on the current inputs applied to the circuit. The output of
Counters. We ll look at different kinds of counters and discuss how to build them
Counters We ll look at different kinds of counters and discuss how to build them These are not only examples of sequential analysis and design, but also real devices used in larger circuits 1 Introducing
S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques
![S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques](/thumbs/90/103932933.jpg "S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques")
S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques Time: 3 Hrs.] Prelim Question Paper Solution [Marks : 100 Q.1(a) Attempt any SIX of the following : [12] Q.1(a) (i) Derive AND gate and OR gate
CSE140: Components and Design Techniques for Digital Systems. Midterm Information. Instructor: Mohsen Imani. Sources: TSR, Katz, Boriello & Vahid
CSE140: Components and Design Techniques for Digital Systems Midterm Information Instructor: Mohsen Imani Midterm Topics In general: everything that was covered in homework 1 and 2 and related lectures,
S.Y. Diploma : Sem. III [DE/ED/EI/EJ/EN/ET/EV/EX/IC/IE/IS/IU/MU] Principles of Digital Techniques
![S.Y. Diploma : Sem. III [DE/ED/EI/EJ/EN/ET/EV/EX/IC/IE/IS/IU/MU] Principles of Digital Techniques](/thumbs/82/86792063.jpg "S.Y. Diploma : Sem. III [DE/ED/EI/EJ/EN/ET/EV/EX/IC/IE/IS/IU/MU] Principles of Digital Techniques")
S.Y. Diploma : Sem. III [DE/ED/EI/EJ/EN/ET/EV/EX/IC/IE/IS/IU/MU] Principles of Digital Techniques Time: 3 Hrs.] Prelim Question Paper Solution [Marks : 100 Q.1(a) Attempt any SIX of the following : [12]
Lecture 3 Review on Digital Logic (Part 2)
Lecture 3 Review on Digital Logic (Part 2) Xuan Silvia Zhang Washington University in St. Louis http://classes.engineering.wustl.edu/ese461/ ircuit Optimization Simplest implementation ost criterion literal
Digital Circuits ECS 371
Digital Circuits ECS 371 Dr. Prapun Suksompong prapun@siit.tu.ac.th Lecture 18 Office Hours: BKD 3601-7 Monday 9:00-10:30, 1:30-3:30 Tuesday 10:30-11:30 1 Announcement Reading Assignment: Chapter 7: 7-1,
Digital Control of Electric Drives
Digital Control of Electric Drives Logic Circuits - equential Description Form, Finite tate Machine (FM) Czech Technical University in Prague Faculty of Electrical Engineering Ver.. J. Zdenek 27 Logic
WORKBOOK. Try Yourself Questions. Electrical Engineering Digital Electronics. Detailed Explanations of
27 WORKBOOK Detailed Eplanations of Try Yourself Questions Electrical Engineering Digital Electronics Number Systems and Codes T : Solution Converting into decimal number system 2 + 3 + 5 + 8 2 + 4 8 +
CPE100: Digital Logic Design I
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu CPE100: Digital Logic Design I Midterm02 Review http://www.ee.unlv.edu/~b1morris/cpe100/ 2 Logistics Thursday Nov. 16 th In normal lecture (13:00-14:15)
EECS150 - Digital Design Lecture 23 - FSMs & Counters
EECS150 - Digital Design Lecture 23 - FSMs & Counters April 8, 2010 John Wawrzynek Spring 2010 EECS150 - Lec22-counters Page 1 One-hot encoding of states. One FF per state. State Encoding Why one-hot encoding?
Digital Electronics Final Examination. Part A
Digital Electronics Final Examination Part A Spring 2009 Student Name: Date: Class Period: Total Points: /50 Converted Score: /40 Page 1 of 13 Directions: This is a CLOSED BOOK/CLOSED NOTES exam. Select
DIGITAL LOGIC CIRCUITS
DIGITAL LOGIC CIRCUITS Introduction Logic Gates Boolean Algebra Map Specification Combinational Circuits Flip-Flops Sequential Circuits Memory Components Integrated Circuits Digital Computers 2 LOGIC GATES
Analysis of clocked sequential networks
Analysis of clocked sequential networks keywords: Mealy, Moore Consider : a sequential parity checker an 8th bit is added to each group of 7 bits such that the total # of 1 bits is odd for odd parity if
Vidyalankar S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution
![Vidyalankar S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution](/thumbs/90/103673562.jpg "Vidyalankar S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution")
. (a) (i) ( B C 5) H (A 2 B D) H S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution ( B C 5) H (A 2 B D) H = (FFFF 698) H (ii) (2.3) 4 + (22.3) 4 2 2. 3 2. 3 2 3. 2 (2.3)
EECS150 - Digital Design Lecture 18 - Counters
EECS150 - Digital Design Lecture 18 - Counters October 24, 2002 John Wawrzynek Fall 2002 EECS150 - Lec18-counters Page 1 Counters Special sequential circuits (FSMs) that sequence though a set outputs.
EECS150 - Digital Design Lecture 18 - Counters
EECS50 - Digital Design Lecture 8 - Counters October 24, 2002 John Wawrzynek Fall 2002 EECS50 - Lec8-counters Page Counters Special sequential circuits (FSMs) that sequence though a set outputs. Examples:
Final Exam. ECE 25, Spring 2008 Thursday, June 12, Problem Points Score Total 90
Final Exam ECE 25, Spring 2008 Thursday, June 12, 2008 Name: PID: Problem Points Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 Total 90 1) Number representation (10 pts) a) For each binary vector
PAST EXAM PAPER & MEMO N3 ABOUT THE QUESTION PAPERS:
EKURHULENI TECH COLLEGE. No. 3 Mogale Square, Krugersdorp. Website: www. ekurhulenitech.co.za Email: info@ekurhulenitech.co.za TEL: 011 040 7343 CELL: 073 770 3028/060 715 4529 PAST EXAM PAPER & MEMO N3
CE1911 LECTURE FSM DESIGN PRACTICE DAY 1
REVIEW MATERIAL 1. Combinational circuits do not have memory. They calculate instantaneous outputs based only on current inputs. They implement basic arithmetic and logic functions. 2. Sequential circuits
EECS Components and Design Techniques for Digital Systems. FSMs 9/11/2007
EECS 150 - Components and Design Techniques for Digital Systems FSMs 9/11/2007 Sarah Bird Electrical Engineering and Computer Sciences University of California, Berkeley Slides borrowed from David Culler
EECS150 - Digital Design Lecture 11 - Shifters & Counters. Register Summary
EECS50 - Digital Design Lecture - Shifters & Counters February 24, 2003 John Wawrzynek Spring 2005 EECS50 - Lec-counters Page Register Summary All registers (this semester) based on Flip-flops: q 3 q 2
Digital Logic Design - Chapter 4
Digital Logic Design - Chapter 4 1. Analyze the latch circuit shown below by obtaining timing diagram for the circuit; include propagation delays. Y This circuit has two external input and one feedback