1. Courtesy RK Brayton (UCB) and A Kuehlmann (Cadence) 1 Logic Synthesis Timing Optimization

2. 2 Restructuring for Timing Optimization Outline: Definitions and problem statement Overview of techniques (motivated by adders) –Tree height reduction (THR) –Generalized bypass transform (GBX) –Generalized select transform (GST) –Partial collapsing

3. 3 Timing Optimization Factors determining delay of circuit: Underlying circuit technology –Circuit type (e.g. domino, static CMOS, etc.) –Gate type –Gate size Logical structure of circuit –Length of computation paths –False paths –Buffering Parasitics –Wire loads –Layout

4. 4 Problem Statement Given: Initial circuit function description Library of primitive functions Performance constraints (arrival/required times) Generate: an implementation of the circuit using the primitive functions, such that: –performance constraints are met –circuit area is minimized

5. 5 Current Design Process Behavior Optimization (scheduling) Partitioning (retiming) Logic synthesis Technology independent Technology mapping Timing driven place and route Behavioral description Logic and latches Logic equations Gate netlist Layout Gate library Perf. Constraints Delay models

6. 6 Technology Mapping for Delay Functiontree Buffertree

7. 7 Overview of Solutions for Delay Circuit re-structuring –Rescheduling operations to reduce time of computation Implementation of function trees (technology mapping) –Selection of gates from library Minimum delay (load independent model - Kukimoto) Minimize delay and area (Jongeneel, DAC’00) (combines Lehman-Watanabe and Kukimoto) Implementation of buffer trees –Touati (LT-trees) –Singh Resizing Constant delay synthesis

8. 8 Circuit Restructuring Approaches: Local: Mimic optimization techniques in adders –Carry lookahead (THR tree height reduction) –Conditional sum (GST transformation) –Carry bypass (GBX transformation) Global: Reduce depth of entire circuit –Partial collapsing –Boolean simplification

9. 9 Restructuring Methods Performance measured by levels, sensitizable paths, technology dependent delays Level based optimizations: –Tree height reduction (Singh ‘88) –Partial collapsing and simplification (Touati ‘91) –Generalized select transform (Berman ‘90) Sensitizable paths –Generalized bypass transform (McGeer ‘91)

10. 10 Tree-Height Reduction (THR) n lm ij h k 3 6 55 1 4 1 0 0 002 0 0 a bcdefg i 1 0 0 a b m j h k 3 4 1 002 0 0 cdefg n’ Duplicated logic 1 2 0 0 5 Critical region Collapsed Critical region Singh’88:

11. 11 Tree-Height Reduction i 1 0 0 a b m j h k 3 4 1 002 0 0 cdefg n’ Duplicated logic 1 2 0 0 5 i 1 0 0 a b m j h k 3 4 1 002 0 0 cdefg 1 2 0 3 5 n’ 2 1 0 4 Collapsed Critical region New delay = 5

12. 12 Generalized bypass transform (GBX) Make critical path false –Speed up the circuit Bypass logic of critical path(s) f m =f f m+1 f n =g … f m =f f m+1 f n =g … 0 1 g’ dg __ df Boolean difference s-a-0 redundant McGeer’91:

13. 13 GBX and KMS transform GBX gives little area increase, BUT creates an untestable fault (on control input to multiplexer) KMS transform: (remove false paths without increasing delay) f k is last node on false path that fans out. Duplicate false path {f 1,…, f k } -> {f’ 1, …, f’ k } f’ j fans out to every fanout of f j except f j+1, and f j just fans out to f j+1 Set f 0 input to f 1 to controlling value and propagate constant (can do because path is false and does not fanout) KMS results –Function of every node, except f 1, …,f k is unchanged –Added k nodes –Area added in linear in size of length of false paths; in practice small area increase.

14. 14 KMS f m+1 f m+2 fnfn … f m+k f m+k+1 f’ m+1 f’ m+2 f’ m+k f m+1 f m+2 fnfn … f m+k f m+k+1 0 … Delay is not increased Keutzer, Malik, Saldanha’90:

15. 15 Generalized select transform (GST) Berman’90: Late signal feeds multiplexor cdefg a b out cdefg b cdefg b a=0 a=1 out 0 1 a

16. 16 GST vs GBX GST vs GBX … 0 1 g’ dh __ da a a b c g h cdefg b cdefg b a=0 a=1 out 0 1 a GST cdefg b cdefg b a=0 a=1 … 0 1 g’ ac g b GBX a h

17. 17 GST vs GBX Select transform appears to be more area efficient But Boolean difference generally more efficiently formed in practice No delay/speedup advantage for either transform Can reuse parts of the critical paths for multiple fanouts on GST cdefg b cdefg b a=0 a=1 out1 0 1 a GST out2 0 1 a

18. 18 Technology Independent Delay Reductions Generally THR, GBX, GST (critical path based methods) work OK, –but very greedy and computationally expensive Why are technology independent delay reductions hard? Lack of fast and accurate delay models –# levels, fast but crude –# levels + correction term (fanout, wires,… ): a little better, but still crude (what coefficients to use?) –Technology mapped: reasonable, but very slow –Place and route: better but extremely slow –Silicon: best, but infeasibly slow (except for FPGAs) betterbetter slowerslower

19. 19 Conclusions Variety of methods for delay optimization –No single technique dominates –When applied to ripple-carry adder get –Carry-lookahead adder (THR) –Carry-bypass adder (GBX) –Carry-select adder (GST) –Clustering/Partial collapse All techniques ignore false paths when assessing the delay and critical regions –Can use KMS transform to eliminate false paths without increasing delay (Caveat: potentially large increase in area)