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

Slides:



Advertisements
Similar presentations
Sequential Circuits Storage elements
Advertisements

State-machine structure (Mealy)
Analysis of Clocked Sequential Circuits
Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Computing Machinery Chapter 5: Sequential Circuits.
Sequential Design Part II. Output A(t+1) =D A = AX + BX B(t+1) =D B = AX Y = AX + BX.
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.
Review and Overview. Review  Combinational logic circuit – Decoder, Encoder, Multiplexer, De-multiplexer, Full Adder, Multiplier  Sequential logic circuit.
Overview Sequential Circuit Design Specification Formulation
Chapter 8 -- Analysis and Synthesis of Synchronous Sequential Circuits.
ECE 301 – Digital Electronics
ECE 331 – Digital System Design Counters (Lecture #19) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design,
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)
Sequential Circuit Introduction to Counter
Registers and Counters
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.
Unit 12 Registers and Counters Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information Engineering Da-Yeh.
ECE/CS 352 Digital System Fundamentals© T. Kaminski & C. Kime 1 ECE/CS 352 Digital Systems Fundamentals Spring 2001 Chapter 4 – Part 3 Tom Kaminski & Charles.
IKI c-Synthesis of Sequential Logic Bobby Nazief Semester-I The materials on these slides are adopted from: Prof. Daniel Gajski’s transparency.
ECE 331 – Digital Systems Design Sequential Logic Circuits: FSM Design (Lecture #20)
L5 – Sequential Circuit Design
Chapter 5 - Part Sequential Circuit Design Design Procedure  Specification  Formulation - Obtain a state diagram or state table  State Assignment.
Boolean Algebra and Digital Logic
CHAPTER 12 REGISTERS AND COUNTERS
Synchronous Circuit Design (Class 10.1 – 10/30/2012) CSE 2441 – Introduction to Digital Logic Fall 2012 Instructor – Bill Carroll, Professor of CSE.
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.
State Machines.
Lecture 4 – State Machine Design 9/26/20081ECE Lecture 4.
Chapter 8 -- Analysis and Synthesis of Synchronous Sequential Circuits.
1 Lecture #12 EGR 277 – Digital Logic Synchronous Logic Circuits versus Combinational Logic Circuits A) Combinational Logic Circuits Recall that there.
2017/4/24 CHAPTER 6 Counters Chapter 5 (Sections )
1 Lecture 22 Sequential Circuits Analysis. 2 Combinational vs. Sequential  Combinational Logic Circuit  Output is a function only of the present inputs.
BZUPAGES.COM1 Chapter 9 Counters. BZUPAGES.COM2 BzuPages.COM Please share your assignments/lectures & Presentation Slides on bzupages which can help your.
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,
General model of a sequential network.
9/15/09 - L24 Other FF TypesCopyright Joanne DeGroat, ECE, OSU1 Other FF Types.
2017/4/24 1.
Digital Logic Design.
Digital Circuits State Reduction and Assignment State Reduction reductions on the number of flip-flops and the number of gates a reduction in the.
CHAPTER 6 Sequential Circuits’ Analysis CHAPTER 6 Sequential Circuits’ Analysis Sichuan University Software College.
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.
1 State Reduction Goal: reduce the number of states while keeping the external input-output requirements unchanged. State reduction example: a: input 0.
ENG241 Digital Design Week #7 Sequential Circuits (Part B)
Sichuan University Software College
Synthesis Synchronous Sequential Circuits synthesis procedure –Word description of problem /hardest; art, not science/ –Derive state diagram & state table.
CHAPTER 14 Digital Systems. Figure 14.1 RS flip-flop symbol and truth table Figure
Chapter 35 Sequential Logic Circuits. Objectives After completing this chapter, you will be able to: –Describe the function of a flip-flop –Identify the.
Partitioning of a digital system.
State Machine Design Shiva choudhary En No.: Electronics and comm. Dept K.I.T.,Jamnagar 1.
Lecture 9 Sequential Logic Prof. Sin-Min Lee Department of Computer Science.
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.
1 Lecture #15 EGR 277 – Digital Logic Reading Assignment: Chapter 5 in Digital Design, 3 rd Edition by Mano Example: (Problem 5-17 from Digital Design,
Partitioning of a digital system.
Figure 8.1. The general form of a sequential circuit.
FIGURE 5.1 Block diagram of sequential circuit
Digital Design Lecture 9
Digital Principles and Design Algorithmic State Machines
Instructor: Alexander Stoytchev
Table 8.1 Verilog 2001 HDL Operators
L11 – Midterm Review.
Instructor: Alexander Stoytchev
EGC 442 Introduction to Computer Architecture
SYEN 3330 Digital Systems Chapter 6 – Part 3 SYEN 3330 Digital Systems.
Chapter5: Synchronous Sequential Logic – Part 4
ANALYSIS OF SEQUENTIAL CIRCUIT LOGIC DIAGRAM
Presentation transcript:

Chapter 8 -- Analysis and Synthesis of Synchronous Sequential Circuits

The Synchronous Sequential Circuit Model Figure 8.1

Mealy Machine Model Figure 8.2

Mealy Machine Timing Diagram -- Example 8.1 Figure 8.3

Moore Machine Model Figure 8.4

Moore Machine Timing Diagram -- Example 8.2 Figure 8.5

Analysis of Sequential Circuit State Diagrams -- Example 8.3 Figure 8.6

Timing Diagram for Example 8.3 Figure 8.7

Analysis of Sequential Circuit Logic Diagrams Figure 8.8

Timing Diagram for Figure 8.8 (a) Figure 8.9

State Table and State Diagram for Figure 8.8 (a) Figure 8.10

K-Maps for Circuit of Figure 8.8 (a) Figure 8.11

Synchronous Sequential Circuit with T Flip-Flop -- Example 8.4 Figure 8.12

Timing Diagram for Example 8.4 Figure 8.13

State Table and State Diagram for Example 8.4 Figure 8.14

K-Maps for Example 8.4 Figure 8.15

Synchronous Sequential Circuit with JK Flip-flops -- Example 8.5 Figure 8.16

Timing Diagram and State Table for Example 8.5 Figure 8.17

K-Maps for Example 8.5 Figure 8.18

Generating the State Table From K-maps -- Example 8.5 Figure 8.19

Synchronous Sequential Circuit Synthesis Figure 8.20

Introductory Synthesis Example -- Example 8.6 Figure 8.21

Flip-flop Input Tables -- Example 8.6 Figure 8.22

Generating the JK Flip-flop Excitation Maps -- Example 8.7 Figure 8.23

Generating the JK Flip-flop Excitation Maps -- Example 8.7 Figure 8.23

Clocked JK Flip-Flop Implementation -- Example 8.7 Figure 8.24

Application Equation Method for Deriving Excitation Equations -- Example 8.8 Figure 8.25

Sequence Recognizer for 01 Sequence -- Example 8.9 Figure 8.26

Synthesis of the 01 Recognizer with SR Flip-flops Figure 8.27

Realization of 01 Recognizer with T Flip-flops Figure 8.28

Design of a Recognizer for the Sequence Example 8.11 Figure 8.29

SR Realization of the 1111 Recognizer Figure 8.30

Clocked T and JK Realizations of the 1111 Recognizer Figure 8.31

Clocked JK Flip-Flop Realization of a 1111 Recognizer Figure 8.32

Design of a 0010 Recognizer Figure 8.33

Design of a Serial Binary Adder Figure 8.34

Design of a Four-State Up/Down Counter Figure 8.35

An Implementation of the Up/Down Counter Figure 8.36

Design a BCD Counter Figure 8.37 (a) and (b)

Design of the BCD Counter (con’t) Figure 8.37 (c)

Realization of the BCD Counter Design Figure 8.37 (d) and (e)

K-map For Y 1 in Example 8.16 Figure 8.38

Robot Controller Floor Plan -- Example 8.17 Figure 8.39

Robot Controller Design Figure 8.40 (a) -- (e)

Robot Controller Realization Figure 8.40 (f)

Candy Machine Controller Design -- Example 8.18 Figure 8.41

Algorithmic State Machines (ASMs) Figure 8.42

ASM Representation of a Mealy Machine Figure 8.43

ASM Representation of a Moore Machine Figure 8.44

Eight-Bit Two’s Complementer ASM -- Example 8.19 Figure 8.45

Binary Multiplier Controller -- Example 8.20 Figure 8.46

One-Hot State Assignments Table 8.1

ASM Design Using One-Hot State Assignments Figure 8.47 (a) -- (b)

ASM Design Using One-Hot Assignments (con’t) Figure 8.47 (c)

One-hot Design of A Multiplier Controller -- Example 8.21 Figure 8.48

Incompletely Specified Circuits -- Detonator (Example 8.22) Figure 8.49

Detonator Example K-maps Figure 8.50

Detonator Realization Figure 8.51

Sate Assignments and Circuit Realization Figure 8.52