Synchronous Circuit Design (Class 10.1 – 10/30/2012) CSE 2441 – Introduction to Digital Logic Fall 2012 Instructor – Bill Carroll, Professor of CSE.

Slides:

Advertisements

Similar presentations

Clocked Synchronous State-machine Analysis

Advertisements

10/2/0810/2/2008ECE 561 -ECE Lecture 51 State Machine Implementation 10/2/20081ECE Lecture 5.

State-machine structure (Mealy)

COE 202: Digital Logic Design Sequential Circuits Part 3

Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.

Circuits require memory to store intermediate data

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.

Nonlinear & Neural Networks LAB. CHAPTER 13 Analysis of Clocked Sequential Circuit 13.1 A Sequential Parity Checker 13.2 Analysis by Signal Tracing 13.3.

ECE 331 – Digital System Design Introduction to and Analysis of Sequential Logic Circuits (Lecture #20) The slides included herein were taken from the.

Sequential Circuits and Finite State Machines Prof. Sin-Min Lee

EECC341 - Shaaban #1 Lec # 14 Winter Clocked Synchronous State-Machines Such machines have the characteristics: –Sequential circuits designed.

5. Choose a flip-flop type for the state memory. ReturnNext 7.4 Clocked Synchronous State-Machine Design 1. Construct a state/output table corresponding.

CSCE 211: Digital Logic Design

Overview Sequential Circuit Design Specification Formulation

Chapter 8 -- Analysis and Synthesis of Synchronous Sequential Circuits.

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)

Overview Part 1 - Storage Elements and Sequential Circuit Analysis

7.4 Clocked Synchronous State-Machine Analysis

9/15/09 - L22 Sequential Circuit Design Copyright Joanne DeGroat, ECE, OSU1 Sequential Circuit Design Creating a sequential circuit to address a.

MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR1 Sequential Circuit Design.

IKI c-Synthesis of Sequential Logic Bobby Nazief Semester-I The materials on these slides are adopted from: Prof. Daniel Gajski’s transparency.

Applications of Synchronous Circuits (Class 10.2 – 3/28/2013) CSE 2441 – Introduction to Digital Logic Spring 2013 Instructor – Bill Carroll, Professor.

Chapter 5 - Part Sequential Circuit Design Design Procedure  Specification  Formulation - Obtain a state diagram or state table  State Assignment.

Digital Design Lecture 10 Sequential Design. State Reduction Equivalent Circuits –Identical input sequence –Identical output sequence Equivalent States.

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

Chapter 8 -- Analysis and Synthesis of Synchronous Sequential Circuits.

Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 5 – Sequential Circuits Part 2 – Sequential.

Introduction to Sequential Logic Design Finite State-Machine Design.

CPEN Digital System Design Chapter 5 - Sequential Circuits Sequential Circuit Design C. Gerousis © Logic and Computer Design Fundamentals, 4 rd Ed.,

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

Introduction to State Machine

Fall 2004EE 3563 Digital Systems Design EE3563 Chapter 7, 8, 10 Reading Assignments  7.1, 7.2, 7.3  8.1, ,   8.5.1, 8.5.2,

Synchronous Counters Synchronous digital counters have a common clock which results in all the flip-flops being triggered simultaneously. Consequently,

1 Finite State Machines (FSMs) Now that we understand sequential circuits, we can use them to build: Synchronous (Clocked) Finite State Machines Finite.

Digital Circuits State Reduction and Assignment State Reduction reductions on the number of flip-flops and the number of gates a reduction in the.

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

1 State Reduction Goal: reduce the number of states while keeping the external input-output requirements unchanged. State reduction example: a: input 0.

Sequential Design Motivation Sequential processing often more tractable than parallel Example Sequential processing sometimes only method that works Example.

Chapter 8 -- Analysis and Synthesis of Synchronous Sequential Circuits.

A sequential logic circuit (a.k.a. state machine) consists of both combinational logic circuit(s) and memory devices (flip flops). The combinational circuits.

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.

State Diagrams Tuesday, 12 September State diagram Graphical representation of a state table. –Provides the same information as a state table. –A.

Mealy and Moore Machines Lecture 8 Overview Moore Machines Mealy Machines Sequential Circuits.

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.

LATCHES AND FLIP-FLOPS

Introduction to Sequential Logic Design

Sequential Circuit Design

Sequential logic design principles

Analysis of Clocked Sequential Circuit

FIGURE 5.1 Block diagram of sequential circuit

Digital Design Lecture 9

CSCE 211: Digital Logic Design

ECE 301 – Digital Electronics

CSCE 211: Digital Logic Design

FINITE STATE MACHINES (FSMs)

Princess Sumaya University

State Reduction and State Assignment

CSCE 211: Digital Logic Design

DESIGN OF SEQUENTIAL CIRCUITS

Instructor: Alexander Stoytchev

EGC 442 Introduction to Computer Architecture

Chapter5: Synchronous Sequential Logic – Part 4

FINITE STATE MACHINES.

ANALYSIS OF SEQUENTIAL CIRCUIT LOGIC DIAGRAM

Instructor: Alexander Stoytchev

Chapter5: Synchronous Sequential Logic – Part 3

Presentation transcript:

Synchronous Circuit Design (Class 10.1 – 10/30/2012) CSE 2441 – Introduction to Digital Logic Fall 2012 Instructor – Bill Carroll, Professor of CSE

Today’s Topics Design of synchronous sequential circuits Lab 8 prelab design exercise

Introduction to Synchronous Circuit Design (Synthesis) Given the circuit requirements (specifications), i.e., word description, state diagram, state table, etc. Find a hardware realization of the circuit.

Introductory Design Example (from example 8.6, figure 8.21) Given the following state diagram and state table. Derive a circuit realization. Assume D flip-flops will be used for memory. State DiagramState Table

Generate the Transition Table State Table State Assignment Transition Table (Binary state table) (How many flip-flops are needed?)

Produce the Logic Equations Transition Table (Binary state table) Output K-mapFlip-flop Excitation (input) K-maps z = xy 1 ’y 2 + x’y 1 y 2 ’D 1 = y 1 y 2 ’ + xy 2 D 2 = x’y 1 + xy 1 ’

Realize the Logic Equations with Gates and Flip-flops z = xy 1 ’y 2 + x’y 1 y 2 ’ D 1 = y 1 y 2 ’ + xy 2 D 2 = x’y 1 + xy 1 ’

Lab 8 Preview Analyze, design and implement finite state machines (FSM) – Prelab 1.Use Quartus/Qsim to analyze a given synchronous circuit (FSM A) 2.Design a realization of a second circuit (FSM B) given it’s state diagram. 3.Use Quartus/Qsim to verify the design from 2 is correct. – In lab 1.Construct and test FSM A on the IDL Construct and test FSM B on the DE1

Test Your Understanding (Lab 8, Prelab 2) Design a realization of the following state diagram. Use D flip flops as memory.

Test Your Understanding – Self-Check Given the state diagram. x z1z2z1z2 01 AB00 CB01 DB11 AB10 Construct a state table. A B C D y1y2y1y2 x z1z2z1z Y1Y2Y1Y2 Construct a Transition/Output Table Construct Excitation Table For D flip-flops, transition tables and excitation tables are the same with D 1 =Y 1 and D 2 = Y 2.

Test Your Understanding – Self-Check Construct Excitation MapsGenerate logic equations for D 1, D 2, z 1, and z 2 y1y2y1y2 x y1y2y1y2 x D1D1 D2D2 D 1 = x’y 2 D 2 = x + y 1 ’y 2 z 1 = y 1 z 2 = y 2

Test Your Understanding – Self-Check Realize the logic equations with gates and flip flops

Using JK Flip Flops as Memory for Figure 8.2 (Example 8.7) Figure 8.23 J 1 = xy 2 K 1 = x’y 2 J 2 = xy 1 ’ + x’y 1 K 2 = xy 1 + x’y 1 ’

Clocked JK Flip-Flop Implementation (Example 8.7) Figure 8.24 J 1 = xy 2 K 1 = x’y 2 J 2 = xy 1 ’ + x’y 1 K 2 = xy 1 + x’y 1 ’

Test Your Understanding Design a realization of the following state diagram. Use JK flip flops as memory.

Test Your Understanding – Self-Check Given the state diagram. x z1z2z1z2 01 AB00 CB01 DB11 AB10 Construct a state table. A B C D y1y2y1y2 x z1z2z1z Y1Y2Y1Y2 Construct a Transition/Output Table Construct Excitation Tables y1y2y1y2 x d 011d0d 11d0d1 10d1 y1y2y1y2 x d1d 01d0 11d1d0 100d1d J1K1J1K1 J2K2J2K2

Test Your Understanding – Self-Check Construct Excitation MapsGenerate logic equations for J 1, K 1, J 2, K 2, z 1, and z 2 y1y2y1y2 x dd 10dd y1y2y1y2 x dd 11dd 1001 J1J1 J2J2 J 1 = x’y 2 K 1 = x + y 2 ’ J 2 = x K 2 = x’y 1 z 1 = y 1 z 2 = y 2 y1y2y1y2 x 01 00dd 01dd y1y2y1y2 x 01 00dd dd K1K1 K2K2

Test Your Understanding – Self-Check Realize the logic equations with gates and flip flops

Synchronous Circuit Design (Synthesis) Step 1 – Given a description (specification) of the circuit requirements, derive a state table that meets the requirements. Often it’s easier to first derive a state diagram followed by the equivalent state table. Step 2 – Find a state table with a minimum number of states that is equivalent to the original state diagram. Step 3 – Choose a state assignment and generate the state and output transition tables. Step 4 – Determine (select) the memory device or flip-flop type to be used and find the flip-flop excitation maps. Step 5 – From the excitation maps, produce (derive) logic equations for the flip-flop inputs. Also, form output maps and produce (derive) the output logic equations. Step 6 – Draw the logic circuit using the logic equations and appropriate logic devices (gates and flip-flops).