Iterative Versus Sequential Circuits

Slides:



Advertisements
Similar presentations
Register Transfer Level
Advertisements

1ASM Algorithmic State Machines (ASM) part 1. ASM2 Algorithmic State Machine (ASM) ‏ Our design methodologies do not scale well to real-world problems.
Give qualifications of instructors: DAP
K-Maps, Timing Sequential Circuits: Latches & Flip-Flops Lecture 4 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier,
Circuits require memory to store intermediate data
EKT 221 : Digital 2 ASM.
Assume array size is 256 (mult: 4ns, add: 2ns)
CS 151 Digital Systems Design Lecture 37 Register Transfer Level
Overview Datapath and Control Algorithmic State Machines (ASM)
Chapter 8 Sequencing and Control Henry Hexmoor1. 2 Datapath versus Control unit  Datapath - performs data transfer and processing operations  Control.
3/20/20091 More State Machines. Multiple processes.
The Control Unit: Sequencing the Processor Control Unit: –provides control signals that activate the various microoperations in the datapath the select.
11/16/2004EE 42 fall 2004 lecture 331 Lecture #33: Some example circuits Last lecture: –Edge triggers –Registers This lecture: –Example circuits –shift.
Lab 10 RT methodology (cont’d) Example 1 – a counter Example 2 – a repetitive-adder multiplier.
FINITE STATE MACHINES (FSMs) Dr. Konstantinos Tatas.
EE544/AEEE561 – Advanced Digital Systems Design Dr. Konstantinos Tatas
George Mason University ECE 448 – FPGA and ASIC Design with VHDL Finite State Machines State Diagrams, State Tables, Algorithmic State Machine (ASM) Charts,
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 20 Datapath and Control Datapath - performs data transfer and processing operations.
CS 140L Lecture 4 Professor CK Cheng 10/22/02. 1)F-F 2)Shift register 3)Counter (Asynchronous) 4)Counter (Synchronous)
1 Sequential Circuits Registers and Counters. 2 Master Slave Flip Flops.
ECE 2372 Modern Digital System Design
1 Registers and Counters A register consists of a group of flip-flops and gates that affect their transition. An n-bit register consists of n-bit flip-flops.
Algorithmic State Machines.  1) Create an algorithm, using pseudocode, to describe the desired operation of the device. 2) Convert the pseudocode into.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 21 Multiplier Example Example: (101 x 011) Base 2 Note that the partial product summation.
Chap 8. Sequencing and Control. 8.1 Introduction Binary information in a digital computer –data manipulated in a datapath with ALUs, registers, multiplexers,
1 © 2014 B. Wilkinson Modification date: Dec Sequential Logic Circuits Previously, we described the basic building blocks of sequential circuits,
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use ECE/CS 352: Digital Systems.
Computer Organization & Programming Chapter 5 Synchronous Components.
EKT 221/4 DIGITAL ELECTRONICS II Chapter 2 SEQUENCING AND CONTROL.
Algorithmic state machines
Datapath - performs data transfer and processing operations The control unit sends: – Control signals – Control outputs The control unit receives: – External.
ECE 448 Lecture 6 Finite State Machines State Diagrams vs. Algorithmic State Machine (ASM) Charts.
ASM Charts. Outline  ASM Charts Components of ASM Charts ASM Charts: An Example  Register Operations  Timing in ASM Charts  ASM Charts => Digital.
CS151 Introduction to Digital Design Chapter 5: Sequential Circuits 5-1 : Sequential Circuit Definition 5-2: Latches 1Created by: Ms.Amany AlSaleh.
ASM block The state box represents the state in the FSM, and the output in the state box describes the desired output values when the FMS enters this state.
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.
COMBINATIONAL AND SEQUENTIAL CIRCUITS Guided By: Prof. P. B. Swadas Prepared By: BIRLA VISHVAKARMA MAHAVDYALAYA.
Govt. Engineering College- Gandhinagar. It is all about……  STATE MACHINE.
Design at the Register Transfer Level Algorithmic State Machines 07.
Partitioning of a digital system.
Lecture #17: Clocked Synchronous State-Machine Analysis
Sequential Logic Design
Partitioning of a digital system.
Computer Architecture & Operations I
Class Exercise 1B.
Figure 8.1. The general form of a sequential circuit.
Flip Flops Lecture 10 CAP
Introduction to Advanced Digital Design (14 Marks)
Introduction Introduction to VHDL Entities Signals Data & Scalar Types
KU College of Engineering Elec 204: Digital Systems Design
ECE 448 Lecture 6 Finite State Machines State Diagrams vs. Algorithmic State Machine (ASM) Charts.
Digital Principles and Design Algorithmic State Machines
Digital System Design Review.
Instructor: Alexander Stoytchev
KU College of Engineering Elec 204: Digital Systems Design
Overview Datapath and Control Algorithmic State Machines (ASM)
ECE 434 Advanced Digital System L13
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN
CSE 370 – Winter Sequential Logic-2 - 1
Instructor: Alexander Stoytchev
Finite State Machines (FSMs)
REGISTER TRANSFER LEVEL (RTL) DESIGN Using ASM CHART
KU College of Engineering Elec 204: Digital Systems Design
Instructor: Alexander Stoytchev
Digital Logic Department of CNET Chapter-6
Digital Logic Department of CNET Chapter-6
ECE 448 Lecture 6 Finite State Machines State Diagrams, State Tables, Algorithmic State Machine (ASM) Charts, and VHDL Code.
ECE 448 Lecture 6 Finite State Machines State Diagrams, State Tables, Algorithmic State Machine (ASM) Charts, and VHDL code ECE 448 – FPGA and ASIC Design.
ECE 448 Lecture 6 Finite State Machines State Diagrams vs. Algorithmic State Machine (ASM) Charts.
Forward Design by state transition table, and state graph
Presentation transcript:

Iterative Versus Sequential Circuits

Iterative Versus Sequential Circuits

Iterative Versus Sequential Circuits

Synchronous Design Methodology Synchronous systems – all flip-flops are clocked by the same common clock. To ensure reliable operation: Minimize and determine the amount of clock skew in the system. Ensure that flip-flops have positive setup and hold time margins, including allowance for clock skew. Identify asynchronous inputs and synchronize them with the clock. Ensure that the synchronizers have low probability of failure.

Clock Skew Difference between arrival times of the clock at different devices.

Clock Skew

Asynchronous Inputs Synchronizer – circuit that samples an asynchronous input and produces an output that meets the setup and hold times required in a synchronous system.

Asynchronous Inputs

Asynchronous Inputs

Synchronous System Structure

Design Example Shift and add multiplier MPY/LPROD – Initially stores the multiplier, and accumulates the low-order bits of the product. HPROD – Initially cleared, and stores the high-order bits of the product. MCND – Stores the multiplicand. If low-order bit of MPY/LPROD Is 1 then F = 9-bit sum of HPROD and MCND. Is 0 then F = HPROD extended to 9 bits.

Design Example LDMCND_L=0 enables the multiplicand register U1 to be loaded. LDHP_L=0 enables the HPROD register U6 to be loaded. MPSY[1,0] = 11 enables the MPY/LPROD register U2 to be loaded. = 01 it shifts right during multiplication. = 00 at other time to preserve register content. SELSUM=1 multiplexers U7 and U8 select adders U4 and U5 output otherwise it selects HPROD. CLEAR=1 the output of multiplexers U7 and U8 is cleared.

Design Example LDMCND_L=0 enables the multiplicand register U1 to be loaded. LDHP_L=0 enables the HPROD register U6 to be loaded. MPSY[1,0] = 11 enables the MPY/LPROD register U2 to be loaded. = 01 it shifts right during multiplication. = 00 at other time to preserve register content. SELSUM=1 multiplexers U7 and U8 select adders U4 and U5 output otherwise it selects HPROD. CLEAR=1 the output of multiplexers U7 and U8 is cleared.

Design Example

Algorithmic State Machines - ASM Partition the system into two parts: Controller - ASM. Controlled architecture – data processor.

ASM Algorithm is a well defined procedure consisting of a finite number of steps to the solution of a problem. Controller is a hardware algorithm or Algorithmic State Machine. ASMs can serve as stand-alone sequential network model.

ASM Conditional outputs – Mealy model. State outputs – Moore model. State time: Transition period. Stable period.

ASM State box. Represents one state in the ASM. May have an optional state output list. Single entry. Single exit to state or decision boxes.

ASM Decision box. Provides for next alternatives and conditional outputs. Conditional output based on logic value of Boolean expression involving external input variables and status information. Single entry. Dual exit, denoting if Boolean expression is true or false. Exits to decision, state or conditional boxes.

ASM Conditional output box. Provides a listing of output variables that are to have a value logic-1, i.e., those output variables being asserted. Single entry from decision box. Single exit to decision or state box.

ASM Blocks Consists of the interconnection of a single state box along with one or more decision and/or conditional boxes. It has one entry path which leads directly to its state box, and one or more exit pathes. Each exit path must lead directly to a state, including the state box in itself. A path through an ASM block from its state box to an exit path is called a link path.

ASM Block Example

ASM Blocks An ASM block describes the operation of the system during the state time in which it is in the state associated with the block. The outputs listed in the state box are asserted. The conditions indicated in the decision boxes are evaluated simultaneously to determine which link path is to be followed. If a conditional box is found in the selected path then the outputs found in its output list are asserted. Boolean expression may be written for each link path. The selected link paths are those that evaluate to logic-1.

ASM Blocks