Self-Timed Systems Timing complexity growing in digital design -Wiring delays can dominate timing analysis (increasing interdependence between logical.

Slides:



Advertisements
Similar presentations
Digital Computer Fundamentals
Advertisements

Self-Timed Logic Timing complexity growing in digital design -Wiring delays can dominate timing analysis (increasing interdependence between logical and.
Sequential Logic Circuits. Set-Reset Latch The Set-Reset latch or bistable is a simple sequential logic circuit that remembers what has happened to the.
CS370 – Spring 2003 Hazards/Glitches. Time Response in Combinational Networks Gate Delays and Timing Waveforms Hazards/Glitches and How To Avoid Them.
ECE C03 Lecture 71 Lecture 7 Delays and Timing in Multilevel Logic Synthesis Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
Lecture 23: Registers and Counters (2)
Combinational Logic.
Logical Design.
A university for the world real R © 2009, Chapter 3 Advanced Synchronization Moe Wynn Wil van der Aalst Arthur ter Hofstede.
Control path Recall that the control path is the physical entity in a processor which: fetches instructions, fetches operands, decodes instructions, schedules.
Reading1: An Introduction to Asynchronous Circuit Design Al Davis Steve Nowick University of Utah Columbia University.
Changes in input values are reflected immediately (subject to the speed of light and electrical delays) on the outputs Each gate has an associated “electrical.
MICROELETTRONICA Sequential circuits Lection 7.
ELEC 256 / Saif Zahir UBC / 2000 Timing Methodology Overview Set of rules for interconnecting components and clocks When followed, guarantee proper operation.
Digital Logic Chapter 5 Presented by Prof Tim Johnson
Delay/Phase Regeneration Circuits Crescenzo D’Alessandro, Andrey Mokhov, Alex Bystrov, Alex Yakovlev Microelectronics Systems Design Group School of EECE.
Sequential circuits The digital circuits considered thus far have been combinational, where the outputs are entirely dependent on the current inputs. Although.
Module 12.  In Module 9, 10, 11, you have been introduced to examples of combinational logic circuits whereby the outputs are entirely dependent on the.
1 CS 151: Digital Design Chapter 5: Sequential Circuits 5-3: Flip-Flops I.
CSCE 211: Digital Logic Design. Chapter 6: Analysis of Sequential Systems.
Asynchronous Sequential Logic
P. Keresztes, L.T. Kóczy, A. Nagy, G.Rózsa: Training Electrical Engineers on Asynchronous Logic Circuits on Constant Weight Codes 1 Training Electrical.
RTL Hardware Design by P. Chu Chapter 161 Clock and Synchronization.
Digital Integrated Circuits© Prentice Hall 1995 Timing ISSUES IN TIMING.
1 A Modular Synchronizing FIFO for NoCs Vainbaum Yuri.
CS 151 Digital Systems Design Lecture 11 NAND and XOR Implementations.
1 Clockless Logic Montek Singh Thu, Jan 13, 2004.
Give qualifications of instructors: DAP
Low Power Design for Wireless Sensor Networks Aki Happonen.
Asynchronous Machines
1 Exact Two-Level Minimization of Hazard-Free Logic with Multiple Input Changes Montek Singh Tue, Oct 16, 2007.
Chapter #6: Sequential Logic Design 6.2 Timing Methodologies
CS 151 Digital Systems Design Lecture 32 Hazards
Electronic Counters.
Counters  A counter is a device which stores (and sometimes displays) the number of times a particular event or process has occurred, often in relationship.
A presentation on Counters
Flip Flop
Rabie A. Ramadan Lecture 3
MICROPROCESSOR INPUT/OUTPUT
Area and Speed Oriented Implementations of Asynchronous Logic Operating Under Strong Constraints.
Reading1: An Introduction to Asynchronous Circuit Design Al Davis Steve Nowick University of Utah Columbia University.
CS 352 : Computer Organization and Design University of Wisconsin-Eau Claire Dan Ernst Latches & Flip-Flops.
12004 MAPLD: 153Brej Early output logic and Anti-Tokens Charlie Brej APT Group Manchester University.
Lecture 09 NAND and XOR Implementations. Overview °Developing NAND circuits °Two-level implementations Convert from AND/OR to NAND (again!) °Multi-level.
Chapter 11 Activity Diagrams. 2 “Activity diagrams are a technique to describe procedural logic, business processes, and work flows” - M. Fowler An activity.
Sequential logic circuits
CSCI1600: Embedded and Real Time Software Lecture 11: Modeling IV: Concurrency Steven Reiss, Fall 2015.
COUNTERS Why do we need counters?
Synchronous Sequential Logic A digital system has combinational logic as well as sequential logic. The latter includes storage elements. feedback path.
CO5023 Latches, Flip-Flops and Decoders. Sequential Circuit What does this do? The OUTPUT of a sequential circuit is determined by the current output.
04/21/20031 ECE 551: Digital System Design & Synthesis Lecture Set : Functional & Timing Verification 10.2: Faults & Testing.
Latches-1 Feedback Circuits Two inverters, with feedback If the first input is 0, a 0 gets fed back into it If the first input is 1, a 1 gets fed back.
Lecture 13 Derivation of State Graphs and Tables
CS 352 Introduction to Logic Design
Dr. Eng Amr T. Abdel-Hamid
Recap: Lecture 1 What is asynchronous design? Why do we want to study it? What is pipelining? How can it be used to design really fast hardware?
Prof. Hsien-Hsin Sean Lee
CSCE 211: Digital Logic Design
Registers and Counters Register : A Group of Flip-Flops. N-Bit Register has N flip-flops. Each flip-flop stores 1-Bit Information. So N-Bit Register Stores.
LECTURE 15 – DIGITAL ELECTRONICS
Instructor: Alexander Stoytchev
Instructor: Alexander Stoytchev
Chapter 3 Overview • Multi-Level Logic
FLIP-FLOPS.
Synchronous sequential
Synchronous Sequential
Petri nets.
ECE 352 Digital System Fundamentals
Week 11 Flip flop & Latches.
ECE 352 Digital System Fundamentals
Presentation transcript:

Self-Timed Systems Timing complexity growing in digital design -Wiring delays can dominate timing analysis (increasing interdependence between logical and physical views of system) -Low-skew clock distribution consumes power and space Self-Timed SystemsSelf-Timed Systems – systems that operate without clocks at speeds determined by their own internal parameters (also know as Delay-Insensitive Systems) -requires completion signal feedback to the input source Mitch Thornton

Simple Handshake Example Subsystem P2 Subsystem P1 Data Request (R) Acknowledge (A) Four-Phase Handshake Two-Phase Handshake Request (R) Acknowledge (A) Request (R) Acknowledge (A) P1 says “send data” P2 says “data available” P1 says “send data” P2 says “data available” Return to 0

How to Apply to Clocked Systems?

Phased Logic Concepts Completion signalCompletion signal not restricted to simple handshake between two subsystems (rather a system with multiple feedback circuits) Conventional clocked systems can be replaced with networks of Phased Logic Gate Primitives that carry both time and value information simultaneously Clock (t) and Value (v) -Encoding scheme used is Level-Encoded two-phase Dual-Rail (LEDR) scheme. -Four-phase encoding avoided – no resetting transition that consumes power

LEDR Encoding Level-Encoded two-phase Dual- Rail scheme.

Phased Logic AND Gate Gate fires Gate fires when phases of inputs match phase of gate Normal output has opposite phase of gate Arcs A & B: gate cannot “fire” until inputs reach proper phase Arcs C & D: changes cannot occur until after gate has fired

Phase Logic Gate Timing with Multiple Outputs Arc A: inputs can change as soon as any output changes phase Arc B: environment of the gate must guarantee that all outputs have changed before gate is reenabled

Phased Logic Gate Firing Rules 1)Internal Constraint 1)Internal Constraint: the gate fires IFF it is enabled (all inputs match phase of gate). A requirement of the gate design. 2)External Constraint 2)External Constraint: The phase of each input and output toggles once between the n th and (n+1) th firing of the gate. A requirement on the system design.

Correspondence Between Phases and Tokens

Example of Token Movement

Initial Token Markings

Live and Safe Initial Token Marking Phase inversion used to allow live and safe initial token making - output phase the same as the phase of the gate

Liveness and Safety Theorems THEOREM 1. THEOREM 1. A marked graph is live IFF the initial token marking places at least one token on each directed circuit. THEOREM 2. THEOREM 2. A live marked graph is safe IFF every edge belongs to some directed circuit with a token count of one in the initial token marking. Such a circuit is called a synchronizing loop. Edges violate THM 2 C1 has no token & violate THM 1

Phased Logic Synthesis Two Basic Steps: 1)Building Basic Topology -Copy topology of clocked system except for the clock signal -Each gate replaced with phased logic gate with same function (signals become LEDR) 2)Augmentation to Guarantee Safeness -Add splitter gates to separate directly connected barrier gates (gates that have tokens on all its outputs) -Mark as covered all signals that already safe -Add feedback to cover the remaining unsafe signals

Phased Logic Synthesis Step 1: Phased logic network for clocked system example Ordinary signals Synchronous signals Tokens on synchronous signals

Phased Logic Synthesis But step 1 leaves signals circled in red unsafe

Phased Logic Synthesis Step 2: Need to augment the network (add new signals and gates) to guarantee the safeness of all signals. But liveness problems can occur when this is done. Part of unsafe circuit Created circuit C 2 not live

Phased Logic Synthesis Step 2: Feedback signal Splitter gate Examples of Unsafe signals