Presentation is loading. Please wait.

Presentation is loading. Please wait.

Rajeev K. Ranjan Advanced Technology Group Synopsys Inc. On the Optimization Power of Retiming and Resynthesis Transformations Joint work with: Vigyan.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Rajeev K. Ranjan Advanced Technology Group Synopsys Inc. On the Optimization Power of Retiming and Resynthesis Transformations Joint work with: Vigyan."— Presentation transcript:

1 Rajeev K. Ranjan Advanced Technology Group Synopsys Inc. On the Optimization Power of Retiming and Resynthesis Transformations Joint work with: Vigyan Singhal, Cadence Berkeley Labs, Berkeley Fabio Somenzi, Univ. of Colorado, Boulder Robert K. Brayton, Univ. of California, Berkeley

2 All circuit optimizations (T+S)* Re(T)iming (S)ynthesis Motivation Optimization capability of retiming and resynthesis - an open question Theoretical foundation for practical retiming and resynthesis based synthesis and verification

3 This Work C1 C2 (Retiming + Resynthesis) * (special 2-way split + merge) * Circuit G1 G2 State Graph

4 This Work (Retiming + Resynthesis) * G2 (special 2-way split + Merge) * C1 C2 Circuit G1 State Graph

5 Outline òBackground Complexity Result Extensions to retiming and resynthesis Summary

6 Background: Sequential Circuit Gates and memory elements Edge triggered Single global clock

7 Background: State Transition Graph (STG) States (values of latches) Transitions (input minterms) b a CIRCUIT: 01 11 0-, -0 11 STG:

8 Background: Combinational Synthesis Primary InputsPrimary Outputs Latch InputsLatch Outputs

9 Background: Retiming [Leiserson & Saxe] Retime by +1 Retime by -1

10 Iterative Retiming and Resynthesis: (T + S) * Retiming changes interaction between different combinational blocks Combinational synthesis generates new candidate latch locations Sequence of retiming and synthesis provides powerful sequential optimization technique  [Malik and Sentovich]  [Iyer and Ciesielski]  [Hassoun and Ebling]

11 Retiming & Resynthesis: Optimization Capability Previous Work [Malik91]: Fixed states and transitions:- arbitrary state encoding General STG transformations:- incomplete classification STG (states, transitions, encoding) transformation Our Work: General STG transformations:- Complete and tight classification

12 State Transformations: Split and Merge [Malik91] s v b u a c d s1 s2 v b b u a a c d SPLIT MERGE

13 Definition: 1-Step Equivalence of States Defined over a pair of states in an STG. s t v b b u a a s and t indistinguishable in 1 step p p

14 Definition: 1-Step Equivalent Transformation Defined as 2-way merge and split involving 1-step equivalent states

15 Definition: 1-Step Equivalent Graphs Class of graphs obtained by applying a sequence of 1-step equivalent transformations 1StepEquivalence Applied to sufficiently delayed configuration of circuits

16 Definitions: Summary States Given an STG, states with identical transitions. Transformations Merge twostates Split a state into twostates Given an STG, Graphs Given two STG’s transformations G1 G2

17 Outline Background òComplexity Result Extensions to retiming and resynthesis Summary

18 C1 (S+T)* C2 G1G2 Prove for single transformation (generalize by induction). Prove for 2-way split. 2-way merge follows:  C2 can generate C1 (reversible transformations).  “2-way merge” on G2 leads to G1. Strategy:  Generate internal points for new codes.  Move latches to these internal points.

19 Generate New State Codes Trivial mapping for all states except s For s, split state ( t or u ) can be obtained by current state ( s1 ) and input ( c ) Trivial mapping back to original codes s s4 b s3 a c,d s2 s1 c,d G1 t u s4 b b s3 a a s1 s2 c d c d 2-way split G2

20 Implementing State Split C1 IN C C’ Synthesis C1 IN C C’ Retiming Synthesis C1 IN : Code for C1 : Code for C2 C2 IN

21 C1 (S+T)* C2G1G2 Synthesis does not change STG Retiming = (Basic retiming) * Basic retiming results in 1-step equivalent graphs Composition: G1G2 G X G1G X G2 Result follows by induction

22 Retiming Across NAND Gate Graphs are 1-step equivalent. 00 11 0001 1011 1 1 1 0 01 0-, -0 10

23 Retiming Across Fanout Junction 0 1 0 1 1 0 0011 0011 0110 0110 0011 0 1 0011 0 1 Graphs are 1-step equivalent. Ignore transient states

24 and Graph Composition G1G2 G X G1G X G2 SPLIT s G1 s1 s2 SPLIT G2 s,t G1 X G s1,t s2,t G2 X G

25 Applying Compositionality G C1 = G Cx X G Cx G C2 = G Cx’ X G Cx Retime across Primitive Element C2C1 X X’ G C1 G Cx G Cx’ G C2 Applies to general retiming (by induction)

26 C1 (S+T)* C2G1G2 Synthesis does not change STG Retiming = (Basic retiming) * Basic retiming results in 1-step equivalent graphs Composition: G1G2 G X G1G X G2 Basic retiming within a circuit results in 1-step equivalent graphs Applies to general retiming by induction

27 Outline Background Complexity Result òExtensions to retiming and resynthesis Summary

28 Analysis Retiming and resynthesis optimization involves only a local notion of state equivalence Covers only a subset of all valid STG transformations

29 Limitation of (S + T)* - 1st Example 00011110 0101 C1C2 01 01 C1 (S+T)* C2 [Zhou97]

30 Extending Synthesis: Eliminate Floating Latches 00011110 010 1 C1 01 01 00110110 010 1 Re-encoding C2 Eliminate floating latch

31 Limitation of (S + T)* - 2nd Example 001 --0 x y e e C1 x y e C2 0001 1011 0 0 0 1 C1 (S+T)* C2 else 01 111 0-1, -01 10

32 Extending Retiming: Retiming Enabled Latches e e x y e RETIME x y e e x y ee x y e

33 All circuit optimizations Summary Characterized wrt STG transformations (S+T)* Re(T)iming (S)ynthesis Obtain tight bounds for extended transformations

Download ppt "Rajeev K. Ranjan Advanced Technology Group Synopsys Inc. On the Optimization Power of Retiming and Resynthesis Transformations Joint work with: Vigyan."

Similar presentations

Address comments to FPGA Area Reduction by Multi-Output Sequential Resynthesis Yu Hu 1, Victor Shih 2, Rupak Majumdar 2 and Lei He 1 1.

Address comments to FPGA Area Reduction by Multi-Output Sequential Resynthesis Yu Hu 1, Victor Shih 2, Rupak Majumdar 2 and Lei He 1 1.
Optimization of Sequential Networks Step in Synthesis: Problem Flow Table Reduce States Minimum-State Table State Assignment Circuit Transition Table Flip-Flop.

Optimization of Sequential Networks Step in Synthesis: Problem Flow Table Reduce States Minimum-State Table State Assignment Circuit Transition Table Flip-Flop.
Combinational Logic.

Combinational Logic.
Types of Logic Circuits

Types of Logic Circuits
Courtesy RK Brayton (UCB) and A Kuehlmann (Cadence) 1 Logic Synthesis Sequential Synthesis.

Courtesy RK Brayton (UCB) and A Kuehlmann (Cadence) 1 Logic Synthesis Sequential Synthesis.
1 1 Regression Verification for Multi-Threaded Programs Sagar Chaki, SEI-Pittsburgh Arie Gurfinkel, SEI-Pittsburgh Ofer Strichman, Technion-Haifa Originally.

1 1 Regression Verification for Multi-Threaded Programs Sagar Chaki, SEI-Pittsburgh Arie Gurfinkel, SEI-Pittsburgh Ofer Strichman, Technion-Haifa Originally.
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.

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.
Chapter 9 Asynchronous Sequential Logic 9-1 Introduction Introduction 9-2 Analysis Procedure Analysis ProcedureAnalysis Procedure 9-3 Circuits With Latches.

Chapter 9 Asynchronous Sequential Logic 9-1 Introduction Introduction 9-2 Analysis Procedure Analysis ProcedureAnalysis Procedure 9-3 Circuits With Latches.
Asynchronous Sequential Logic

Asynchronous Sequential Logic
Digital Logic Design Brief introduction to Sequential Circuits and Latches.

Digital Logic Design Brief introduction to Sequential Circuits and Latches.
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTES Logic Simulation.

ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTES Logic Simulation.
Global Flow Optimization (GFO) in Automatic Logic Design “ TCAD91 ” by C. Leonard Berman & Louise H. Trevillyan CAD Group Meeting Prepared by Ray Cheung.

Global Flow Optimization (GFO) in Automatic Logic Design “ TCAD91 ” by C. Leonard Berman & Louise H. Trevillyan CAD Group Meeting Prepared by Ray Cheung.
Clock Skewing EECS 290A Sequential Logic Synthesis and Verification.

Clock Skewing EECS 290A Sequential Logic Synthesis and Verification.
Sequential Timing Optimization. Long path timing constraints Data must not reach destination FF too late s i + d(i,j) + T setup  s j + P s i s j d(i,j)

Sequential Timing Optimization. Long path timing constraints Data must not reach destination FF too late s i + d(i,j) + T setup  s j + P s i s j d(i,j)
Circuit Retiming with Interconnect Delay CUHK CSE CAD Group Meeting One Evangeline Young Aug 19, 2003.

Circuit Retiming with Interconnect Delay CUHK CSE CAD Group Meeting One Evangeline Young Aug 19, 2003.
Combining Technology Mapping and Retiming EECS 290A Sequential Logic Synthesis and Verification.

Combining Technology Mapping and Retiming EECS 290A Sequential Logic Synthesis and Verification.
Penn ESE 535 Spring 2009 -- DeHon 1 ESE535: Electronic Design Automation Day 13: March 4, 2009 FSM Equivalence Checking.

Penn ESE 535 Spring DeHon 1 ESE535: Electronic Design Automation Day 13: March 4, 2009 FSM Equivalence Checking.
Asynchronous Sequential Logic

Asynchronous Sequential Logic
1 Digital Logic

1 Digital Logic
Asynchronous Interface Specification, Analysis and Synthesis M. Kishinevsky Intel Corporation J. Cortadella Technical University of Catalonia.

Asynchronous Interface Specification, Analysis and Synthesis M. Kishinevsky Intel Corporation J. Cortadella Technical University of Catalonia.

Similar presentations

Ads by Google