Chapter 6 Analysis of Sequential Systems Sequential Memory Feedback.

Slides:



Advertisements
Similar presentations
Clocked Synchronous State-machine Analysis
Advertisements

State-machine structure (Mealy)
A. Abhari CPS2131 Sequential Circuits Most digital systems like digital watches, digital phones, digital computers, digital traffic light controllers and.
Princess Sumaya University
Digital Electronics Chapter 5 Synchronous Sequential Logic.
Multiplexors Sequential Circuits and Finite State Machines Prof. Sin-Min Lee Department of Computer Science.
Sequential logic circuits. 2 Outline Sequential Circuit Models –Asynchronous –Synchronous Latches Flip-Flops.
CSCE 211: Digital Logic Design. Chapter 6: Analysis of Sequential Systems.
Circuits require memory to store intermediate data
1 © 2014 B. Wilkinson Modification date: Dec Sequential Logic Circuits – I Flip-Flops A sequential circuit is a logic components whose outputs.
CS 151 Digital Systems Design Lecture 21 Analyzing Sequential Circuits.
1 Lecture 23 More Sequential Circuits Analysis. 2 Analysis of Combinational Vs. Sequential Circuits °Combinational : Boolean Equations Truth Table Output.
ECE 331 – Digital System Design Introduction to and Analysis of Sequential Logic Circuits (Lecture #20) The slides included herein were taken from the.
EECC341 - Shaaban #1 Lec # 14 Winter Clocked Synchronous State-Machines Such machines have the characteristics: –Sequential circuits designed.
A clocked synchronous state-machine changes state only when a triggering edge or “tick” occurs on the clock signal. ReturnNext  “State-machine”: is a.
Chapter 6 Analysis of Sequential Systems Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Digital Logic Design CHAPTER 5 Sequential Logic. 2 Sequential Circuits Combinational circuits – The outputs are entirely dependent on the current inputs.
SEQUENTIAL CIRCUITS Introduction
Digital Computer Design Fundamental
EE2174: Digital Logic and Lab Professor Shiyan Hu Department of Electrical and Computer Engineering Michigan Technological University CHAPTER 9 Sequential.
Synchronous Sequential Logic Chapter 5. Digital Circuits Sequential Circuits Combinational circuits contains no memory elements the outputs depends.
Chap 4. Sequential Circuits
Sequential Circuits. Two primary differences between combinational circuits and sequential circuits –Sequential circuits are synchronous (use a clock)
Sequential Logic Combinatorial components: the output values are computed only from their present input values. Sequential components: their output values.
Boolean Algebra and Logic Gates 1 Computer Engineering (Logic Circuits) Lec. # 10 (Sequential Logic Circuit) Dr. Tamer Samy Gaafar Dept. of Computer &
2017/4/24 1.
Digital Logic of Computer Engineering KKU.1 Chapter 5 Sequential Systems Latches and Flip-flops Synchronous Counter Asynchronous.
Analysis and Synthesis of Synchronous Sequential Circuits A “synchronizing” pulse/edge signal (clock) controls the operation of the memory portion of the.
Synchronous Sequential Logic Part I
5 Chapter Synchronous Sequential Circuits 1. Logic Circuits- Review 2 Logic Circuits Sequential Circuits Combinational Circuits Consists of logic gates.
Introduction to Sequential Logic Design Finite State-Machine Analysis.
Chapter 8 Solving Larger Sequential Problems.
5 - 1 Chapter 6 Analysis of Sequential Systems Chapter 6 Analysis of Sequential Systems 6.0 Introduction  Clocked System Clock A signal that alternates.
EEE 301 DIGITAL ELECTRONICS
Mealy and Moore Machines Lecture 8 Overview Moore Machines Mealy Machines Sequential Circuits.
2018/5/2 EE 4271 VLSI Design, Fall 2016 Sequential Circuits.
Flip Flops.
LATCHED, FLIP-FLOPS,AND TIMERS
Introduction to Sequential Logic Design
ANALYSIS OF SEQUENTIAL CIRCUITS
Lecture 12 Analysis of Clocked Sequential Network
SLIDES FOR CHAPTER 13 ANALYSIS OF CLOCKED SEQUENTIAL CIRCUITS
CSCE 211: Digital Logic Design
FIGURE 5.1 Block diagram of sequential circuit
Digital Design Lecture 9
2018/8/29 EE 4271 VLSI Design, Fall 2013 Sequential Circuits.
Synchronous Sequential Circuits
CSCE 211: Digital Logic Design
Sequential Circuits Most digital systems like digital watches, digital phones, digital computers, digital traffic light controllers and so on require.
CS1104 – Computer Organization
CISE204: Design of Digital Systems Lecture 18 : Sequential Circuits
ECE 301 – Digital Electronics
Assistant Prof. Fareena Saqib Florida Institute of Technology
T Flip-Flop A T (toggle) flip-flop is a complementing flip-flop and can be obtained from a JK flip-flop when the two inputs are tied together. When T.
ECE Digital logic Lecture 16: Synchronous Sequential Logic
CSCE 211: Digital Logic Design
Sequential logic circuits
CSCE 211: Digital Logic Design
Chapter 6 -- Introduction to Sequential Devices
CSCE 211: Digital Logic Design
INTRODUCTION TO LOGIC DESIGN Chapter 5 Synchronous Sequential Logic
Reference: Chapter 5 Sequential Circuits Moris Mano 4th Ediditon
Analysis of Sequential Systems
Synchronous sequential
Synchronous Sequential
Sequential Circuits UNIT- IV
CSCE 211: Digital Logic Design
Lecture 14: State Tables, Diagrams, Latches, and Flip Flop
Chapter 5 Sequential Circuits.
2019/9/26 EE 4271 VLSI Design, Fall 2012 Sequential Circuits.
Presentation transcript:

Chapter 6 Analysis of Sequential Systems Sequential Memory Feedback

Engineering Takes three approaches 1.Analysis – looks at a system to determine how it works 2.Design – looks at how to make a system 3.Application – looks at integration of existing designs for solution Chapter 6 is analysis Chapter 7 is design Combinational logic uses AND, OR, NOT to create circuit. Sequential logic uses Flip / Flops to create memory. Usually adds combinational as input and output to the memory.

Asynchronous - USB Synchronous – Cell phone Frequency = 1/T 200 MHz = 50 microsec “ON” duration can vary Pulse is often choice Power depends on “ON” duration Time Clock Enable Simply another input Leading edge – active high Trailing or falling edge – active low Signal is active as approaches active level Transition not sharp, but has slope

CE6. A system with one input x and one output z such that z = 1 iff x has been 1 for at least three consecutive clock times. State: what is stored in memory. It is stored in binary devices, but the information to be stored is not always naturally binary. Timing trace: a set of values for the input and output (and sometimes the state or other variables of the system, as well) at consecutive clock times.

State table: shows for each input combination and each state, what the output is and what the next state is, that is, what is to be stored in memory after the next clock. State diagram (or state graph): a graphical representation of the state table. Moore machine output occurs at next state Requires one more state (FF) but less logic

Mealy machine output occurs at present state + input Requires one less state (FF) but more logic

Flip Flops / Latch When S=0, R=1, Q t+1 = 0 When S=1, R=0, Q t+1 = 1 S = Set R = Reset

Characteristic Excitation Characteristic Symbol Circuit Table Table Eq. Asynchronous (RS F/F)

Characteristic Excitation Characteristic Symbol Circuit Table Table Eq. Synchronous

P = (S + Q)´ Q = (R + P)´

Q’ = (S + Q)´ Flip flop is a latch triggered by a clock 1. Has feedback 2. Is memory device 3. Holds the state S = set, output q=1 R = reset, output q=0 Q’

F/F designs SR is the basic device Q indeterminant w/ SR=11 JK uses feedback to fix D is delay D into S & D’ into R T is toggle T into both J & K Q’

q* = S + R´q

q* = J´q + K´q

D 1 = q 1 q´ 2 + x q´ 1 D 2 = xq 1 z = q´ 2

D 1 = q 1 q´ 2 + x q´ 1 D 2 = xq 1 z = q´ 2 PS x= q1q1 q2q2 D1D1 D2D2 D1D1 D2D2 q1*q1*q2*q2*q1*q1*q2*q2* z

D 1 = q 1 q´ 2 + x q´ 1 D 2 = xq 1 z = q´ 2 PS x= q1q1 q2q2 D1D1 D2D2 D1D1 D2D2 q1*q1*q2*q2*q1*q1*q2*q2* z Moore: Output depends Only on state, So show out inside state

Moore machine, output z does not depend on input x J 1 = xK 1 = xB´ J 2 = K 2 = x + A´ z = A + B

1.Row 1,look at both A(1) B(2) 2.Start w/ x=0 3.PS, A=0 B=0 (Qa=0 Qb=0) 4.J1=K1=0 5.J2=K2=1 6.Then from table get NS 7.J1=0, K1=0→ A*=A=0 8.J2=1, K2=1 →B*=B’=1 1.Row 2 2.Start w/ x=0 3.PS, A=0 B=1 (Qa=0 Qb=1) 4.J1=K1=0 5.J2=K2=1 6.Then from table get NS 7.J1=0, K1=0→ A*=A=0 8.J2=1, K2=1 →B*=B’=0 J 1 = xK 1 = xB´ J 2 = K 2 = x + A´ z = A + B PSx= ABJ1J1 K1K1 J2J2 K2K2 J1J1 K1K1 J2J2 K2K2 A*B*A*B* z

1.x=0, look at A (1) only 2.J1=K1=0 3.J2=K2=1 4.Then from table get NS 5.J1=0, K1=0→ A*=A 1.x=1, look at A (1) only 2.J1=1, K1=B’ 3.When B=0, J1=K1 4.A=Toggle 5.When B=1, J1=1, Ka=0 6.A=1 PSx= ABJ1J1 K1K1 J2J2 K2K2 J1J1 K1K1 J2J2 K2K2 A*B*A*B* z J 1 = xK 1 = xB´ J 2 = K 2 = x + A´ z = A + B

1.look at B (2) only 2.When A=0, J2=K2=1 3.B*=toggle 4.When A=1, J2=K2=x 5.for x=0, B*=B 6.for x=1, B*=toggle 7.J1=0, K1=0→ A*=A PSx= ABJ1J1 K1K1 J2J2 K2K2 J1J1 K1K1 J2J2 K2K2 A*B*A*B* z J 1 = xK 1 = xB´ J 2 = K 2 = x + A´ z = A + B

PSx= ABJ1J1 K1K1 J2J2 K2K2 J1J1 K1K1 J2J2 K2K2 A*B*A*B* z J 1 = xK 1 = xB´ J 2 = K 2 = x + A´ z = A + B

Alternative is use Boolean equations For J-K f/f q*=Jq’ + K’q For this problem A* = JaA’ + Ka’A = xA’ + (xB’)A = xA” + x’A + AB B* = Jb’ + Kb’B = (x + A’)B’ + (x + A’)B = xB’ + A’B’ + x’AB J 1 = xK 1 = xB´ J 2 = K 2 = x + A´ z = A + B PSx= ABJ1J1 K1K1 J2J2 K2K2 J1J1 K1K1 J2J2 K2K2 A*B*A*B* z

D 1 = xq 1 + xq 2 D 2 = xq´ 1 q´ 2 z = xq 1 Mealy, output z depends on input x, as well as state variables (F/F) So state table will have output for x=0 & for x=1 D f/f, q* = D q 1 * = xq 1 + xq 2 q 2 * = xq´ 1 q´ 2

D 1 = xq 1 + xq 2 D 2 = xq´ 1 q´ 2 z = xq 1 State 11 is never reached PS x= x=0x=1 q1q1 q2q2 D1D1 D2D2 D1D1 D2D2 q1*q1*q2*q2*q1*q1*q2*q2* z Mealy: Output depends on state & input, So show out on transition

D 1 = xq 1 + xq 2 D 2 = xq´ 1 q´ 2 z = xq 1 Glitch z = x q 1 x=1 after q 1 =1 Fixed by next clock PS x= x=0x=1 q1q1 q2q2 D1D1 D2D2 D1D1 D2D2 q1*q1*q2*q2*q1*q1*q2*q2* z