1. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR HDL coding n Synthesis vs. simulation semantics n Syntax-directed translation n HDL coding for synthesis. –Verilog. –VHDL. n State machines n Element structure n Synthesis n I/O configuration n Timing model

2. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR Synthesis vs. simulation semantics n Simulation: –Events are interpreted during simulation. n Synthesis: –Logic/memory is extracted from the description. CL

3. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR Logic synthesis n Synthesis = translation + optimization. –Translated from HDL or direct Boolean network. –Ideally, translation includes don’t-cares. –Optimization rewrites to satisfy objective functions: area, speed, power.

4. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR Syntax-directed translation x = a and b; a b x if (a or b) begin x = c; end; a bx c

5. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR Verilog simulation and synthesis n Signal assignments must use the assign keyword: –assign sig3 = sig1 & sig2;

6. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR Verilog structural descriptions n Build a structure by wiring together components: input [7:0] a, b; input carryin; output [7:0] sum; output carryout; wire [7:1] carry; fulladd a0(a[0],b[0],carryin,sum[0],carry[1]); fulladd a1(a[1],b[1],carry[1],sum[1],carry[2]); fulladd a2(a[2],b[2],carry[2],sum[2],carry[3]); Type name Instance name

7. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR VHDL for Synopsys synthesis n Each process should start with an activation list: process foo (a,b,in1,in2) n At least two processes: –combinational; –sequential. n Sequential process includes wait until clock…

8. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR Initializing variables All variables used must be initialized. Uninitialized variables cause latches to be introduced: BAD.

9. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR State machines Use case(x/z) statement to decode current state: initial begin: Init s0 = B”000”; end case (curr) 2’b00: if (in1 = ‘0’) begin o1 = a or b; end; 2’b01:...

10. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR Process structure n How many combinational processes? –separate datapath; –single process for data and control. n Comparison: –single process is simpler; –separate datapath uses less logic. combin seq vs. ctrl combin seq dp combin

11. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR Multiplexing a datapath element case (muxctrl) 1’b0: muxout = a; 1’b1: muxout = b; end; foo = muxout or c;

12. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR Arithmetic n Can generate logic by hand. n Operators (+,-,,*,+1,-1,etc.) can be mapped onto library elements. –May be limited to standard widths.

13. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR General synthesis hints n Check out all warnings carefully. n An early synthesis run keeps you from debugging a simulation that won’t synthesize.

14. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR The synthesis process n Synthesis is driven by a script: compile -map_effort med report_fpga > TOP + “.fpga” n Script may be customized for the design. –Verilog file foo.v, script file foo.script. –Typically start with a standard script.

15. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR Timing constraints n Clock period. –Duty cycle, etc. n Group path timing. –Cells or ports that share the same timing behavior. n Input/output delay. –End-to-end delay.

16. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR Hierarchical design and logic optimization n Boolean network model does not reach across component boundaries. n Tools generally won’t automatically flatten logic. –Size may blow up. n You may direct the tool to flatten a group of components. –Heuristic flattening algorithms may be used.

17. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR Instantiating memory n Use a memory model: –primitive memories based on LUT; –larger memories synthesized from multiple logic elements. n Synthesis can’t handle a memory described behaviorally. –Can handle behavioral ROM.

18. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR I/O configuration n Synthesis can automatically determine the types of many I/O blocks, configure appropriately. n Some things that need to be specified: –indirect three-state activity; –I/O pin location; –registered bidirectional I/O.

19. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR Timing model n Synthesis system reads a wire load model from a technology library. –Model depends on part, speed grade.

20. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR Attribute passing n FPGA Compiler allows attributes to be passed to EDIF: –BUFG X(.I(a),.O(b)); // synopsys attribute LOC BR

21. FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR Results and reports n Save design as: –database; –EDIF. n Types of reports: –Default synthesis report. –Configuration report. »Describes LEs, IOBs, etc. –Timing report.