1. Behavioral Synthesis Outline –Synthesis Procedure –Example –Domain-Specific Synthesis –Silicon Compilers –Example Tools Goal –Understand behavioral synthesis algorithms –Overview behavioral synthesis tools

2. Why is Behavioral Synthesis Hard? Compilers have been around for years, why not HLL compilers? Complicated constraints –timing constraints »bus protocols »pipelining –physical constraints »registers and ALUs are expensive »communications (muxes, wiring) is expensive »packaging hierarchy Heterogeneity –separation of data and control logic –wide range of RTL primitives »ALU, ROM, MUX

3. Synthesis Procedure Parse behavioral description into data flow graph –equivalent to compiler intermediate code Optimize data flow graph –compiler-like operations Schedule operations –assign operations to clock cycles (in synchronous system) Cluster operations –group connected components together Allocate RTL resources –place values in registers –place operations in ALUs –data transfers on wires and MUXs Generate control logic –microcode, PLA, random logic –fit to clock cycles mux reg + if (a == b) out = 1; else out = 0;

4. Data Flow Optimization Transform data flow –minimize cost (operations) –minimize delay (path length) Compiler-like transformations –loop unrolling –code motion –strength reduction BAABAB D BC AA D BC A X +

5. Scheduling Assign operations to clock cycles –balance speed vs. cost D BC AA 1 2 3 D B C A A 3 4 5 1 2 3 clock cycles 2 ALUs 5 clock cycles 1 ALU

6. Clustering Cluster operations based on connectivity –connected components Uses –guide later package partitioning –guide binding to RTL modules –guide chip place and route

7. Allocation and Binding Map data flow to RTL components –allocate operator and register components –bind operations and values to them –minimize total cost of components Cost models –cost for different operators –cost for register bits –determined by RTL implementation experience Approach –NP-hard search problem »related to graph covering »cover data flow graph with RTL modules »minimax - EMUCS –maximum munching - like code generation –tricky trade-offs »e.g. adder and subtractor vs. one ALU A B A/B cost: 5

8. Control Logic Generation State Machine –transformed along with data flow –specify clock cycles, signal values –inputs from conditionals –outputs for muxes, ALUs, etc. Clocking –gating clocks with control values –generally a non-issue today Approach –ROM microcode –PLA state machines –random logic state machines –state assignment, optimization left for RTL synthesis S0 S1 S2 j=1 k=0 S3 k=4 O=00 O=01 O=10O=11

9. Synthesis Example 4-bit Up/Down Counter –4-bit input "countin" –4-bit output "countout" –up/down control "up" –count control "count" –internal state "i" –implied clock Behavior –up = 1 => count up –up = 0 => count down –count = 1 => count –count = 0 => load 4 countin i countout up count 4 1 1 clock

10. Verilog Description /* ----- Programmable 4-bit up/down counter ----- */ MODULE COUNTER (COUNTIN: IN, UP: IN, COUNT: IN, COUNTOUT: OUT); EXTERNAL COUNTER; DCL COUNTIN BIT(4), /* programming input */ UP BIT(1), /* 1=up, 0=down */ COUNT BIT(1), /* 1=count, 0=program */ COUNTOUT BIT(4); /* counter output */ INTERNAL COUNTER; DCL I BIT(4); /* counting variable */ BODY COUNTER; DO INFINITE LOOP COUNTOUT:=I; IF COUNT THEN IF UP THEN I:=I+1; ELSE i:=I-1; ENDIF; ELSE I=COUNTIN; ENDIF; ENDDO; END COUNTER;

11. VHDL Description package vvectors is subtype bit32 is integer; subtype bit4 is integer range 0 to 15; subtype bit16 is integer range 0 to 65535; end vvectors;... use work.vvectors.all; entity counter is port (clock : in bit; countin : in bit4; up, count : in bit; countout : out bit4); end counter;

12. VHDL Description cont. architecture behavior of counter is begin process variable i: bit4 := 0; begin wait until clock = '1'; countout <= i; if (count = '1') then if (up = '1') then if (i = bit4'high) then i := bit4'low; else i := i+1; end if; else if (i = bit4'low) then i := bit4'high; else i := i-1; end if; else i := countin; end if; end process; end behavior;

13. Parsed Data Flow + i if 11 up i if count countin loop start countout -

14. Optimized and Scheduled Data Flow + i i if count countin cycle j countout cycle j+1 if +1 up

15. RTL Bindings 4-bit adder mux +1 up count countin countout 4-bit reg clock 4-bit ALU mux add/sub (up) count countin countout 4-bit reg clock 1

16. Synthesis Issues RTL library –the “instruction set” –synthesis results strongly depend on it »in example, really want up/down RTL module –RISC approach does not apply since circuits are CISC »ALU, adder, up/down counter, incrementer,... Bottom-up feedback –timing and cost information –results can change radically with slightly different costs »e.g. ALU cheaper, mux more expensive vs.

17. Domain-Specific Synthesis Limit synthesis to subset of behaviors –instruction set processors –digital signal processors –analog signal processors –state-machine controllers Specialized input language –more precision Specialized transformations –no control in DSP Specialized RTL library –bit-serial DSP Examples –CATHEDRAL I, II, III, IV –LAGER

18. Silicon Compilers Map directly from behavior to layout –developed at Caltech –original focus on datapaths with PLA/ROM control –tools often developed for specific chip project »SCHEME chip at MIT »OM1, OM2 at Caltech Simple optimization, scheduling, binding –requires many user hints Primarily module generators –direct RTL to layout synthesis Original idea died out –too restrictive –lives on in module generators, DSP synthesis

19. Example Tools System Architect’s Workbench (CMU) VSS (UC Irvine) Olympus/Hercules (Stanford) Alliance (Univ. PMC) Yorktown Silicon Compiler (IBM) MIMOLA (Univ. Dortmund) BLIS (UCB) CATHEDRAL I..IV (Univ. Leuven) LAGER (UCB)