Digital Design. Sequential Logic
|
|
- Juliet Robertson
- 6 years ago
- Views:
Transcription
1 Principles Of igital esign Chapter 6 Sequential Logic
2 Chapter preview Boolean algebra 3 Logic gates and flip-flops 3 Finite-state machine 6 Logic design techniques 4 Sequential design techniques 6 Binary system and data representation 2 Combinational components 5 Storage components 7 Generalized finite-state machines 8 Register-transfer design 8 Processor components 9 Copyright by aniel. Gajski 2
3 Sequential components Sequential components contain memory elements The output values of sequential components depend on the input values and the values stored in the memory elements The values in the memory elements define the state of sequential components Example : Ring counter that starts the answering machine after 4 rings Sequential components can be ()asynchronous or (2) synchronous Asynchronous sequential components change their state and output values as a response to change in input values Synchronous sequential components change their state and output values at fixed points of time defined by the clock signal Copyright by aniel. Gajski 3
4 Clock signal Clock period Clock width Rising edge Falling edge Clock period ( measured in micro or nanoseconds ) is the time between successive transitions in the same direction Clock frequency ( measured in MHz or GHz ) is the reciprocal of clock period Clock width is the time interval during which clock is equal to uty cycle is the ratio of the clock width and clock period Clock signal is active high if the changes occur at the rising edge or during the clock width Clock signal is active low otherwise Copyright by aniel. Gajski 4
5 SR-latch ( NOR implementation ) SR-latch has two states: () set state (Q=) and (2) reset state (Q=) S Q S R Q Q (next) Q (next) (hold) (hold) (reset) R Logic schematic Q Truth table (set) (?) S R Q Undefined.4 Q Undefined Copyright by aniel. Gajski t t t 2 t 3 t 4 t 5 t 6 Timing diagram 5 t 7 t 8 t 9 t
6 SR-latch ( NAN implementation ) S.4 Q S R Q Q (next) Q (next) (?) (set) (reset) R.4 Q (hold) (hold) Logic schematic Truth table S R Q Undefined Q Undefined t t t 2 t 3 t 4 t 5 t 6 t 7 t 8 t 9 t Copyright by aniel. Gajski Timing diagram 6
7 Gated SR-latch S C R Q Q Graphic symbol Control signal C activates the latch R C S Logic schematic Q Q C S R Q Q(next) NA (inactive) (inactive) (hold) (hold) (reset) (set) (?) Truth table reset state set state reset state C S R Q t t t 2 t 3 t 4 t 5 t 6 t 7 t 8 t 9 t t t 2 t 3 Copyright by aniel. Gajski Timing diagram 7 t setup t hold
8 Gated -latch C Q Q C Q Q C Q Q(next) Graphic symbol Logic schematic Truth table C reset state set state reset state Q Setup time is minimum time inputs must be stable before C Hold time is minimum time inputs must be stable after C Q follows while C is asserted as long as satisfies setup and hold time restrictions Copyright by aniel. Gajski t t t 2 t 3 t 4 t 5 t 6 t 7 t 8 t 9 t setup t hold t setup t hold t setup t hold Timing diagram 8
9 Flip Flops Latches are level-sensitive since they respond to input changes during clock width. Latches are difficult to work with for this reason. Flip-Flops respond to input changes only during the change in clock signal. They are easy to work with though more expensive than latches. Two styles of flip-flops are available. () master-slave (MS) (2) edge-triggered (ET) Copyright by aniel. Gajski 9
10 Erroneous shifting with -latches Erroneous operation is possible with level-sensitive latches Q 4./3. C Q 2 4./3. C Q 3 4./3. C Y Logic schematic Q Q Q t 2 t t t 3 t 4 t 5 t 7 Timing diagram Note: Low-to-high delay is 4.ns. High-to-low delay is 3.ns. t 6 Copyright by aniel. Gajski
11 Master-slave slave flip-flop flop In a MS flip-flop is sampled and stored at the rising edge (low-to-high) of the signal Master latch Q m 4./3. C Slave latch Q s 4./3. C Q Logic schematic Q m Q s t t 3 t 4 t 5 t 7 t 8 t 9 t t 2 t 6 Copyright by aniel. Gajski Timing diagram
12 Shifting with master-slave slave flip-flops flops Master-slave flip-flops Q n 4./3. C Q s 4./3. C Master-slave flip-flops Q 2n 4./3. C Q 2s 4./3. C Master-slave flip-flops Q 3n 4./3. C Q 3s 4./3. C Y Logic schematic Q m Q s Q 2m Q 2s Q 3m Q 3s 4. Copyright by aniel. Gajski t t t 2 t 3 t 4 t 5 t 6 t 7 Timing diagram 2
13 Edge-triggered flip-flop flop Set latch A S R Output latch B Reset latch Logic schematic Q Q A S R.4.4 B Q Copyright by aniel. Gajski t t t 2 t 3 t 5 t 6 Timing diagram 3 t 4 t 7 t 8 t 9
14 Flip-flop types Flip-flop name Flip-flop symbol Characteristic table Characteristic equation Excitation table SR S Q R Q S R Q(next) Q NA Q(next)=S+R Q SR= Q Q(next) S R JK J Q K Q J K Q(next) Q Q Q(next)=JQ +K Q Q Q(next) J K Q Q Q(next) Q(next)= Q Q(next) T T Q Q T Q(next) Q Q Q(next)=TQ +T Q Q Q(next) T Note: For master-slave and edge-triggered flip-flops data inputs must satisfy Copyright by aniel. Gajski set-up and hold time constraints. 4
15 State diagrams for different flip-flops flops Flip-flop name State diagram SR S,R=, S,R=, Q= Q= S,R=, S,R=, J,K=, or, J,K=, J,K=, JK Q= Q= J,K=, or, = = Q= Q= = T T= = T= Q= Q= T= T= Copyright by aniel. Gajski 5
16 A latch and flip-flop flop with asynchronous inputs CLR C Q Q PRS Q C Q CLR PRS latch Graphic symbol PRS Set latch A S Q PRS Q R Q C Q CLR B Output latch Graphic symbol CLR Reset latch Copyright by aniel. Gajski Edge-triggered flip-flop 6
17 Graphic symbols for flip-flops flops with asynchronous inputs Flip-flop name SR JK Flip-flop symbol Preset S Q R Q Clear Preset J Q K Q Clear Preset Q Q Clear Preset T T Q Q Clear Copyright by aniel. Gajski 7
18 Analysis of sequential logic Excitation equations are Boolean expressions of the flip-flop inputs. Next-state equations are Boolean expressions representing the next value of the flip- flop outputs. Next-state table ( similar to next-state equations ) gives the next value of flip-flop outputs for each input value and state of flip-flops. Analysis of a sequential circuit is a procedure that produces the nextstate table, state diagram and timing diagram from the logic schematic of the circuit. The analysis gives the answer to the following questions: (a) What is the next state? (b) What is the output? (c) What is the function of the circuit? Copyright by aniel. Gajski 8
19 Analysis of a sequential circuit Example: Modulo-4 4 counter Problem: erive the state table and state diagram for the sequential ential circuit represented by the schematic below. Cnt Q Q Cnt= Q Q = Cnt= Q Q = Cnt= Logic schematic Q Q = Cnt Q = Cnt Q + Cnt Q Cnt= Cnt= Q Q = Cnt= State diagram Cnt= Q Q = = Cnt Q + Cnt Q Q + Cnt Q Q Clock cycle Clock cycle 2 Clock cycle 3 Clock cycle 4 Excitation equation Q (next) = = Cnt Q + Cnt Q Q (next) = = Cnt Q + Cnt Q Q + Cnt Q Q Next-state equation Cnt Cnt= PRESENT STATE Q Q NET STATE Q (next) Q (next) Q Copyright by aniel. Gajski Cnt= State table Cnt= 9 Q t t t 2 t 3 t 4 t 5 Timing diagram
20 Analysis of a Moore-type modulo-4 4 counter Example: Moore-type modulo-4 4 counter Problem: erive the state and output tables and the state diagram for the sequential circuit given by the schematic below. = Cnt Q = Cnt Q + Cnt Q = Cnt Q + Cnt Q Q + Cnt Q Q Excitation equation Q (next) = = Cnt Q + Cnt Q Q (next) = = Cnt Q + Cnt Q Q + Cnt Q Q Y = Q Q Next-state and output equation Logic schematic PRESENT STATE NET STATE OUTPUTS Q Q Q (next) Q (next) Y Cnt= Cnt= Copyright by aniel. Gajski State and output table 2
21 Analysis of a Moore type modulo-4 4 counter Cnt= Cnt= Q Q = Y= Cnt= Q Q = Y= Cnt= Cnt= Cnt= Cnt= Q Q = Y= Cnt= Q Q = Y= State diagram Cnt Q Q Y t t t 2 t 3 t 4 Timing diagram t 5 Copyright by aniel. Gajski 2
22 Analysis of a Mealy-type modulo-4 4 counter Example: Mealy-type modulo-4 4 counter Problem: erive the state/output table and the state diagram for the sequential ential Cnt circuit given below. Q Y = Cnt Q = Cnt Q + Cnt Q Q = Cnt Q + Cnt Q Q + Cnt Q Q Excitation equation Q (next) = = Cnt Q + Cnt Q Q Q (next) = = Cnt Q + Cnt Q Q + Cnt Q Q Q Y = Cnt Q Q Logic schematic Copyright by aniel. Gajski Next-state and output equation PRESENT STATE Q Q NET STATE /OUTPUTS Q (next) Q (next)/y Cnt= Cnt= / / / / / / / / State and output table 22
23 Analysis of a Mealy-type modulo-4 4 counter Cnt=/Y= Q Q = Cnt=/Y= Q Q = Cnt=/Y= Cnt=/Y= Cnt=/Y= Cnt=/Y= Q Q = Cnt=/Y= Q Q = Cnt=/Y= State diagram Clock cycle Clock cycle 2 Clock cycle 3 Clock cycle 4 Cnt Q Q Y Copyright by aniel. Gajski t t t 2 t 3 t 4 t 5 Timing diagram 23
24 Analysis procedure for sequential circuits Logic schematic erive excitation equations erive next-state and output equations 2 Generate next-state and output tables 3 Generate state diagram 4 evelop timing diagram 5 Simulate logic schematic 6 Copyright by aniel. Gajski 24
25 Finite-state machine model I A Q,, Q m Y O A k Y n The finite state machine ( FSM ) can be defined abstractly as the quintuple < S, I, O, f, h> where S, I, and O represent a set of states, set of inputs and a set of outputs, respectively, and f and h represent the next-state and the output functions. f : S x I S h : S x I O ( Mealy-type ) S O ( Moore-type ) S = Q x Q 2 x x Q m, I = A x A 2 x x A k, O = Y x Y 2 x x Y n, Copyright by aniel. Gajski 25
26 FSM model of modulo-4 4 counter ( Moore ) Cnt Q Q Copyright by aniel. Gajski Logic schematic Q Q = Cnt Q = Cnt Q + Cnt Q = Cnt Q + Cnt Q Q + Cnt Q Q Excitation equation Q (next) = = Cnt Q + Cnt Q Q (next) = = Cnt Q + Cnt Q Q + Cnt Q Q PRESENT STATE Q Q Next-state equation NET STATE Q (next) Q (next) Cnt= State table Cnt= 26 PRESENT STATE S S S 2 S 3 NET STATE ( SxI S ) i i S S S S 2 S 2 S 3 S 3 S OUTPUTS (S O) FSM model of modulo-4 counter Note: Output is dependent only on the state of FSM. O O O O
27 FSM model of modulo-4 4 counter ( Mealy ) Cnt Q Y Q Q Q PRESENT STATE NET STATE(SxI S)/ OUTPUT(SxI O) i i Logic schematic = Cnt Q = Cnt Q + Cnt Q = Cnt Q + Cnt Q Q + Cnt Q Q Excitation equation Q (next) = = Cnt Q + Cnt Q Q (next) = = Cnt Q + Cnt Q Q + Cnt Q Q Y = Cnt Q Q Next-state and output equations PRESENT STATE Q Q Copyright by aniel. Gajski NET STATE /OUTPUTS Q (next) Q (next)/y Cnt= / / / / State and output table Cnt= / / / / 27 S S S 2 S 3 S /O S /O S /O S 2 /O S 2 /O S 3 /O S 3 /O S /O FSM model of modulo-4 counter Note: Output is dependent on the state and the input of the FSM.
28 Finite-state state-machine implementations State-based Input-based Copyright by aniel. Gajski 28
29 Synthesis procedure for sequential logic esign description or timing diagram evelop state diagram Generate next-state and output tables Minimize states Encode inputs, states, outputs erive next-state and output equations Choose memory elements erive excitation equations Optimize logic implementation erive logic schematic and timing diagrams Simulate logic schematic Verify functionality and timing Copyright by aniel. Gajski 29
30 State diagram for a modulo-3 3 up/down counter Example: Modulo-3 3 up-down counter Problem: erive the state diagram for an up-down, modulo-3 3 counter. The counter has two inputs: count enable (C) and count direction (). When C=, the counter will count in the direction specified by, and it will stop counting when C=. the counter will count up when = and down when =. The counter has one output Y which will be asserted when the counter reaches 2 while counting up, or when it reaches s while counting down. C Modulo-3 up/down counter Counter symbol Y Partial state diagram (up and down counting) C= C= C= C= C= u u u 2 C= C= C= C= C= C= C= C= C= d d d 2 Copyright by aniel. Gajski Partial state diagram (changing direction) 3 C= C= C= C= Final state diagram
31 State minimization State minimization reduces the number of states, and therefore, number of flip-flops needed to implemented the circuit. State minimization is based on the concept of behavioral equivalence which states that two FSM are equivalent if they produce the same sequence of output symbols for every sequence of input symbols. More formally, two states, s j and s k in an FSM are said to be equivalent, s j s k, iff the following two conditions are true. Condition : Both states s j and s k produce the same output symbol for every input symbol i: that is, h (s j,i) = h (s k,i); Condition 2: Both states have equivalent next sates for every input symbol i : that is, h (s j,i) = h (s k,i); Minimization procedure:. partition states into equivalence classes 2. construct new FSM with one state for each equivalence class Copyright by aniel. Gajski 3
32 State reduction for modulo-3 3 counter Example: State reduction Problem: erive the minimal-state FSM for the modulo-3 3 counter. PRESENT STATE NET STATE / OUTPUT C= C= C= u u / u / d / 2 u u / u / 2 d / u 2 u 2 / u / d / d d / u / d / 2 d d / u / 2 d / d 2 / u / d / d 2 PRESENT STATE s NET STATE / OUTPUT C= C= C= s / s / s s / s / 2 s 2 / s / s 2 Initial next-state/output table s 2 / s / s / Partition into arrays with the same output Partition into arrays with the same next state C = C = ( u, u, u 2, d, d, d 2 ) G = (u, d ) G = (u, d ) G 2 = (u 2, d 2 ) G G G G G 2 G 2 G G G 2 G 2 G G G 2 G 2 G G G G Partitioning into equivalence classes Output values Next states Final next-state/output table Copyright by aniel. Gajski 32
33 State reduction with implication table Example: State reductions with implication table. Problem: Find the minimal number of states for the FSM specified by the table t below. s s 2 s 3 s 4 s 5 <s 3,s 4 > <s 2,s 6 > <s,s 4 > s 6 s s s 2 s 3 s 4 s 5 Implication table PRESENT STATE NET STATE C= C= C= u u / u / d / 2 u u / u / 2 d / u 2 u 2 / u / d / d d / u / d / 2 d d / 2 u / 2 d / d 2 / u / d / d 2 Next-state and output table u u 2 d d <u,d 2 > Equivalence classes: <u, d > <u > <d > <u 2, d 2 > d 2 u u u 2 d d Implication table for the table above Copyright by aniel. Gajski 33
34 State encoding ENCOING NUMBER s s s 2 s 3 The cost and delay of FSM implementation depends on encoding of symbolic states. For example, four states can be encoded in 4!=24 different ways. There are more than n! different encodings for n states. Exploration of all encodings is impossible Thus, we use heuristics. Three different heuristics: minimum-bit change prioritized adjacency one-hot encoding Copyright by aniel. Gajski 24 encodings of four states 34
35 Minimum-bit change Minimum-bit change strategy assigns codes to states so that the total number of bit changes for all state transitions is minimized. In other words, if every arc in the state diagram has a weight that is equal to the number of bits by which the source and destination encodings differ, then the optimal encoding would be the one that minimizes the sum of all these weights. Example: Two different encodings for 2-bit binary counter. s Straightforward encoding Minimum-bit-change encoding Copyright by aniel. Gajski 35
36 Prioritized adjacency Prioritized adjacency strategy assigns adjacent encodings to all states with common source, common destination or common output. Highest priority is given to states with the same next state since the same next-state code will appear in adjacent entries in the Karnaugh map. The second priority is given to the next states of the same state since they also may appear adjacent in the Karnaugh map. The third priority is given to states that have the same output value for the same input value since they may be adjacent in the output map. Example: encoding based on prioritized adjacency. Copyright by aniel. Gajski Initial state diagram Priority : (s, s 2 ) Priority 2: (s, s 2 ) Priority : (s, s ), (s 2, s 3 ) Adjacency priorities 36 /, / / / / s / Possible encoding
37 Hot-one one encoding Hot-one encoding is a redundant encoding with one flip-flop per state having value and others having value. The flip-flop with value reminds one of a hot-potato being passed from one hand to another. Hot-one encoding is too expensive for FSMs with large number of states. It is used only in small FSMs. Copyright by aniel. Gajski 37
38 Encoding example Example: State encodings for modulo-3 3 counter. Problem: Given the up/down, modulo-3 3 counter which was specified by the minimal next-state/output table in Figure 6.8 derive the encoding that will minimize the cost and delay of the counter logic. STATE ENCOING A ENCOING B ENCOING C Q Q Q Q Q 2 Q Q S S S 2 Possible state encodings for modulo-3 counter Encoding A = Minimum-bit change/prioritized adjacency Encoding B = Simplified output logic Encoding C = Hot-one encoding Copyright by aniel. Gajski 38
39 Cost/delay estimation for encoding A C Q Q Q Q Q (next), Q (next) Next-state map Q (next) = Q C +Q C +Q Q C Q (next) = Q C +Q C+Q Q C Y= Q C +Q Q C Excitation and output equations C Y Output map.4 Q (next).4 Q (next) Y Cost (Q ) = 24 elay (Q ) = Cost (Q ) = 24 elay (Q ) = 4. Cost and delay estimation Cost (Y) = 8 elay (Y) = 3.6 Copyright by aniel. Gajski Total cost = 66 Max. input delay = 4.ns, Max. output delay = 3.6ns 39
40 Cost/delay estimation for encoding B C Q Q Q Q Q (next), Q (next) Next-state map Q (next) = Q C +Q C+Q Q C Q (next) = Q C +Q C +Q Q C Y= Q C+Q C Excitation and output equations C Y Output map Cost (Q ) = 24 elay (Q ) = 4. Q (next) Q (next).8 Cost (Q ) = 24 elay (Q ) = 4. Cost and delay estimation.8 Y.4.8 Cost (Y) = 6 elay (Y) = 3.2 Copyright by aniel. Gajski Total cost = 64 Max. input delay = 4.ns, Max. output delay = 3.2ns 4
41 Cost/delay estimation for encoding C Q 2 Q Q C Q 2 (next),q (next),q (next) Next-state map Q 2 Q Q Q 2 (next) = Q 2 C +Q C+Q C Q (next) = Q C +Q 2 C+Q C Q (next) = Q C +Q 2 C +Q C Y= Q C+Q 2 C Excitation and output equations Q 2 (next) Q (next) Q (next) C Y.8.8 Output map Y.4 Cost (Q ) = Cost (Q ) = Cost (Q 2 ) = 22 elay (Q ) = elay (Q ) = elay (Q ) = 3.6 Cost and delay estimation Cost (Y) = 6 elay (Y) = 3.2 Copyright by aniel. Gajski Total cost = 82 Max. input delay = 3.6ns, Max. output delay = 3.2ns 4
42 Choice of memory elements Select the type of flip-flop from:, SR, JK, T SR and JK reduce the cost of input logic; but require twice as many connections. and T require single connection per flip-flop. T is suitable for counting functions since it changes output value when its input is. Copyright by aniel. Gajski 42
43 Modulo-3 3 counter implementation with different flip-flops flops Example: Flip-flop selection. Problem: Given the modulo-3 3 counter with Encoding A, as specified below, select the type of flip-flop flop that will minimize the cost and/or delay of input logic. C Q Q Q (next), Q (next) Q (present) Q (next)) S R J K T Next-state table for encoding A C Q Q S,R,S,R Flip-flop excitation table S = Q C +Q Q C (cost = 8, delay = 3.6) R = Q C = (Q +C ) (cost = 4, delay =.4) S = Q C+Q Q C (cost = 8, delay = 3.6) R = Q C = (Q +C ) (cost = 4, delay =.4) Copyright by aniel. Gajski Implementation with SR flip-flops 43
44 Modulo-3 3 counter with different flip-flops flops C Q Q C Q Q S,R,S,R S = Q C +Q Q C (cost = 8, delay = 3.6) J,K,J,K J = Q C +Q C = (C +Q +Q ) (cost = 2, delay = 2.4) R = Q C = (Q +C ) (cost = 4, delay =.4) K = C (cost =, delay = ) S J = Q C+Q C = (C +Q +Q ) (cost = 2, delay = 2.4) = Q C+Q Q C (cost = 8, delay = 3.6) R = Q C = (Q +C ) (cost = 4, delay =.4) K = C (cost =, delay = ) C Q Q T,T Implementation with SR flip-flops Implementation with JK flip-flops Q Q C T = Q C+Q C+Q C (cost = 22, delay = 3.6) = Q C +Q C +Q Q C (cost = 24, delay = 4.) T = Q C+Q C+Q C (cost = 22, delay = 3.6) = Q C +Q C+Q Q C (cost = 24, delay = 4.),, Implementation with T flip-flops Implementation with flip-flops Copyright by aniel. Gajski 44
45 C Optimization and timing Y Input-output delays C, to to Y C, to Y to C Q Logic schematic elay table Q Y t t Copyright by aniel. Gajski t 2 t 3 Timing diagram 45 t 4 t 5 t 6
46 Chapter Summary We introduced memory elements Latches (asynchronous) Flip-flops (synchronous) We presented several ways to describe memory elements Characteristic tables Characteristic equations Static diagrams Timing diagrams We described procedures for sequential logic Analysis Synthesis with FSM capture state minimization state encoding optimization and timing We defined the concept of a FSM Copyright by aniel. Gajski 46
Sequential 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 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 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 informationTopic 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
More informationLecture 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
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 6 Following the slides of Dr. Ahmed H. Madian محرم 1439 ه Winter
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 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 informationSequential 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
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 informationL4: Sequential Building Blocks (Flip-flops, Latches and Registers)
L4: Sequential Building Blocks (Flip-flops, Latches and Registers) Acknowledgements: Lecture material adapted from R. Katz, G. Borriello, Contemporary Logic esign (second edition), Prentice-Hall/Pearson
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 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 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 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 informationSequential 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,
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 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 informationTopic 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
More informationReg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering
Sp 6 Reg. No. Question Paper Code : 27156 B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2015. Second Semester Computer Science and Engineering CS 6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN (Common
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 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 informationALU, Latches and Flip-Flops
CSE14: Components and Design Techniques for Digital Systems ALU, Latches and Flip-Flops Tajana Simunic Rosing Where we are. Last time: ALUs Plan for today: ALU example, latches and flip flops Exam #1 grades
More informationSequential 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
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 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 informationDigital Electronics Sequential Logic
/5/27 igital Electronics Sequential Logic r. I. J. Wassell Sequential Logic The logic circuits discussed previously are known as combinational, in that the output depends only on the condition of the latest
More informationL4: Sequential Building Blocks (Flip-flops, Latches and Registers)
L4: Sequential Building Blocks (Flip-flops, Latches and Registers) Acknowledgements:., Materials in this lecture are courtesy of the following people and used with permission. - Randy H. Katz (University
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 informationChapter 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
More informationTime Allowed 3:00 hrs. April, pages
IGITAL ESIGN COEN 32 Prof. r. A. J. Al-Khalili Time Allowed 3: hrs. April, 998 2 pages Answer All uestions No materials are allowed uestion a) esign a half subtractor b) esign a full subtractor c) Using
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 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 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 informationOverview 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
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 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 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 informationIntroduction 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
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 informationTopics for Lecture #9. Button input processor
opics for Lecture # Reminder: midterm examination # next uesday starting at :0am. Examples of small state machines simultaneous button push detector (continued) button push processor pulse stretcher General
More informationGates 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
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 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 informationCPE100: Digital Logic Design I
Chapter 3 Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu http://www.ee.unlv.edu/~b1morris/cpe1/ CPE1: Digital Logic Design I Section 14: Dr. Morris Sequential Logic Design Chapter 3 Chapter
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 informationLecture 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
More informationIntegrated Circuits & Systems
Federal University of Santa Catarina Center for Technology Computer Science & Electronics Engineering Integrated Circuits & Systems INE 5442 Lecture 18 CMOS Sequential Circuits - 1 guntzel@inf.ufsc.br
More informationECE 341. Lecture # 3
ECE 341 Lecture # 3 Instructor: Zeshan Chishti zeshan@ece.pdx.edu October 7, 2013 Portland State University Lecture Topics Counters Finite State Machines Decoders Multiplexers Reference: Appendix A of
More informationDesign of Datapath Controllers
Design of Datapath Controllers Speaker: 俞子豪 Adviser: Prof. An-Yeu Wu ACCESS IC LAB Outline vsequential Circuit Model vfinite State Machines vuseful Modeling Techniques P. 2 Model of Sequential Circuits
More informationLOGIC 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
More informationChapter 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
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 informationDigital Logic Design. Midterm #2
EECS: igital Logic esign r. nthony. Johnson s7m2s_dild7.fm - igital Logic esign Midterm #2 Problems Points. 5 2. 4 3. 6 Total 5 Was the exam fair? yes no EECS: igital Logic esign r. nthony. Johnson s7m2s_dild7.fm
More informationEE141- Spring 2007 Digital Integrated Circuits
EE141- Spring 27 igital Integrated Circuits Lecture 19 Sequential Circuits 1 Administrative Stuff Project Ph. 2 due Tu. 5pm 24 Cory box + email ee141- project@bwrc.eecs.berkeley.edu Hw 8 Posts this Fr.,
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 informationSYNCHRONOUS SEQUENTIAL CIRCUITS
CHAPTER SYNCHRONOUS SEUENTIAL CIRCUITS Registers an counters, two very common synchronous sequential circuits, are introuce in this chapter. Register is a igital circuit for storing information. Contents
More informationVidyalankar 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
More informationENGG 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
More informationI. 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,
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 of COE 22: Digital Logic Design (3--3) Term (Fall 22) Final Exam Sunday January
More informationTiming Constraints in Sequential Designs. 63 Sources: TSR, Katz, Boriello & Vahid
Timing Constraints in Sequential esigns 63 Sources: TSR, Katz, Boriello & Vahid Where we are now. What we covered last time: FSMs What we ll do next: Timing constraints Upcoming deadlines: ZyBook today:
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 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 informationDIGITAL 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
More informationDigital Logic: Boolean Algebra and Gates. Textbook Chapter 3
Digital Logic: Boolean Algebra and Gates Textbook Chapter 3 Basic Logic Gates XOR CMPE12 Summer 2009 02-2 Truth Table The most basic representation of a logic function Lists the output for all possible
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Sequential Logic Stephen A. Edwards Columbia University Summer 2017 State-Holding Elements Bistable Elements S Latch Latch Positive-Edge-Triggered Flip-Flop Flip-Flop with
More informationProblem Set 9 Solutions
CSE 26 Digital Computers: Organization and Logical Design - 27 Jon Turner Problem Set 9 Solutions. For each of the sequential circuits shown below, draw in the missing parts of the timing diagrams. You
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 informationFundamentals 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
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 informationCounters. 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
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 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 informationPhiladelphia 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
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 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: J. Rose and
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Review for the Final Stephen A. Edwards Columbia University Summer 25 The Final 2 hours 8 problems Closed book Simple calculators are OK, but unnecessary One double-sided
More informationChapter 3. Digital Design and Computer Architecture, 2 nd Edition. David Money Harris and Sarah L. Harris. Chapter 3 <1>
Chapter 3 Digital Design and Computer Architecture, 2 nd Edition David Money Harris and Sarah L. Harris Chapter 3 Chapter 3 :: Topics Introduction Latches and Flip-Flops Synchronous Logic Design Finite
More informationSequential Logic Optimization. Optimization in Context. Algorithmic Approach to State Minimization. Finite State Machine Optimization
Sequential Logic Optimization! State Minimization " Algorithms for State Minimization! State, Input, and Output Encodings " Minimize the Next State and Output logic Optimization in Context! Understand
More informationMAHALAKSHMI 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
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 informationSequential 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
More informationPhiladelphia University Faculty of Engineering
Philadelphia University Faculty of Engineering Marking Scheme Exam Paper BSc CE Logic Circuits (630211) Final Exam First semester ate: 03/02/2019 Section 1 Weighting 40% of the module total Lecturer: Coordinator:
More informationChapter 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
More informationDepartment of Electrical & Electronics EE-333 DIGITAL SYSTEMS
Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS 1) Given the two binary numbers X = 1010100 and Y = 1000011, perform the subtraction (a) X -Y and (b) Y - X using 2's complements. a) X = 1010100
More informationChapter 3. Chapter 3 :: Topics. Introduction. Sequential Circuits
Chapter 3 Chapter 3 :: Topics igital esign and Computer Architecture, 2 nd Edition avid Money Harris and Sarah L. Harris Introduction Latches and Flip Flops Synchronous Logic esign Finite State Machines
More informationAnalysis 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
More informationUnit II Chapter 4:- Digital Logic Contents 4.1 Introduction... 4
Unit II Chapter 4:- Digital Logic Contents 4.1 Introduction... 4 4.1.1 Signal... 4 4.1.2 Comparison of Analog and Digital Signal... 7 4.2 Number Systems... 7 4.2.1 Decimal Number System... 7 4.2.2 Binary
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 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 informationSample 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:
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 informationChapter 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
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 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 informationLOGIC 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
More informationDigital Logic Appendix A
Digital Logic Appendix A Boolean Algebra Gates Combinatorial Circuits Sequential Circuits 1 Boolean Algebra George Boole ideas 1854 Claude Shannon, apply to circuit design, 1938 Describe digital circuitry
More informationChapter 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
More informationS.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
More information