Computing Machinery Chapter 5: Sequential Circuits.

Slides:

Advertisements

Similar presentations

State-machine structure (Mealy)

Advertisements

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.

Circuits require memory to store intermediate data

1 © 2014 B. Wilkinson Modification date: Dec Sequential Logic Circuits – I Flip-Flops A sequential circuit is a logic components whose outputs.

Chapter 11_2 (10_2 edition 8) Sequential Circuits etc.

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

Review and Overview. Review  Combinational logic circuit – Decoder, Encoder, Multiplexer, De-multiplexer, Full Adder, Multiplier  Sequential logic circuit.

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.

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

A clocked synchronous state-machine changes state only when a triggering edge or “tick” occurs on the clock signal. ReturnNext  “State-machine”: is a.

Sequential Circuits Problems(I) Prof. Sin-Min Lee Department of Mathematics and Computer Science Algorithm = Logic + Control.

C.S. Choy1 SEQUENTIAL LOGIC A circuit’s output depends on its previous state (condition) in addition to its current inputs The state of the circuit is.

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

1 Synchronous Sequential Circuit Analysis. 2 Synchronous Sequential Circuit State Memory – A set of n edge-triggered flip-flops that store the current.

Sequential logic and systems

So far, all of the logic circuits we have studied were basically based on the analysis and design of combinational digital circuits. The other major aspect.

Sequential circuit design

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

Sequential Circuits Chapter 4 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer,  S.

Components used in the the Project J-K Flip Flop Switch Power Alternator 7-Segment Display Coded Decimal (BCD) Display.

Lecture 10 Topics: Sequential circuits Basic concepts Clocks

Digital Computer Design Fundamental

Circuit, State Diagram, State Table

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

Chap 4. Sequential Circuits

Sequential Circuits. Two primary differences between combinational circuits and sequential circuits –Sequential circuits are synchronous (use a clock)

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.

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

ECA1212 Introduction to Electrical & Electronics Engineering Chapter 9: Digital Electronics – Sequential Logic by Muhazam Mustapha, November 2011.

Module : FSM Topic : types of FSM. Two types of FSM The instant of transition from the present to the next can be completely controlled by a clock; additionally,

Computer Organization & Programming Chapter 5 Synchronous Components.

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,

DLD Lecture 26 Finite State Machine Design Procedure.

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.

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.

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.

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.

Synchronous Counter Design

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.

Sequential circuit analysis1 Sequential Circuit Analysis Last time we started talking about latches and flip-flops, which are basic one-bit memory units.

Counters and registers Eng.Maha Alqubali. Registers Registers are groups of flip-flops, where each flip- flop is capable of storing one bit of information.

Logic Design (CE1111 ) Lecture 6 (Chapter 6) Registers &Counters Prepared by Dr. Lamiaa Elshenawy 1.

Sequential Circuit Design 05 Acknowledgement: Most of the following slides are adapted from Prof. Kale's slides at UIUC, USA.

5.3 Sequential Circuits - An Introduction to Informatics WMN Lab. Hey-Jin Lee.

Sequential Logic Circuit Design Eng.Maha Alqubali.

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.

ANALYSIS OF SEQUENTIAL CIRCUITS

Computer Organization

FIGURE 5.1 Block diagram of sequential circuit

Digital Design Lecture 9

Sequential Circuits Most digital systems like digital watches, digital phones, digital computers, digital traffic light controllers and so on require.

ECE 301 – Digital Electronics

FINITE STATE MACHINES (FSMs)

Digital Logic Design Sequential Circuits (Chapter 6)

Sequential logic circuits

Digital Design Fundamentals

Jeremy R. Johnson Mon. Apr. 3, 2000

FINITE STATE MACHINES.

Sequential Circuit Analysis

Chapter 5 Sequential Circuits.

CMPE212 Discussion 11/21/2014 Patrick Sykes

Forward Design by state transition table, and state graph

Presentation transcript:

Computing Machinery Chapter 5: Sequential Circuits

Generic Sequential Circuit

Unstable Sequential Circuits oscillators

Monostable Sequential Circuit

Set-Reset Latch NOR-Version

Set-Reset Latch NAND-Version

Synchronous (Clocked) S-R Latch

Data (D-Type) Latch from S-R Latch

Flip Flops

J-K Flip Flop

Toggle (T-Type) Flip Flop

Data Register

Register Transfer

Shift Register

Memory Unit

Sequential Circuit Design the six steps to total consciousness 1. State Transition Diagram2. State Transition Table3. Excitation Table 4. Input/Output Expressions5. Simplification6. Circuit Diagram D 1 = (~Q 1 )Q 0 In + Q 1 Q 0 (~In) + Q 1 Q 0 In D 0 = (~Q 1 )(~Q 0 )In + (~Q 1 )Q 0 In + Q 1 (~Q 0 )In + Q 1 Q 0 In Out = Q 1 (~Q 0 )In

Sequential Circuit Design Example Problem Design a sequential circuit that recognizes the bit sequence "1101" occuring in a binary sequence. sequential circuit 1101 bit sequence recognizer

Step 1: State Transition Diagram The state transistion diagram is for sequential circuit design is a Mealy Machine. The states are labeled with binary encoded values. The number of bits in the state labels is equal to the number of flip-flops in the circuit. Since this diagram has four states, they can be uniquely labeled using 2-bit binary values. This diagram represents a machine that recognizes the bit string "1101" with overlap (as read left to right).

Step 2: State Transistion Table Each transition (arrow) of the state transition diagram represents a row in the state transition table. The table includes columns for the current state (time t=0), the future state (t=1), the bit string input (In), and the output (Out).

Step 3: Excitation Table The excitation table gives the values needed at the inputs of the flip-flops in order to produce the correct transition when the clock pulse is applied. For the D-type flip-flop the input is set to the desired output.

Step 4: Input/Output Expressions D 0 = (~Q 1 )(~Q 0 )In + (~Q 1 )Q 0 In + Q 1 (~Q 0 )In + Q 1 Q 0 In D 1 = (~Q 1 )Q 0 In + Q 1 Q 0 (~In) + Q 1 Q 0 In Out = Q 1 (~Q 0 )In Now we need logical expressions for D0, D1, and Out. These are extracted from the corresponding rows of the excitation table.

Step 5: Simplification The logical expressions from Step 4 need to be simplified. This is accomplished using K-maps or some other method.

Step 6: Circuit Design D 1 = Q 1 Q 0 + Q 0 In D 0 = In Out = Q 1 (~Q 0 )In The simplified expressions represent the combinational circuits used to apply the necessary logical values to the Q 0 and Q 0 inputs of the flip-flops and the form of the output function, Out.