IE1204 Digital Design. L10: State Machines (Part 2) Masoumeh (Azin) Ebrahimi Elena Dubrova
|
|
- Samson Gaines
- 6 years ago
- Views:
Transcription
1 IE1204 Digital Design L10: State Machines (Part 2) Masoumeh (Azin) Ebrahimi Elena Dubrova KTH / ICT / ES
2 This lecture BV pp , IE1204 Digital Design, Autumn2015 2
3 Sequential System a (t) f (a (t)) A sequential system has a built-in memory - the output depends therefore BOTH on the current and previous value(s) of the input signal Lecture 8 - Lecture 13 IE1204 Digital Design, Autumn2015 3
4 Basic method for the design of state machines 1. Analyze the specification of the circuit 2. Create state diagrams 3. Set up the state table 4. Minimize state table (this lecture) 5. Assign codes for states 6. Choose the type of flip-flops 7. Realize the circuit using Karnaugh maps IE1204 Digital Design, Autumn2015 4
5 Moore Machine State Input signals NEXT STATE DECODER STATE REGISTER OUTPUT DECODER Output signals Clk In a Moore-type machine output signals depend only on the current state IE1204 Digital Design, Autumn2015 5
6 Input vs. output - Moore State changed here (at clock edge) The input sequence In 1 In 2 O 1 O 2 The output sequence Output visible after the state has changed IE1204 Digital Design, Autumn2015 6
7 Mealy-type machine State Input signals NEXT STATE DECODER STATE REGISTER OUTPUT DECODER Output signals Clk In a Mealy machine, output signals depend on both the current state and inputs IE1204 Digital Design, Autumn2015 7
8 Input vs. output - Mealy State changed here (at clock edge) The input sequence In 1 In 2 O 1 O 2 The output sequence Output appears directly after the input has changed IE1204 Digital Design, Autumn2015 8
9 Unused state Sometimes you get more states when you need when selecting a code Unused states must be taken care of so that the state machine does not hangs at the start-up (if reset is not used) Reset State w= 0 State identifier A z= 0 w= 1 w= 0 C z= 1 w= 1 B z= 0 w= 0 w= 1 The state transition Value of output signal Next state Present state w =0 w =1 Output z y 2 y 1 Y 2 Y 1 Y 2 Y 1 A B C Unused State 11 dd dd d IE1204 Digital Design, Autumn2015 9
10 Example: (0,0,1) sequence generator 3 states => 2 flip-flops. One unused state. Dangerous transition (Machine hangs) S3 - S1 0 S0 0 If the machine falls in this position, we want it to find move to another state as soon as possible S2 1 IE1204 Digital Design, Autumn
11 Next-state function S0 S1 S2 Current Output Next state state signal y 2 y 1 z Y 2 Y (not 11) S3 - S1 0 S0 0 S2 1 IE1204 Digital Design, Autumn
12 Karnaugh maps S0 S1 S2 Current state Output signal Next state y2y1 z Y2 Y (not 11) y 1 y y 1 y 1 y y Y 2 = y 1 Y 1 = y 2 y 1 z = y 2 IE1204 Digital Design, Autumn
13 State table after Karnaugh minimization S0 S1 S2 Current state Output signal y 2 y 1 z Y 2 Y Next state The unused state goes to S2 S3 1 S1 0 S0 0 (0,0,1) sequence generator S2 1 IE1204 Digital Design, Autumn
14 Logic circuit for the sequence The implementation uses D flip-flops z y 2 Y 2 Y 1 y 1 y 2 y 1 Clk Y 2 = y 1 Y 1 = y 2 y 1 z = y 2 IE1204 Digital Design, Autumn
15 Logic circuit in the structure of Moore machine Y 1 = y 2 y 1 Y 2 = y 1 Combinational circuit Flip-flops Combinational circuit Inputsignals Outputsignals z = y 2 Clk Y 1 y 1??? Y 2 y 2 z Clk IE1204 Digital Design, Autumn
16 Logic circuit for the sequence z Clk y 2 Y 2 Y 1 y 2 y 1 y 1 Combinational circuit Clk Flip-flops Combinational circuit Inputsignals Outputsignals Y 1 = y 2 y 1 Y1 y1 Y 2 = y 1 z = y 2 Y 2 y2 z Clk IE1204 Digital Design, Autumn
17 State minimization When designing complex state machines, it often happens that there are equivalent states that can be grouped together to obtain a more efficient implementation Two states S 1 are S 2 are called equivalent if and only if, for every possible input sequence, the same output will be produced regardless of whether S 1 or S 2 is the initial state IE1204 Digital Design, Autumn
18 State minimization The following example illustrates one minimization method which is can be used for state minimization This method identifies states which are not equivalent (this is often easier) First, we introduce some terminology IE1204 Digital Design, Autumn
19 0- and 1-sucessors If input is applied to a state machine in state S 1 and the result is that the machine moves to state S 2, we say that S 2 is a 0- successor of S 1 S1 If input is applied to a state machine in state S 1 and the result is that the machine moves to state S 3, we say that S 3 is a 1- successor of S 1 We will refer to successors as k-sucessors, where k can be 0 or 1 w=0 w=1 S2 S3 IE1204 Digital Design, Autumn
20 State minimization Basic idea Two states are not equivalent if they have different output values A z = 1 B z = 0 IE1204 Digital Design, Autumn
21 State minimization Basic idea Two states are not equivalent if at least one of their k-sucessors are not equivalent A z = 1 B z = 1 C z = 1 D z = 0 IE1204 Digital Design, Autumn
22 A z = 1 Example State minimization B z = 1 D z = 1 C z = 0 E z = 0 F z = 0 G z = 0 (Moore Machine) 7- states uses 3 flip-flops (2 3 = 8) IE1204 Digital Design, Autumn
23 State table A z = 1 C z = 0 B z = 1 F z = 0 D z = 1 G z = 0 Present Next state Output state w =0 w =1 z A B C 1 E z = 0 IE1204 Digital Design, Autumn
24 State table A z = 1 B z = 1 D z = 1 Present Next state Output state w =0 w =1 z C z = 0 E z = 0 F z = 0 G z = 0 A B C 1 B D F 1 C F E 0 D B G 1 E F C 0 F E D 0 G F G 0 IE1204 Digital Design, Autumn
25 Partition The minimization procedure first considers the state of a machine as a set and then breaks this set into partitions that are not equivalent. A partition consists of one or more blocks each block contains states that may be equivalent different blocks contain states that are definitely not equivalent IE1204 Digital Design, Autumn
26 Example state minimization Start Just one block containing all states P 1 = (ABCDEFG) IE1204 Digital Design, Autumn
27 Example state minimization P 1 = (ABCDEFG) Stage 1: Which states have different outputs? ABD has output z = 1 CEFG have output z = 0 => P 2 = (ABD) (CEFG) A z = 1 B z = 0 States A, B, D can therefore never be equivalent to any of the conditions C, E, F, G so they form different groups IE1204 Digital Design, Autumn
28 w=0 Stage 2 ABD w=1 CEFG Example state minimization Which states have different k-successors? Block ABD 0-successor: A B, B D, D B (all transitions go to the same block) 1-successor: A C, B F, D G (all transitions go to the same block) Block CEFG P 2 = (ABD) (CEFG) 0-successor: C F, E F, F E, G F (all transitions go to the same block) 1-successor: C E, E C, F D, G G (F D goes to another block) => P 3 = (ABD) (CEG) (F) A z = 1 C z = 1 IE1204 Digital Design, Autumn B z = 1 D z = 0
29 w=0 Stage 2 ABD w=1 CEFG Example state minimization Which states have different k-successors? Block ABD 0-successor: A B, B D, D B (all transitions go to the same block) 1-successor: A C, B F, D G (all transitions go to the same block) Block CEFG P 2 = (ABD) (CEFG) 0-successor: C F, E F, F E, G F (all transitions go to the same block) 1-successor: C E, E C, F D, G G (F D goes to another block) => P 3 = (ABD) (CEG) (F) A z = 1 C z = 1 IE1204 Digital Design, Autumn B z = 1 D z = 0
30 w=0 w=1 w=0 ABD w=1 CEG F Step 3 w=0 Example state minimization P3= (ABD) (CEG) (F) What states have different k-successors? w=1 Block ABD 0-successor: A B, B D, D B (all transitions go to the same block) 1-successor: A C, B F, D G (B F goes to another block) => P4= (AD) (B) (CEG) (F) Block (CEG) 0-successor: C F, E F, G F (all transitions go to the same block) 1-successor: C E, E C, G G (all transitions go to the same block) => P4= (AD) (B) (CEG) (F) IE1204 Digital Design, Autumn
31 w=1 Example state minimization P4= (AD) (B) (CEG) (F) Next partition P 5 becomes the same as P 4. Thus the procedure is finished. AD w=0 w=0 B CEG States in each block are equivalent w=1 if they were not, their k-successors would have to be in different blocks A becomes the representive of AD and C represents CEG. w=1 w=0 F w=0 w=1 P 4 = (AD)(B)(CEG)(F) = (A)(B)(C)(F) IE1204 Digital Design, Autumn
32 Final state table Present Next state Output state w =0 w =1 z A B C 1 B D F 1 C F E 0 D B G 1 E F C 0 F E D 0 G F G 0 Present Next State Output state w= 0 w= 1 z A B C 1 B A F 1 C F C 0 F C A 0 Final State Table P 4 = (AD)(B)(CEG)(F) = (A)(B)(C)(F) IE1204 Digital Design, Autumn
33 Final state table Present Next state Output state w =0 w =1 z A B C 1 B D F 1 C F E 0 D B G 1 E F C 0 F E D 0 G F G 0 Present Next State Output state w= 0 w= 1 z A B C 1 B A F 1 C F C 0 F C A 0 Final State Table P 4 = (AD)(B)(CEG)(F) = (A)(B)(C)(F) IE1204 Digital Design, Autumn
34 Final state diagram Present Next State state w=0 w= 1 Output z A B C 1 B A F 1 C F C 0 F C A 0 A z = 1 C z = 0 B z = 1 F z = 0 4 states needs 2 flip-flops (2 2 = 4). IE1204 Digital Design, Autumn
35 Comparison A z = 1 B z = 1 D z = 1 A z = 1 B z = 1 C z = 0 E z = 0 F z = 0 G z = 0 C z = 0 Only 2 flip-flops are needed to implement 4 states in the minimized state table 3 flip-flops are needed to implement 7 states in the original state table F z = 0 IE1204 Digital Design, Autumn
36 Some thought! Fewer state does not necessarily lead to a simpler design! The advantage of state minimization is instead that it makes it easier to create the initial state diagram, when you do not have to get it to be minimal from the beginning! IE1204 Digital Design, Autumn
37 Analysis of synchronous sequential circuits Given an implementation of a synchronous circuit, we can produce its function by making the synthesis steps in a reverse order! 1. Get expressions for next state decoder output decoder 2. Get the state table 3. Draw the state diagram IE1204 Digital Design, Autumn
38 Example: Analysis of a synchronous sequential circuit Y 1 D Q y 1 z w Clock Resetn Y 2 D Q Q Q y 2 It is difficult to figure out directly from the schematic how a sequential circuit behaves! IE1204 Digital Design, Autumn
39 Example: Moore-machine! IE1204 Digital Design, Autumn
40 Example: Analysis of a synchronous sequential circuit 1. Get expressions for next state decoder output decoder w y 1 w y 2 w y 1 wy 2 wy 1 wy1 Y 1 Y 2 Y Y 1 2 = = wy wy wy wy 2 2 y 1 y 2 z = y 1 y 2 z IE1204 Digital Design, Autumn
41 Example: Analysis of a synchronous sequential circuit 2. Get the state table Next State Present state w= 0 w= 1 Output y 2 y 1 z Y 2 Y 1 Y 2 Y A: 00 B: 01 C: 10 D: 11 Present Next state Output state w= 0 w= 1 z A A B 0 B A C 0 C A D 0 D A D 1 Y 2 + wy z = y 1 y = wy1 2 Y 1= wy1+ wy2 2 IE1204 Digital Design, Autumn
42 Example: Analysis of a synchronous sequential circuit 3. Draw state diagram Left as exercise for students... (but check the state table to make sure it is a bit sequence detector for three subsequent 1s) Present Next state Output state w= 0 w= 1 z A A B 0 B A C 0 C A D 0 D A D 1 A z = 0 C z = 0 w =1 B z = 0 D z = 1 IE1204 Digital Design, Autumn
43 State diagram Present Next state Output state w= 0 w= 1 z A A B 0 B A C 0 C A D 0 D A D 1 Sometimes you may need to change the order of the states to get a clearer chart. A z = 0 C z = 0 w =1 w =1 w =1 B z = 0 D z = 1 w =1 IE1204 Digital Design, Autumn
44 State diagram Present Next state Output state w= 0 w= 1 z A A B 0 B A C 0 C A D 0 D A D 1 C and D have changed places resulting in no intersecting state arrows. w =1 A z = 0 D z = 1 w =1 w =1 B z = 0 C z = 0 IE1204 Digital Design, Autumn
45 ASM Charts State transition diagrams are convenient for describing the behavior of small state machines only To describe larger state machines, another type of diagrams, called Algorithmic State Machine (ASM) charts are often used An ASM is a flow diagram consisting of three types of elements: state box, decision box and conditional output box 0 0 A B C Reset w w z w IE1204 Digital Design, Autumn
46 ASM Charts State Name Output signals or actions (Moore type) 0 (False) Condition 1 (True) expression (B) Decision box (A) State Box Conditional outputs or actions (Mealy type) (C) Conditional output box IE1204 Digital Design, Autumn
47 ASM Charts State Box Represents a state in a FSM Output values for state are given here (Moore outputs) Decision Box Depending on the values of the input signals, it determines a transition to the next state Conditional outputs Box Specifies the values of the outputs at a state transition (Mealy outputs) IE1204 Digital Design, Autumn
48 ASM chart for 11 sequence detector (Moore) Reset Reset A A z= 0 B z= 0 0 B w 1 0 w 1 C z= 1 C z 0 1 w z = 1 only in the state C IE1204 Digital Design, Autumn
49 ASM chart for 11 sequence detector (Mealy) Reset Reset z = 0 A z = 0 A B z = 1 0 w 1 z = 0 B z 0 1 w z = 1 only when the state transition B-to-B with takes place IE1204 Digital Design, Autumn
50 Formal model for sequential circuits To treat state machines in a formal way, we need a formal model The following model can describe both Moore and Mealy machines IE1204 Digital Design, Autumn
51 Formal model for sequential circuits w 1 z 1 Inputs w n Combinational Circuit z m Outputs y k Y k Current-state variables Next-state variables y 1 Y 1 IE1204 Digital Design, Autumn
52 Formal model for sequential circuits A synchronous sequential circuit can be formally defined as M = ( W, Z, S, j, l) W, Z, and S are finite, nonempty sets of inputs, outputs and states, respectively φ is the state transition function, such as S(t+1) = φ[w(t), S(t)] λ is the output function, such as λ(t) = λ(s(t)) for the Moore model and λ(t) = λ(w(t), S(t)) for the Mealy model IE1204 Digital Design, Autumn
53 W Z S y Y inputs outputs states present-state Formal model for sequential circuits = = { w1, w2,..., wm} { z1, z2,..., zm} { S1, S2,..., Sm} -variables = { y1, y2,..., ym} = { Y, Y,..., Y } = next-state-variables 1 2 m M = ( W, Z, S, j, l) S( t l l Moore Mealy + Dt) = Y 1... Y m ( t) = l( S( t)) ( t) = l( W ( t), S( t)) = j( W ( t), S( t)) IE1204 Digital Design, Autumn
54 Bottle dispenser Bottle dispenser consists of several parts COIN RECEIVER DROP BOTTLE COIN RETURN Machine accepts only the following coins: 1 Euro, 50 Cent, 10 Cent The vending machine only returns 10 Cent coins IE1204 Digital Design, Autumn
55 Signal Properties DROP_READY is active for one clock cycle after the bottle has been ejected CHANGER_READY is active for one clock cycle after a 10 Cent coin is ejected Because of the mechanical properties, the following signals are active and inactive for several clock cycles: (active for several clock cycles after the coin drop) DROP_READY (active for several clock periods after bottle drop) CHANGER_READY (inactive for several clock periods after coin return) IE1204 Digital Design, Autumn
56 Flow diagram of control system No Total <1 Reset Coin registered? Yes Total? Coin 10 Cent, 50 Cent, 1 Euro Coin return 10 Cent Bottle Price 1 Euro Total = 1 Total> 1 Eject bottle Reset sum Return 10 Cent Decrease sum IE1204 Digital Design, Autumn
57 State diagram (Moore) (a) (b) (a) (b) (c) Wait for coin Register coin Coin is registered (3 cases) LT_I_EURO (c) (d) (e) Drop bottle Reset sum EQ_I_EURO GT_I_EURO (f) Return 10 Cent DROP READY DROP (d) (f) CHANGER READY RETURN_10_CENT (g) Decrease sum with 10 Cent DROP READY (e) CLR_ACC (g) DEC_ACC CHANGER_READY Upon entry into the state, signal becomes active When exiting the state, signal becomes inactive IE1204 Digital Design, Autumn
58 State diagram (a) (b) State assignment with no claim for optimality (Ad hoc) (a) next to (b) DROP READY LT_I_EURO EQ_I_EURO DROP (d) (c) GT_I_EURO (f) CHANGER READY RETURN_10_CENT (b) next to (c) (d) next to (e) (f) next to (g) For all these cases, only one variable changes AB DROP READY CHANGER_READY (e) (g) C 0 a - d f 1 b c e g CLR_ACC DEC_ACC ( - = don t care) IE1204 Digital Design, Autumn
59 State diagram DROP READY LT_I_EURO EQ_I_EURO DROP DROP READY (d) 110 (e) 111 CLR_ACC (a) 000 (b) 001 (c) 011 GT_I_EURO (f) 100 (g) 101 DEC_ACC CHANGER READY RETURN_10_CENT CHANGER_READY The state diagram contains all information required to generate an implementation Assumption: D flip-flops are used as state register 7 states: 3 flip-flops are needed The state variable order is ABC, i.e. state (c) is A = 0, B = 1,C = 1 IE1204 Digital Design, Autumn
60 Unused state?! DROP READY LT_I_EURO EQ_I_EURO DROP DROP READY (d) 110 (e) 111 CLR_ACC (a) 000 (b) 001 (c) 011 GT_I_EURO (f) 100 (g) 101 DEC_ACC (h) 010 CHANGER READY RETURN_10_CENT CHANGER_READY If fall into the unused state (h) we are stuck!! Possible ways out: going to (c) and continue. going to (d) and offering soft drinks!! going to (e) and resetting any previous payment. Which option do you prefer for your design?! Which option leads to a simpler design? IE1204 Digital Design, Autumn
61 Construction of next-state and output decoders (Moore machine) Combinational circuit Flip-flops Combinational circuit Inputsignals Outputsignals Clk LT_I_EURO EQ_I_EURO GT_I_EURO DROP_READY CHANGER_READY A B Next State Decoder D A D B D C D D D B C A Output Decoder DROP RETURN_I0_CENT CLR_ACC DEC_ACC C Clk At next step, we develop the logic for the next state (D A, D B, D C ) and outputs IE1204 Digital Design, Autumn
62 Construction of next-state and output decoders Input-signals Next state decoder (Combination al circuit) Clk Flip-flops Output decoder (Combination al circuit) Output-signals?? LT_I_EURO EQ_I_EURO GT_I_EURO DROP_READY CHANGER_READY A B Next State Decoder D A D B D C D D D B C A Output Decoder DROP RETURN_I0_CENT CLR_ACC DEC_ACC C Clk At next step, we develop the logic for the next state (D A, D B, D C ) and outputs IE1204 Digital Design, Autumn
63 Decoder: Next state - D A LT_I_EURO EQ_I_EURO (a) 000 (b) 001 (c) 011 GT_I_EURO C D A AB (=) + (>) 0 0 (=) : EQ_1_EURO (>) : GT_1_EURO DROP READY DROP (d) 110 (f) 100 CHANGER READY RETURN_10_CENT DROP READY (e) 111 (g) 101 CHANGER_READY D A = AB( = ) + AB( > ) + AC CLR_ACC DEC_ACC IE1204 Digital Design, Autumn
64 Variable-Entered Mapping (VEM) Variable-Entered Mapping can help to draw and minimize Karnaugh diagrams with many variables. In this example there are several variables as: Coin_Present, Drop_Ready, Changer_Ready, GT, LT, EQ. Instead of opening an "extra dimension" we write a variable into the Karnaugh map You must be extra careful when drawing circuits so that you do not forget a variable combination! D A AB C (=) + (>) 0 0 IE1204 Digital Design, Autumn
65 Decoder: Next state - D B LT_I_EURO EQ_I_EURO (a) 000 (b) 001 (c) 011 GT_I_EURO C D B AB CP (=) 0 1 (=) : EQ_1_EURO CP : DROP READY DROP (d) 110 (f) 100 CHANGER READY RETURN_10_CENT DROP READY (e) 111 CLR_ACC (g) 101 DEC_ACC CHANGER_READY D B = AB( = ) + BC + BC(CP) + ABC IE1204 Digital Design, Autumn
66 Decoder: Next state- D C DROP READY LT_I_EURO EQ_I_EURO DROP (d) 110 (a) 000 (b) 001 (c) 011 GT_I_EURO (f) 100 CHANGER READY C RETURN_10_CENT D C AB CP - DR CR CP : DR: DROP_READY CR: CHANGER_READY DROP READY (e) 111 CLR_ACC (g) 101 DEC_ACC CHANGER_READY D C = AC(CP) + BC(DR) + AB(CR) + BC IE1204 Digital Design, Autumn
67 Decoder: Output signals DROP READY LT_I_EURO EQ_I_EURO DROP DROP READY (d) 110 (e) 111 CLR_ACC (a) 000 (b) 001 (c) 011 GT_I_EURO (f) 100 (g) 101 DEC_ACC CHANGER READY RETURN_10_CENT CHANGER_READY Output decoder is trivial, since its value is directly dependent on the current state DROP = CLR_ACC = ABC RETURN_10_ DEC_ACC ABC = CENT = ABC ABC IE1204 Digital Design, Autumn
68 Logic Design LT_I_EURO EQ_I_EURO GT_I_EURO DROP_READY CHANGER_READY A B Next State Decoder D A D B D C D D D B C A Output Decoder DROP RETURN_I0_CENT CLR_ACC DEC_ACC C Clk Now you can design Next State Decoder and Output Decoder by knowing the logic function of D a, D b, D c, and logic funtion of outputs Drop, Return_10_Cent, CLR_ACC, and DEC_ACC. IE1204 Digital Design, Autumn
69 Summary State minimization Analysis of a synchronous sequential circuit ASM charts Formal model for sequential circuits Next lecture: BV pp , , IE1204 Digital Design, Autumn
Vending machine A design-example by Ingo Sander
Vending machine A design-example by Ingo Sander System ontrol We will design the block System ontrol OIN REEIVER OIN_PRESENT GT_1_EURO EQ_1_EURO LT_1_EURO SYSTEM ONTROL DROP DROP_READY DROP BOTTLE AUMU-
More informationFSM 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
More informationECE380 Digital Logic
ECE38 Digital Logic State Minimization Dr. D. J. Jackson Lecture 32- State minimization For simple FSMs, it is easy to see from the state diagram that the number of states used is the minimum possible
More informationECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering TIMING ANALYSIS Overview Circuits do not respond instantaneously to input changes
More informationor 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.
More informationAsynchronous sequence circuits
Asynchronous sequence circuits An asynchronous sequence machine is a sequence circuit without flip-flops Asynchronous sequence machines are based on combinational gates with feedback Upon analysis it is
More informationChapter 6. Synchronous Sequential Circuits
Chapter 6 Synchronous Sequential Circuits In a combinational circuit, the values of the outputs are determined solely by the present values of its inputs. In a sequential circuit, the values of the outputs
More informationEGR224 F 18 Assignment #4
EGR224 F 18 Assignment #4 ------------------------------------------------------------------------------------------------------------- Due Date: Friday (Section 10), October 19, by 5 pm (slide it under
More informationCh 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
More informationSynchronous 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
More information3. 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
More informationCprE 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,
More informationECE380 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
More informationLast lecture Counter design Finite state machine started vending machine example. Today Continue on the vending machine example Moore/Mealy machines
Lecture 2 Logistics HW6 due Wednesday Lab 7 this week (Tuesday exception) Midterm 2 Friday (covers material up to simple FSM (today)) Review on Thursday Yoky office hour on Friday moved to Thursday 2-:2pm
More informationSynchronous 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
More informationCPE100: 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)
More informationL4: Karnaugh diagrams, two-, and multi-level minimization. Elena Dubrova KTH / ICT / ES
L4: Karnaugh diagrams, two-, and multi-level minimization Elena Dubrova KTH / ICT / ES dubrova@kth.se Combinatorial system a(t) not(a(t)) A combinatorial system has no memory - its output depends therefore
More informationSequential 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
More informationThe 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
More informationLogic Design II (17.342) Spring Lecture Outline
Logic Design II (17.342) Spring 2012 Lecture Outline Class # 10 April 12, 2012 Dohn Bowden 1 Today s Lecture First half of the class Circuits for Arithmetic Operations Chapter 18 Should finish at least
More informationGeneralized FSM model: Moore and Mealy
Lecture 18 Logistics HW7 is due on Monday (and topic included in midterm 2) Midterm 2 on Wednesday in lecture slot cover materials up to today s lecture Review session Tuesday 4:15pm in EEB125 Last lecture
More informationModels for representing sequential circuits
Sequential Circuits Models for representing sequential circuits Finite-state machines (Moore and Mealy) Representation of memory (states) Changes in state (transitions) Design procedure State diagrams
More informationEE40 Lec 15. Logic Synthesis and Sequential Logic Circuits
EE40 Lec 15 Logic Synthesis and Sequential Logic Circuits Prof. Nathan Cheung 10/20/2009 Reading: Hambley Chapters 7.4-7.6 Karnaugh Maps: Read following before reading textbook http://www.facstaff.bucknell.edu/mastascu/elessonshtml/logic/logic3.html
More informationSynchronous Sequential Circuit Design. Dr. Ehab A. H. AL-Hialy Page 1
Synchronous Sequential Circuit Design Dr. Ehab A. H. AL-Hialy Page Motivation Analysis of a few simple circuits Generalizes to Synchronous Sequential Circuits (SSC) Outputs are Function of State (and Inputs)
More informationLogical design of digital systems
21062017 lectures Summer Semester 2017 Table of content 1 Combinational circuit design 2 Elementary combinatorial circuits for data transmission 3 Memory structures 4 Programmable logic devices 5 Algorithmic
More informationDigital Circuit Engineering
Digital Circuit Engineering 2nd Distributive ( A)( B) = AB Circuits that work in a sequence of steps Absorption A = A A= THESE CICUITS NEED STOAGE TO EMEMBE WHEE THEY AE STOAGE D MU G M MU G S CLK D Flip
More informationUNIVERSITY 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
More informationLet s now begin to formalize our analysis of sequential machines Powerful methods for designing machines for System control Pattern recognition Etc.
Finite State Machines Introduction Let s now begin to formalize our analysis of sequential machines Powerful methods for designing machines for System control Pattern recognition Etc. Such devices form
More informationSequential 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
More informationDifferent 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.,
More informationKing 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
More information14.1. Unit 14. State Machine Design
4. Unit 4 State Machine Design 4.2 Outcomes I can create a state diagram to solve a sequential problem I can implement a working state machine given a state diagram STATE MACHINES OVERVIEW 4.3 4.4 Review
More informationExample: vending machine
Example: vending machine Release item after 15 cents are deposited Single coin slot for dimes, nickels o change Reset Coin Sensor Vending Machine FSM Open Release Mechanism Clock Spring 2005 CSE370 - guest
More informationClocked 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
More informationWritten exam with solutions IE Digital Design Friday 21/
Written exam with solutions IE204-5 Digital Design Friday 2/0 206 09.00-3.00 General Information Examiner: Ingo Sander. Teacher: Kista, William Sandvist tel 08-7904487, Elena Dubrova phone 08-790 4 4 Exam
More informationPhiladelphia 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
More informationFinite State Machine (FSM)
Finite State Machine (FSM) Consists of: State register Stores current state Loads next state at clock edge Combinational logic Computes the next state Computes the outputs S S Next State CLK Current State
More informationFSM Optimization. Counter Logic Diagram Q1 Q2 Q3. Counter Implementation using RS FF 10/13/2015
/3/5 CS: Digital Design http://jatinga.iitg.ernet.in/~asahu/cs FSM Optimization A. Sahu Dept of Comp. Sc. & Engg. Indian Institute of Technology Guwahati Outline Last Class: Comb. Cirt. Complexity (CCC)
More informationELEC 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
More informationLecture 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
More informationWritten exam with solutions IE1204/5 Digital Design Friday 13/
Written eam with solutions IE204/5 Digital Design Friday / 207 08.00-2.00 General Information Eaminer: Ingo Sander. Teacher: Kista, William Sandqvist tel 08-7904487 Teacher: Valhallavägen, Ahmed Hemani
More informationFYSE420 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
More informationEEE2135 Digital Logic Design
EEE2135 Digital Logic Design Chapter 7. Sequential Circuits Design 서강대학교 전자공학과 1. Model of Sequential Circuits 1) Sequential vs. Combinational Circuits a. Sequential circuits: Outputs depend on both the
More informationDesign Example: 4-bit Sequence Detector
Design Example: 4-bit Sequence Detector We are asked to design a 4-bit sequence detector. For each 4 bits that are input, we need to see whether they match one of two given sequences: 1010 or 0110. The
More informationSynchronous 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
More informationCSE140: 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,
More information11.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
More informationSymbolic State Minimization
CSE 27 Introduction to igital Systems Supplementary Reading Symbolic State inimization and An Example Symbolic State inimization In constructing state diagrams, it often occurs that the number of symbolic
More informationLogic and Computer Design Fundamentals. Chapter 8 Sequencing and Control
Logic and Computer Design Fundamentals Chapter 8 Sequencing and Control Datapath and Control Datapath - performs data transfer and processing operations Control Unit - Determines enabling and sequencing
More informationEECS150 - 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?
More informationSynchronous 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
More informationCOEN 312 DIGITAL SYSTEMS DESIGN - LECTURE NOTES Concordia University
1 OEN 312 DIGIAL SYSEMS DESIGN - LEURE NOES oncordia University hapter 6: Registers and ounters NOE: For more examples and detailed description of the material in the lecture notes, please refer to the
More informationChapter 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
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 Following the slides of Dr. Ahmed H. Madian Lecture 10 محرم 1439 ه Winter
More informationLearning Objectives:
Learning Objectives: t the end of this topic you will be able to; draw a block diagram showing how -type flip-flops can be connected to form a synchronous counter to meet a given specification; explain
More informationReview for B33DV2-Digital Design. Digital Design
Review for B33DV2 The Elements of Modern Behaviours Design Representations Blocks Waveforms Gates Truth Tables Boolean Algebra Switches Rapid Prototyping Technologies Circuit Technologies TTL MOS Simulation
More informationDigital Circuit Engineering
Digital Circuit Engineering 2nd Distributive ( + A)( + B) = + AB Circuits that work in a sequence of steps Absorption + A = + A A+= THESE CICUITS NEED STOAGE TO EMEMBE WHEE THEY AE STOAGE D MU G M MU S
More informationComputers also need devices capable of Storing data and information Performing mathematical operations on such data
Sequential Machines Introduction Logic devices examined so far Combinational Output function of input only Output valid as long as input true Change input change output Computers also need devices capable
More informationSequential logic and design
Principles Of Digital Design Sequential logic and design Analysis State-based (Moore) Input-based (Mealy) FSM definition Synthesis State minimization Encoding Optimization and timing Copyright 20-20by
More informationCE1911 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
More informationParity Checker Example. EECS150 - Digital Design Lecture 9 - Finite State Machines 1. Formal Design Process. Formal Design Process
Parity Checker Example A string of bits has even parity if the number of 1 s in the string is even. Design a circuit that accepts a bit-serial stream of bits and outputs a 0 if the parity thus far is even
More informationECEN 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
More informationFinite 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?
More informationLecture 14 Finite state machines
Lecture 14 Finite state machines Finite state machines are the foundation of nearly all digital computation. The state diagram captures the desired system behavior A formulaic process turns this diagram
More informationClocked Sequential Circuits UNIT 13 ANALYSIS OF CLOCKED SEQUENTIAL CIRCUITS. Analysis of Clocked Sequential Circuits. Signal Tracing and Timing Charts
ed Sequential Circuits 2 Contents nalysis by signal tracing & timing charts State tables and graphs General models for sequential circuits sequential parity checker Reading Unit 3 asic unit Unit : Latch
More informationModule 10: Sequential Circuit Design
Module : Sequential Circuit esign Wakerly: Chapter 7 (Part 3) : ECE 3233 r. Keith A. eague Spring 23 REA Chapter 7 (skipping references to HL) 23 -Machine esign and Synthesis he creative part, like writing
More informationL10 State Machine Design Topics
L State Machine Design Topics States Machine Design Other topics on state machine design Equivalent sequential machines Incompletely specified machines One Hot State Machines Ref: text Unit 15.4, 15.5,
More informationEECS 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
More informationWritten exam for IE1204/5 Digital Design with solutions Thursday 29/
Written exam for IE4/5 Digital Design with solutions Thursday 9/ 5 9.-. General Information Examiner: Ingo Sander. Teacher: William Sandqvist phone 8-794487 Exam text does not have to be returned when
More informationAppendix 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
More informationAppendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring
- Principles of Computer rchitecture Miles Murdocca and Vincent Heuring 999 M. Murdocca and V. Heuring -2 Chapter Contents. Introduction.2 Combinational Logic.3 Truth Tables.4 Logic Gates.5 Properties
More informationDesign at the Register Transfer Level
Week-7 Design at the Register Transfer Level Algorithmic State Machines Algorithmic State Machine (ASM) q Our design methodologies do not scale well to real-world problems. q 232 - Logic Design / Algorithmic
More informationQ: 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
More information12. Finite State Machine Design
EECS 7 Winter 3. Finite State Machine esign Profs. Kang Shin & Valeria Bertacco EECS epartment University of Michigan, nn rbor Copyright Frank Vahid Instructors of courses requiring Vahid's igital esign
More informationAnalysis of Clocked Sequential Circuits
Objectives Analysis of Clocked Sequential Circuits The objectives of this lesson are as follows: Analysis of clocked sequential circuits with an example State Reduction with an example State assignment
More informationCOE 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
More information(Boolean Algebra, combinational circuits) (Binary Codes and -arithmetics)
Task 1. Exercises: Logical Design of Digital Systems Seite: 1 Self Study (Boolean Algebra, combinational circuits) 1.1 Minimize the function f 1 a ab ab by the help of Boolean algebra and give an implementation
More informationUniversity of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering
University of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering Final Examination ECE 241F - Digital Systems Examiners: S. Brown,
More informationENEL Digital Circuit Design. Final Examination
ELECTRICAL AND COMPUTER ENGINEERING ENEL 353 - Digital Circuit Design Final Examination Friday, December 17, 1999 Red Gymnasium, 3:30PM - 6:30 PM Instructions: Time allowed is 3 hours. The examination
More informationDIGITAL LOGIC CIRCUITS
DIGITAL LOGIC CIRCUITS Digital logic circuits BINARY NUMBER SYSTEM electronic circuits that handle information encoded in binary form (deal with signals that have only two values, and ) Digital. computers,
More informationDigital 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
More informationEECS150 - 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.
More informationEECS150 - 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:
More information6. Finite State Machines
6. Finite State Machines 6.4x Computation Structures Part Digital Circuits Copyright 25 MIT EECS 6.4 Computation Structures L6: Finite State Machines, Slide # Our New Machine Clock State Registers k Current
More informationState Machines ELCTEC-131
State Machines ELCTEC-131 Switch Debouncer A digital circuit that is used to remove the mechanical bounce from a switch contact. When a switch is closed, the contacts bounce from open to closed to cause
More informationDigital Logic Design - Chapter 5
Digital Logic Design - Chapter 5 S. Design a 2-bit binary up counter a) using positive-edge-triggered D flip-flops. b) using positive-edge-triggered T flip-flops. c) using positive-edge-triggered JK flip-flops.
More informationBoolean Algebra and Digital Logic 2009, University of Colombo School of Computing
IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of
More informationDigital Design 2010 DE2 1
1 Underviser: D. M. Akbar Hussain Litteratur: Digital Design Principles & Practices 4 th Edition by yj John F. Wakerly 2 DE2 1 3 4 DE2 2 To enable students to apply analysis, synthesis and implementation
More informationChapter 7. Synchronous Sequential Networks. Excitation for
Chapter 7 Excitation for Synchronous Sequential Networks J. C. Huang, 2004 igital Logic esign 1 Structure of a clocked synchronous sequential network Mealy model of a clocked synchronous sequential network
More informationPresent Next state Output state w = 0 w = 1 z A A B 0 B A C 0 C A C 1
W Combinational circuit Flip-flops Combinational circuit Z cycle: t t t 2 t 3 t 4 t 5 t 6 t 7 t 8 t 9 t : : Figure 8.. The general form of a sequential circuit. Figure 8.2. Sequences of input and output
More informationENGG 1203 Tutorial_9 - Review. Boolean Algebra. Simplifying Logic Circuits. Combinational Logic. 1. Combinational & Sequential Logic
ENGG 1203 Tutorial_9 - Review Boolean Algebra 1. Combinational & Sequential Logic 2. Computer Systems 3. Electronic Circuits 4. Signals, Systems, and Control Remark : Multiple Choice Questions : ** Check
More informationEECS150 - Digital Design Lecture 17 - Sequential Circuits 3 (Counters)
EECS150 - Digital Design Lecture 17 - Sequential Circuits 3 (Counters) March 19&21, 2002 John Wawrzynek Spring 2002 EECS150 - Lec13-seq3 version 2 Page 1 Counters Special sequential circuits (FSMs) that
More informationDigital 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
More information5 State Minimisation. university of applied sciences hamburg. Digital Systems. Prof. Dr. J. Reichardt Prof. Dr. B. Schwarz
5 State Minimisation In an early design phase when a word description of a sequential circuit's function is transformed into a FSM state diagram or state table redundant states may arise. State minimisation
More informationASYNCHRONOUS SEQUENTIAL CIRCUITS
ASYNCHRONOUS SEQUENTIAL CIRCUITS Sequential circuits that are not snchronized b a clock Asnchronous circuits Analsis of Asnchronous circuits Snthesis of Asnchronous circuits Hazards that cause incorrect
More informationState & Finite State Machines
State & Finite State Machines Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University See P&H Appendix C.7. C.8, C.10, C.11 Stateful Components Until now is combinatorial logic Output
More informationCPE100: Digital Logic Design I
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu CPE100: Digital Logic Design I Final Review http://www.ee.unlv.edu/~b1morris/cpe100/ 2 Logistics Tuesday Dec 12 th 13:00-15:00 (1-3pm) 2 hour
More informationBER KELEY D AV IS IR VINE LOS AN GELES RIVERS IDE SAN D IEGO S AN FRANCISCO
UN IVERSIT Y O F CA LIFO RNI A AT BERKELEY BER KELEY D AV IS IR VINE LOS AN GELES RIVERS IDE SAN D IEGO S AN FRANCISCO SAN TA BARBA RA S AN TA CRUZ De p a r tm en t of Ele ctr i ca l En gin e e rin g a
More informationFaculty of Engineering. FINAL EXAMINATION FALL 2008 (December2008) ANSWER KEY
1 McGill University Faculty of Engineering DIGITAL SYSTEM DESIGN ECSE-323 FINAL EXAMINATION FALL 2008 (December2008) ANSWER KEY STUDENT NAME McGILL I.D. NUMBER Examiner: Prof. J. Clark Signature: Associate
More informationLatches. October 13, 2003 Latches 1
Latches The second part of CS231 focuses on sequential circuits, where we add memory to the hardware that we ve already seen. Our schedule will be very similar to before: We first show how primitive memory
More information