Analysis of Synchronous Sequential Circuits

Slides:

Advertisements

Similar presentations

COE 202: Digital Logic Design Sequential Circuits Part 2

Advertisements

Clocked Synchronous State-machine Analysis

State-machine structure (Mealy)

COE 202: Digital Logic Design Sequential Circuits Part 3

A. Abhari CPS2131 Sequential Circuits Most digital systems like digital watches, digital phones, digital computers, digital traffic light controllers and.

Synchronous Sequential Logic

1 Lecture 23 More Sequential Circuits Analysis. 2 Analysis of Combinational Vs. Sequential Circuits °Combinational : Boolean Equations Truth Table Output.

Sequential Logic Design with Flip-flops

Registers.1. Register  Consists of N Flip-Flops  Stores N bits  Common clock used for all Flip-Flops Shift Register  A register that provides the.

ECE C03 Lecture 101 Lecture 10 Finite State Machine Design Hai Zhou ECE 303 Advanced Digital Design Spring 2002.

ECE 301 – Digital Electronics Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #17)

ECE 331 – Digital Systems Design Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #19)

Analyzing our example circuit

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 =

(Sequential Logic Circuit)

CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.

Chap 4. Sequential Circuits

Synchronous Sequential Logic Chapter 5. Digital Circuits Sequential Circuits Combinational circuits contains no memory elements the outputs depends.

Sequential Circuit Design. Outline  Flip-flop Excitation Tables  Sequential Circuit Design  Design: Example #1  Design: Example #2  Design: Example.

1 Lecture #12 EGR 277 – Digital Logic Synchronous Logic Circuits versus Combinational Logic Circuits A) Combinational Logic Circuits Recall that there.

1 Lecture 22 Sequential Circuits Analysis. 2 Combinational vs. Sequential  Combinational Logic Circuit  Output is a function only of the present inputs.

Boolean Algebra and Logic Gates 1 Computer Engineering (Logic Circuits) Lec. # 10 (Sequential Logic Circuit) Dr. Tamer Samy Gaafar Dept. of Computer &

Analysis and Synthesis of Synchronous Sequential Circuits A “synchronizing” pulse/edge signal (clock) controls the operation of the memory portion of the.

Registers; State Machines Analysis Section 7-1 Section 5-4.

Princess Sumaya University

Lecture 20: Sequential Logic (5)

ENG241 Digital Design Week #7 Sequential Circuits (Part B)

Synthesis Synchronous Sequential Circuits synthesis procedure –Word description of problem /hardest; art, not science/ –Derive state diagram & state table.

Introduction to Sequential Logic Design Finite State-Machine Analysis.

Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patterson and Hennessy Text.

State Machine Design State Machine Design Digital Electronics

Finite State Machine. Clock Clock cycle Sequential circuit Digital logic systems can be classified as combinational or sequential. – Combinational circuits.

Chapter 6 Analysis of Sequential Systems Sequential Memory Feedback.

Finite State Machines Mealy machine inputs Outputs next state function

2018/5/2 EE 4271 VLSI Design, Fall 2016 Sequential Circuits.

Week #7 Sequential Circuits (Part B)

Introduction to Sequential Logic Design

ANALYSIS OF SEQUENTIAL CIRCUITS

Mealy Machine x X1 X2 S S1 S2 S3 x X1 X2 S S1 Y1 Y2 S2 Y3 S3 outputs

CSCE 211: Digital Logic Design

Sequential Circuit: Counter

Digital Design Lecture 9

2018/8/29 EE 4271 VLSI Design, Fall 2013 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.

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.

CSCE 211: Digital Logic Design

FINITE STATE MACHINES (FSMs)

Princess Sumaya University

CENG 241 Digital Design 1 Lecture 11

CSCE 211: Digital Logic Design

CSCE 211: Digital Logic Design

ECE 3130 – Digital Electronics and Design

Chapter 5 Synchronous Sequential Logic 5-1 Sequential Circuits

Analysis of Synchronous Sequential Circuits

State Machine Design State Machine Design Digital Electronics

Finite State Machines (FSMs)

MTE 202, Summer 2016 Digital Circuits Dr.-Ing. Saleh Hussin

EGC 442 Introduction to Computer Architecture

Chapter5: Synchronous Sequential Logic – Part 4

A B x y A+ B+ z 1 Q X Y Q(t+1) S 1.

FINITE STATE MACHINES.

ANALYSIS OF SEQUENTIAL CIRCUIT LOGIC DIAGRAM

Sequential Circuits UNIT- IV

CSCE 211: Digital Logic Design

Chapter 5 Sequential Circuits.

Chapter5: Synchronous Sequential Logic – Part 3

A B x y A+ B+ z 1 Q X Y Q(t+1) S 1.

2019/9/26 EE 4271 VLSI Design, Fall 2012 Sequential Circuits.

COE 202: Digital Logic Design Sequential Circuits Part 3

Presentation transcript:

Analysis of Synchronous Sequential Circuits Chapter 8 11/29/2018 A. Berrached

Synchronous Sequential Circuits X1 Z1 Combinational Circuit X2 . .. Zm . .. Xn Y1 Flip Flops . .. . .. Yr Clock 11/29/2018 A. Berrached

Synchronous Sequential Circuits Zi = fi(X1, X2, …,Xn, Y1, Y2, …,Yr, ) Yi = gi(X1, X2, …,Xn, Y1, Y2, …,Yr, ) 11/29/2018 A. Berrached

Synchronous Sequential Circuits 1. Derive the output equations 2. Derive the F/Fs input equations 3. Derive the next state equations 4. Derive the CKT's State Transition Table State table give a complete description of circuits behavior 5. State diagram 6. Get timing diagrams 11/29/2018 A. Berrached

Example 1 11/29/2018 A. Berrached

Example1 Cont. Step 1: Z = AX' + BX' Step 2: DA = AX + BX DB = A'X Step 3: D F/F characteristic eq. Q(t+1) = D ==> A(t+1) = AX + BX B(t+1) = A'X 11/29/2018 A. Berrached

Example Cont. Step 4: State Transition Table 11/29/2018 A. Berrached

Timing Diagram Assume Input Sequence: 00101110 11/29/2018 A. Berrached

Example 2 11/29/2018 A. Berrached

Example2: Analysis Preliminary: inputs: X outputs: Z State Variables: A & B Note: Moore circuit (1) output equations: Z = AB' (2) Flip Flop Input Equations: JA = B KA = BX' JB = X' KB = AX' + A'X 11/29/2018 A. Berrached

State Transition Table 11/29/2018 A. Berrached

Traffic Light Controller You are to design a traffic light controller to control an intersection. The intersection consists of two streets, one running north-south (called NS) and the other running east-west (called EW). The circuit has to control one traffic lights on the NS street, one traffic light on the EW street. Each of the traffic signals consists of a red, yellow, and green light. Each of the traffic signals cycles through red, green, yellow, and back to red. When one traffic signal is green or yellow, the other is red. When one traffic light is red, the other is greed or yellow. To simplify the design and shorten the experimentation time, we will set the green, yellow, and red time periods to 4, 1, and 5 seconds, respectively. 11/29/2018 A. Berrached