DESIGN OF SEQUENTIAL CIRCUITS by Dr. Amin Danial Asham.

Slides:



Advertisements
Similar presentations
Sequential Circuits Storage elements
Advertisements

State-machine structure (Mealy)
State Machine Design Procedure
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.
Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Computing Machinery Chapter 5: Sequential Circuits.
Digital Logic Design Lecture 27.
Sequential Design Part II. Output A(t+1) =D A = AX + BX B(t+1) =D B = AX Y = AX + BX.
ECE 331 – Digital System Design State Reduction and State Assignment (Lecture #22) The slides included herein were taken from the materials accompanying.
ECE 331 – Digital System Design
ECE 331 – Digital System Design
Sequential Circuits and Finite State Machines Prof. Sin-Min Lee
Give qualifications of instructors: DAP
Sequential Logic Design
CSCE 211: Digital Logic Design
Overview Sequential Circuit Design Specification Formulation
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)
9/15/09 - L22 Sequential Circuit Design Copyright Joanne DeGroat, ECE, OSU1 Sequential Circuit Design Creating a sequential circuit to address a.
Sequential circuit design
ECE 331 – Digital Systems Design Sequential Logic Circuits: FSM Design (Lecture #20)
Rabie A. Ramadan Lecture 2
Digital Design Lecture 10 Sequential Design. State Reduction Equivalent Circuits –Identical input sequence –Identical output sequence Equivalent States.
Synchronous Sequential Logic Part II
Circuit, State Diagram, State Table
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
Chap 4. Sequential Circuits
Digital Logic Design Sequential circuits
ROM & PLA Digital Logic And Computer Design
CENG 241 Digital Design 1 Lecture 10 Amirali Baniasadi
1 Lecture #12 EGR 277 – Digital Logic Synchronous Logic Circuits versus Combinational Logic Circuits A) Combinational Logic Circuits Recall that there.
CE1110: Digital Logic Design Sequential Circuits.
1 Lecture 22 Sequential Circuits Analysis. 2 Combinational vs. Sequential  Combinational Logic Circuit  Output is a function only of the present inputs.
LOGIC CIRCUIT IMPLEMENTATION
Synchronous Sequential Circuits by Dr. Amin Danial Asham.
Introduction to State Machine
9/15/09 - L24 Other FF TypesCopyright Joanne DeGroat, ECE, OSU1 Other FF Types.
DLD Lecture 26 Finite State Machine Design Procedure.
1 Finite State Machines (FSMs) Now that we understand sequential circuits, we can use them to build: Synchronous (Clocked) Finite State Machines Finite.
ANALYSIS OF SEQUENTIAL CIRCUITS by Dr. Amin Danial Asham.
Digital Circuits State Reduction and Assignment State Reduction reductions on the number of flip-flops and the number of gates a reduction in the.
Combinational Circuits by Dr. Amin Danial Asham. References  Digital Design 5 th Edition, Morris Mano.
1 State Reduction Goal: reduce the number of states while keeping the external input-output requirements unchanged. State reduction example: a: input 0.
1Sequential circuit design Acknowledgement: Most of the following slides are adapted from Prof. Kale's slides at UIUC, USA by Erol Sahin and Ruken Cakici.
C HAPTER F IVE S YNCHRONOUS S EQUENTIAL L OGIC 1.
Princess Sumaya University
Combinational Circuits
ENG241 Digital Design Week #7 Sequential Circuits (Part B)
Synchronous Counter Design
Synthesis Synchronous Sequential Circuits synthesis procedure –Word description of problem /hardest; art, not science/ –Derive state diagram & state table.
Synchronous Sequential Circuits by Dr. Amin Danial Asham.
1 Lecture #14 EGR 277 – Digital Logic Self-starting counters Counters are considered to be self-starting if all unused counts eventually lead to the correct.
Sequential Circuit Design 05 Acknowledgement: Most of the following slides are adapted from Prof. Kale's slides at UIUC, USA.
Digital Design: With an Introduction to the Verilog HDL, 5e M. Morris Mano Michael D. Ciletti Copyright ©2013 by Pearson Education, Inc. All rights reserved.
Week #7 Sequential Circuits (Part B)
ANALYSIS OF SEQUENTIAL CIRCUITS
Adapted by Dr. Adel Ammar
ECE 301 – Digital Electronics
FINITE STATE MACHINES (FSMs)
CENG 241 Digital Design 1 Lecture 11
State Reduction and State Assignment
Sequential circuit design
Sequential circuit design
Sequential circuit design
DESIGN OF SEQUENTIAL CIRCUITS
Analysis with JK flip-flops
Chapter5: Synchronous Sequential Logic – Part 4
Chapter5: Synchronous Sequential Logic – Part 3
COE 202: Digital Logic Design Sequential Circuits Part 3
Presentation transcript:

DESIGN OF SEQUENTIAL CIRCUITS by Dr. Amin Danial Asham

References  Digital Design 5 th Edition, Morris Mano

 State Reduction (continue)  In sequential circuits the input and output sequences are important and the internal state role is just to produce these sequences.  As an example, a sequential circuit with the following state diagram: o The states are denoted by letter since the binary values are not important. o Using the state diagram we get the output sequence corresponding to the input sequence

 State Reduction (continue)  If input-output is considered, two sequential circuits with different number of FF’s are considered equivalent if each input sequence applied to the two circuits produces the same output sequence.  “Two states are said to be equivalent if, for each member of the set of inputs, they give exactly the same output and send the circuit either to the same state or to an equivalent state.”  If there are two equivalent states, one of them can be removed without changing the input-output relations.  Now to reduce the number of states, the state table will be used and searching for equivalent states.

 State Reduction (continue)

 Replacing the removed state with its equivalent in the table.

 State Reduction (continue)  Replacing the removed state with its equivalent in the table.

3 FF’s 5 FF’s

 State Assignment (continue)  The reduced 5 states in our example are coded using binary code.  Three bits can be used to code 8 states, we used 5 states and the other 3 states are considered don’t care.  The state table using the binary assignment is sometimes called the transition table to be distinguished from the state table with symbolic names for the states.

 Design Procedure 1.From the word description and specifications of the desired operation, derive a state diagram for the circuit. 2.Reduce the number of states if necessary. 3.Assign binary values to the states. 4.Obtain the binary-coded state table. 5.Choose the type of flip-flops to be used. 6.Derive the simplified flip-flop input equations and output equations. 7.Draw the logic diagram.

 Example  Design a circuit that detects a sequence of three or more consecutive 1’s in an input stream.  The state diagram of this detector can be as shown. o There are four states S 0, S 1, S 2, and S 3, which represents 0 at input, single 1, two consecutive 1’s, or three or more consecutive 1’s respectively. o The output of this detector is 1 when 3 or more consecutive 1’s are detected.

Input Equations

 Example – D FF implementation (continue)  Since the input and output equations are written down as sum of minterms, therefore the these equation can be simplified using K-maps.

 Example – D FF implementation (continue)

+ +

+

+ Excitation Table 0

0

Thanks