CHAPTER 7 DESIGNING SEQUENTIAL SYSTEMS. 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.

Slides:



Advertisements
Similar presentations
©2004 Brooks/Cole FIGURES FOR CHAPTER 13 ANALYSIS OF CLOCKED SEQUENTIAL CIRCUITS Click the mouse to move to the next page. Use the ESC key to exit this.
Advertisements

ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Encoders.
Concurrency: Deadlock and Starvation Chapter 6. Deadlock Permanent blocking of a set of processes that either compete for system resources or communicate.
Analysis of Clocked Sequential Circuits
CSCE 211: Digital Logic Design. Chapter 6: Analysis of Sequential Systems.
Computing Machinery Chapter 5: Sequential Circuits.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 5 – Sequential Circuits Part 1 – Storage.
9/20/6Lecture 3 - Instruction Set - Al1 The Hardware Interface.
Digital Logic Design Lecture 27.
Finite Automata with Output
A Sequential Parity Checker
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.
Unit 13 Analysis of Clocked Sequential Circuits Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information.
ECE 331 – Digital System Design
© 2006 Pearson Education, Upper Saddle River, NJ All Rights Reserved.Brey: The Intel Microprocessors, 7e Chapter 13 Direct Memory Access (DMA)
From the NXT top menu Connect desired hardware as indicated Enter a command in the box indicated from the menu provided Repeat for all 5 boxes.
Witawas Srisa-an Chapter 6
CPSC 4650 Operating Systems Chapter 6 Deadlock and Starvation
CSCE 211: Digital Logic Design
CS 140L Lecture 7 Professor CK Cheng 11/12/02. Transformation between Mealy and Moore Machines Algorithm: 1) For each NS, z = S i, j create a state S.
1 Concurrency: Deadlock and Starvation Chapter 6.
1 Design of a Sequence Detector (14.1) Seq. ends in > Z=1 (no reset) Otherwise--> Z=0 Typical input/output sequence Partial Soln. (Mealy Network):
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.
Microcomputer & Interfacing Lecture 2
1 Concurrency: Deadlock and Starvation Chapter 6.
Chapter 7 The Design of Sequential Systems.
Circuit, State Diagram, State Table
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
Sequential Circuits. Combinational Circuits + Storage element output depends both on previous state and input Fig. 5-1.
State Machines.
Chapter Contents 1.1 Overview 1.2 A Brief History
MICROPROCESSOR INPUT/OUTPUT
Khaled A. Al-Utaibi  Interrupt-Driven I/O  Hardware Interrupts  Responding to Hardware Interrupts  INTR and NMI  Computing the.
Introduction to Sequential Circuit By : Pn Siti Nor Diana Ismail CHAPTER 5.
Digital networks classification Paolo PRINETTO Politecnico di Torino (Italy) University of Illinois at Chicago, IL (USA)
1-1 Chapter 1 - Introduction Department of In formation Technology, Radford University ITEC 352 Computer Organization ITEC 352 Computer Organization.
Moore machine and Mealy machine (P.274)
Unit 13 Analysis of Clocked Sequential Circuits Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information.
Computer Architecture Lecture 2 System Buses. Program Concept Hardwired systems are inflexible General purpose hardware can do different tasks, given.
1 Recap lecture 22 Applications of complementing and incrementing machines, Equivalent machines, Moore equivalent to Mealy, proof, example, Mealy equivalent.
1 State Reduction Goal: reduce the number of states while keeping the external input-output requirements unchanged. State reduction example: a: input 0.
CSCI1600: Embedded and Real Time Software Lecture 9: Input Output Concepts Steven Reiss, Fall 2015.
Lecture 4 General-Purpose Input/Output NCHUEE 720A Lab Prof. Jichiang Tsai.
Interrupt, again! Lin Zhong ELEC424, Fall 2010.
Chapter 6 Analysis of Sequential Systems Sequential Memory Feedback.
5 - 1 Chapter 6 Analysis of Sequential Systems Chapter 6 Analysis of Sequential Systems 6.0 Introduction  Clocked System Clock A signal that alternates.
Lecture 14 State Machines II Topics State Machine Design Resolution with Text Design with D flip-flops Design with JK Readings: Chapter 7 November 11,
Lecture 13 State Machines / ROMs
Lecture 13 Derivation of State Graphs and Tables
Lecture 12 Analysis of Clocked Sequential Network
Introduction to Advanced Digital Design (14 Marks)
Analysis of Clocked Sequential Circuit
CSCE 211: Digital Logic Design
Sequential logic circuits
Computer Organization and Design
Instructor: Alexander Stoytchev
Instructor: Alexander Stoytchev
Analysis of Sequential Systems
Instructor: Alexander Stoytchev
Lecture 20 State minimization via row matching.
ECE 352 Digital System Fundamentals
Lecture 14: State Tables, Diagrams, Latches, and Flip Flop
Instructor: Alexander Stoytchev
Finite Automata with Output
Chapter 5 Sequential Circuits.
EGR 2131 Unit 12 Synchronous Sequential Circuits
Instructor: Alexander Stoytchev
Presentation transcript:

CHAPTER 7 DESIGNING SEQUENTIAL SYSTEMS

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.

A none, that is, the last input was 0 B one C two D three or more

CE7. A system with one input x and one output z such that z = 1 at a clock time iff x is currently 1 and was also 1 at the previous two clock times. CE7#. A Mealy system with one input x and one output z such that z = 1 iff x has been 1 for three consecutive clock times.

A none, that is, the last input was 0 B one C two or more

Design a Mealy system with one input x and one output z such that z = 1 iff x has been 1 for exactly three consecutive clock times. A sample input/output trace for such a system is x z ↑ ↑ A none, that is, the last input was 0 B one 1 in a row C two 1’s in a row D three 1’s in a row E too many (more than 3) 1’s in a row

Design a Moore system with one input, x, and one output z such that z = 1 iff x has been 1 for exactly three consecutive clock times. x z

CE8. Design a Moore system whose output is 1 iff three consecutive 0 inputs occurred more recently than three consecutive 1 inputs. A sample input/output trace for such a system is x z? ? ?

CE11. Design a Moore model bus controller that receives requests on separate lines, R 0 to R 3, from four devices desiring to use the bus. It has four outputs, G 0 to G 3, only one of which is 1, indicating which device is granted control of the bus for that clock period. The low number device has the highest priority, if more than one device requests the bus at the same time. We look at both interrupting controllers (where a high priority device can preempt the bus) and one where a device keeps control of the bus once it gets it until it no longer needs it. The bus controller has five states: A: idle, no device is using the bus B: device 0 is using the bus C: device 1 is using the bus D: device 2 is using the bus E: device 3 is using the bus