Verilog RTL Coding Guideline for Synthesis and Simulation Ando KI June 2009. - презентация

1 Verilog RTL Coding Guideline for Synthesis and Simulation Ando KI June 2009

2 Copyright © by Ando KiLecture overview ( 2 ) Contents Coding guideline for synthesis What for Terminologies Latch and flip-flop Modeling HW elements Modeling combinational logic Modeling edge-sensitive sequential logic Modeling level-sensitive storage devices Modeling tree-state drivers Modeling read-only memories (ROM) Modeling random access memories (RAM) Coding guideline for synthesis & simulation Blocking and non-blocking Race problem Use parentheses Resource sharing Pre-schedule RTL Full case for if statement Full/parallel case for case statement Pseudo comment for full case Pseudo comment for parallel case Casex Casez

3 Copyright © by Ando KiLecture overview ( 3 ) What for Define a set of modeling rules for writing Verilog HDL description for synthesis Define how the semantics of Verilog HDL are used Describe the syntax of the language with reference to what shall be supported and what shall not be supported for interoperability Enhance the portability of Verilog-HDL-based design across synthesis tools conforming to this standard Minimize the potential for functional mismatch that may occur between the RTL model and the synthesized netlist

4 Copyright © by Ando KiLecture overview ( 4 ) Terminologies (1/2) Synchronous & asynchronous Synchronous: Data that changes only on a clock edge Asynchronous: Data that changes value independent of the clock edge Edge-sensitive & level-sensitive storage device Edge-sensitive storage device: Any device mapped to by a synthesis tool that is edge-sensitive to a clock, e.g., a flip-flop. Level-sensitive storage device: Any device mapped to by a synthesis tool that is level-sensitive to a clock, e.g., a latch. Combinational & sequential logic Combinational logic: Logic that does not have any storage device, either edge- sensitive or level-sensitive. Sequential logic: Logic that includes any kind of storage device, either level-sensitive or edge-sensitive.

5 Copyright © by Ando KiLecture overview ( 5 ) Terminologies (2/2) Instantiation & inference Instantiation: explicitly select a technology-specific element in the target library. Inference: direct the HDL Compiler to infer latches or flip-flops or other resource blocks from your Verilog or VHDL description. Technology-independent & technology-dependent Keeping the pre-synthesis design source code technology-independent allows you to re-target to other technologies at a later time, with a minimum of re-design effort. Technology-dependent design uses dedicated functions or design techniques optimized for speed or area The designer may require detailed understanding on device architectures

6 Copyright © by Ando KiLecture overview ( 6 ) Latch and flip-flop Latch When en = 1, latch is transparent D flows through to Q like a buffer When en = 0, the latch is opaque Q holds its old value independent of D a.k.a. transparent latch or level-sensitive latch Flip-flop When CLK rises, D is copied to Q At all other times, Q holds its value a.k.a. positive edge-triggered flip-flop, master-slave flip-flop

7 Copyright © by Ando KiLecture overview ( 7 ) Modeling hardware elements Modeling combinational logic Modeling edge-sensitive sequential logic Modeling level-sensitive storage devices Modeling tri-state drivers Modeling read-only memories (ROM) Modeling random access memories (RAM)

8 Copyright © by Ando KiLecture overview ( 8 ) Modeling combinational logic Continuous assignment Net declaration assignment Always statement Event list shall not contain an edge event (posedge or negedge) Event list must include all the variables read in the always statement If not, mismatch can occur between simulation and synthesized logic. Shall not use both a blocking assignment (=) and a non-blocking assignment (<=) in the same always statement wire my_signal = A + B; wire your_signal; assign your_signal = A + B; (in1 or in2) out = in1 + in2; (*) begin tmp1 = a & b; tmp2 = c & d; z = tmp1 | tmp2; end // implicit event list expression yields comb. logic (posedge a or b) … … // not supported; does not model comb. Logic (in) if (ena) out = in; else out = in2; // should be (in or ena) … (in1 or in2 or ena) if (ena) out = in1; else out <= in2; // dont mix = and <= in an always statement

9 Copyright © by Ando KiLecture overview ( 9 ) Modeling edge-sensitive seq. logic Sequential logic shall be modeled using an always statement that has one or more edge event in the event list. // positive edge (posedge ) … … // negative edge (negedge ) … …

10 Copyright © by Ando KiLecture overview ( 10 ) Modeling edge-sensitive storage devices An edge-sensitive storage shall not use multiple event lists Nonblocking procedural assignment should be used Multiple event lists are not supported within an always statement (posedge clock) begin out <= (posedge clock); out <= 1; end // not legal: multiple-edge event list reg out; … (posedge clock) out <= in; // out: pos-edge triggered storage reg [3:0] out; (negedge clock) out <= in; // out: neg-edge triggered storage with 4 elements DQ clock DQ

11 Copyright © by Ando KiLecture overview ( 11 ) Edge-sensitive with synchronous set/reset An edge-sensitive storage device with a synchronous set/reset is modeled using an always statement whose event list only contains edge events representing the clock. reg out; … always (posedge clock) if (reset) out <= 1b0; else out <= in; // synchronous reset (posedge clock) if (set) out <= 1b1; else out <= in; // synchronous set (posedge clock or reset) begin if (reset) out <= 1b0; else out <= in; end // do not mix edge and level sensitive event

12 Copyright © by Ando KiLecture overview ( 12 ) Edge-sensitive with asynchronous set/reset (1/2) An edge-sensitive storage device with an asynchronous set/reset is modeled using an always statement whose event list contains edge events representing the clock and asynchronous control variables. Level-sensitive events shall not be allowed in the event list of an edge- sensitive storage device model. The first if and optional else if statements model asynchronous control and a final else statement specifies the synchronous logic portion. Andy sequence of edge events can be in event list. // generic form (posedge or negedge or negedge or … or posedge ) if (condA) // positive polarity … … // asynchronous logic else if (~ ) // negative polarity … … // asynchronous logic else if (~ ) … … // asynchronous logic else if … … else // implicit posedge … … // synchronous logic The final else statement If there are N edge events in the event list, the else following (N-1) ifs, at the same level as the top-level if statement, determines the final else.

13 Copyright © by Ando KiLecture overview ( 13 ) Edge-sensitive with asynchronous set/reset (2/2) (posedge clock or posedge reset) out <= in; // not legal: the if statement is missing (posedge clock or negedge clear) if (clear) out <= 0; else out <= in; // not legal: if condition does not match the polarity // of the edge event (posedge clock or posedge set) if (set) out <= 1b1; else out <= din; // edge-sensitive storage with asynchronous set (posedge clock or negedge reset) if (~reset) out <= 1b0; else out <= din; // edge-sensitive storage with asynchronous reset (posedge clock or negedge clear) if (~clear) out <= 0; else if (ping) out <= in; else if (pong) out <= 8bFF; else out <= din; // synchronous logic starts after the first else

14 Copyright © by Ando KiLecture overview ( 14 ) Modeling level-sensitive storage devices The event list does not contain a edge events (posedge or negedge). The same as the combinational logic. The event list of the always statement should list all variables read within the always statement. The same as the combinational logic. There is no explicit assignment to the variable. Implicitly value keeping semantics. Nonblocking procedural assignment should be used for variable. Note: it is latch inference intentionally. (en or d) if (en) q <= d; // If en is deasserted, q will hold its value. (en or d) if (en) q <= d; else q <= b0; // Latch is not inferred, but a combinational logic. // q is assigned on every execution of the always // statement meaning combinational logic.

15 Copyright © by Ando KiLecture overview ( 15 ) Modeling tri-state drivers (1/3) Tri-state logic shall be modeled when a variable is assigned the value z. (q or en) if (!en) out <= bz; else out <= q; // out is a three-state driver. module ztest (test2, test1, test3, en); input [0:1] en; input [7:0] test1, test3; output [7:0] test2; wire [7:0] test2; assign test2 = (en == 2b01) ? test1 : 8bz; assign test2 = (en == 2b10) ? test3 : 8bz; // test2 is three-state when en is 2b00 or 2b11. endmodule

16 Copyright © by Ando KiLecture overview ( 16 ) Modeling tri-state drivers (2/3) (posedge clock) q <= din; assign out = en ? q : 1bz; // one edge-sen. storage with a tri-state driver (posedge clock) if (!en) out <= 1bz; else out <= din; // two edge-sen. storages. One for din, one for en, // with a tri-state driver for din-out. outdin clock en outdin clock en

17 Copyright © by Ando KiLecture overview ( 17 ) Modeling tri-state drivers (3/3) Z assignment shall not propagate across variable assignment. (in) begin tmp = bz; out = tmp; // out shall not be driven by three state drivers // because the value bz does not propagate // across the variable assignment. end module ztest; wire test1, test2, test3; input test2; output test3; assign test1 = 1bz; assign test3 = test1 & test2; // test3 will never receive a z assignment // test2 always determines test3. endmodule

18 Copyright © by Ando KiLecture overview ( 18 ) Modeling one-dimensional ROM module rom_case( output reg [3:0] z, input wire [2:0] a; // Address - 8 deep memory. case (a) 3'b000: z = 4'b1011; 3'b001: z = 4'b0001; 3'b100: z = 4'b0011; 3'b110: z = 4'b0010; 3'b111: z = 4'b1110; default: z = 4'b0000; endcase endmodule // rom_case // z is the ROM, and its address size is // determined by a.

19 Copyright © by Ando KiLecture overview ( 19 ) Modeling two-dimensional ROM With fixed contentsWith data in text file module rom_2dimarray_initial ( output wire [3:0] z, input wire [2:0] a; // address- 8 deep memory // Declare a memory rom of 8 4-bit registers. // The indices are 0 to 7: reg [3:0] rom[0:7]; initial begin rom[0] = 4'b1011; rom[1] = 4'b0001; rom[2] = 4'b0011; rom[3] = 4'b0010; rom[4] = 4'b1110; rom[5] = 4'b0111; rom[6] = 4'b0101; rom[7] = 4'b0100; end assign z = rom[a]; endmodule module rom_2dimarray_initial_readmem ( output wire [3:0] z, input wire [2:0] a); // Declare a memory rom of 8 4-bit registers. // The indices are 0 to 7: reg [3:0] rom[0:7]; initial $readmemb("rom.data", rom); assign z = rom[a]; endmodule // with data in text file // Example of content rom.data file: 1011 // addr= // addr= // addr= // addr= // addr= // addr= // addr= // addr=

20 Copyright © by Ando KiLecture overview ( 20 ) Modeling RAM // A RAM element is an edge-sensitive storage // element: module ram_test( output wire [7:0] q, input wire [7:0] d, input wire [6:0] a, input wire clk, we); reg [7:0] mem [127:0]; clk) if (we) mem[a] <= d; assign q = mem[a]; endmodule // A RAM element is a level-sensitive storage // element: module ramlatch ( output wire [7:0] q, // output input wire [7:0] d, // data input input wire [6:0] a, // address input wire we; // clock and write enable // Memory 128 deep, 8 wide: reg [7:0] mem [127:0]; if (we) mem[a] <= d; assign q = mem[a]; endmodule RAM element with edge-sensitiveRAM element with level-sensitive

21 Copyright © by Ando KiLecture overview ( 21 ) Contents Coding guideline for synthesis & simulation Blocking and non-blocking Race problem Use parentheses Resource sharing Pre-schedule RTL Full case for if statement Full/parallel case for case statement Pseudo comment for full case Pseudo comment for parallel case Casex Casez

22 Copyright © by Ando KiLecture overview ( 22 ) Blocking and non-blocking Blocking assignments (=) execute in sequential order. Non-blocking assignments (<=) execute concurrently. (posedge clk) begin a = din; b = a; end Blocking assignments (1/2) (posedge clk) begin b = a; a = din; end Blocking assignments (2/2) (posedge clk) begin a <= din; b <= a; end Non-blocking assignments (1/2) (posedge clk) begin b <= a; a <= din; end Non-blocking assignments (2/2)

23 Copyright © by Ando KiLecture overview ( 23 ) Race condition Blocking assignments follow order of statements. Parallel procedures have no order. Thus, blocking assignments across parallel procedures can cause race condition. The result depends on execution order, which is not explicitly determined. clk) a = b; clk) b = a; // With Blocking both start at same time // a could transfer to b first and b also could // transfer to a first. The order is not fixed. clk) a <= b; clk) b <= a;

24 Copyright © by Ando KiLecture overview ( 24 ) Use parentheses Use parentheses to control the structure of a complex design Use parentheses to guide synthesis assign z1 = a + b + c + d; assign z2 = (w + x)+ (y + z); // the same hardware blocks used, // but z2 gives better delay-time characteristics than z1.

25 Copyright © by Ando KiLecture overview ( 25 ) Full case for if construct Be called full when all possible outcomes are accounted for. (en or a or b) if (en) q <= a; else q <= b; (en or d) if (en) q <= d; // If en is false, there may be need to preserve // a previous value set onto the wire q. It is full case. (en or a or b) begin q = b; if (en) q = a; end It is full case. It is not full case.

26 Copyright © by Ando KiLecture overview ( 26 ) module full_par (sel, a, b, c, d, out); input [1:0] sel; input a, b, c, d; output out; reg out; (sel or a or b or c or d) case (sel) 2b11: out <= a; 2b10: out <= b; 2b01: out <= c; default: out <= d; // 2b00 endcase endmodule module par_not_full (sel, a, b, c, out); input [1:0] sel; input a, b, c; output out; reg out; (sel or a or b or c) case (sel) 2b11: out <= a; 2b10: out <= b; 2b01: out <= c; endcase endmodule Full/parallel case for case construct (1/2) A case statement is called full if all possible outcomes are accounted for. A case statement is called parallel if the stated alternatives are mutually exclusive.

27 Copyright © by Ando KiLecture overview ( 27 ) module full_not_par (sel, a, b, c, out); input [1:0] sel; input a, b, c; output out; reg out; (sel or a or b or c) case (sel) 2b1?: out <= a; // 2b10, 2b11 2b?1: out <= b; // 2b01, 2b11 default: out <= c; // 2b00 endcase endmodule // If the case is 2b11 occurs, the first outcome gets higher priority because it is closer to the output. module not_full_not_par (sel, a, b, out); input [1:0] sel; input a, b; output out; reg out; (sel or a or b) case (sel) 2b1?: out <= a; // 2b10, 2b11 2b?1: out <= b; // 2b01, 2b11 endcase endmodule Full/parallel case for case construct (2/2)

28 Copyright © by Ando KiLecture overview ( 28 ) Casex The casex treats z or x or ? symbols in the expression or case items as dont – cares.

29 Copyright © by Ando KiLecture overview ( 29 ) Casez The casez treats z or ? symbols in the expression or case items as dont-cares. The syntax of literal numbers allows the use of the question mark (?) in place of z in the casez statement.