Basic Logic Design

with Verilog

TA: Chihhao Chao

[email protected]

Lecture note ver.1 by Chen-han Tsai

ver.2 revised by Chih-hao Chao

Lecture Note on Verilog, Course #90132300, EE, NTU, C.H. Chao

 Outline

Introduction to HDL/ Verilog

Gate Level Modeling
Behavioral Level Modeling
Test bench
Summary and Notes

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Introduction to HDL/ Verilog

Lecture Note on Verilog, Course #90132300, EE, NTU, C.H. Chao

 What is HDL/Verilog
Why use HDL (Hardware Description Language)?
Design abstraction: HDL ←→ layout by human
Hardware modeling
Reduce cost and time to design hardware
Verilog is one of the most popular HDLs
VHDL (another popular HDL)
Key features of Verilog
Supports various levels of abstraction
Behavior level
Register transfer level
Gate level
Switch level
Simulate design functions

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Hardware Design Flow
Designer
Level Cost
RTL RTL High Low
Simulation Editor

RTL Code

Gate Level Logic

Simulation Synthesizer

Verilog Gate Level Code

Post Gate
Level Place & Route
Simulation
Physical Layout

Tape Out
Low High

Lecture Note on Verilog, Course #901Chip

32300, EE, NTU C.H. Chao, 11/18/2005
 An Example
1-bit Multiplexer
sel sel in1 in2 out
to “select” output 0 0 0 0

in1 0 0 0 1 0

0 1 0 1
out
0 1 1 1
in2 1 1 0 0 0

1 0 1 1

if (sel==0)
1 1 0 0

1 1 1 1

out = in1;
else out = (sel’‧in1) + (sel‧in2)
out = in2;

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Gate Level Description
in1
a1_o
iv_sel a1 out
in2 o1
n1 a2 a2_o

sel iv_sel

Gate Level: you see only netlist (gates and wires) in the code

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Behavioral Level/RTL Description

always block assign

RTL: you may see high level behavior in the code

Behavior: event-driven behavior description construct

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Verilog HDL Syntax

Lecture Note on Verilog, Course #90132300, EE, NTU, C.H. Chao

 A Simple Verilog Code
module name in/out port

declaration
syntax
port/wire
declaration

kernel hardware
gate-connection/
behavior

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Module
Basic building block in Verilog.
Module
1. Created by “declaration” (can’t be nested)
2. Used by “instantiation“
Interface is defined by ports
May contain instances of other modules
All modules run concurrently

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Instances
A module provides a template from which you
can create actual objects.
When a module is invoked, Verilog creates a
unique object from the template.
Each object has its own name, variables,
parameters and I/O interface.

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Module Instantiation

Adder

instance
example

Adder Adder

Adder_tree

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Analogy: module ↔ class
As module is to Verilog HDL, so class is to C++
programming language.

Format module m_Name( IO list ); class c_Name {

... ...
endmodule };

Instantiation m_Name ins_name ( port c_Name obj_name;

connection list );
Member ins_name.member_signal obj_name.member_data

Hierachy instance.sub_instance.me object.sub_object.member_

mber_signal data

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Analogy: module ↔ class

Model AND gate with C++ Model AND gate with Verilog HDL

assign and evaluate() is simulated/called

at each Ti+1 = Ti + tresolution

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Port Connection

Connect module port by order list

FA1 fa1(c_o, sum, a, b, c_i);
Not fully connected
FA1 fa3(c_o,, a, b, c_i);
Connect module port by name .PortName( NetName )
FA1 fa2(.A(a), .B(b), .CO(c_o),.CI(c_i), .S(sum));
Recommended

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Verilog Language Rule
Case sensitive
Identifiers:
Digits 0…9
Underscore _
Upper and lower case
letters from the alphabet

Terminate statement/declaration with semicolon “;”

Comments:
Single line: // it’s a single line comment example
Multi-line: /* when the comment exceeds single line,
multiline comment is necessary*/

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Register and Net
Registers
Keyword : reg, integer, time, real
Event-driven modeling
Storage element (modeling sequential circuit)
Assignment in “always” block
Nets
Keyword : wire, wand, wor, tri
triand, trior, supply0, supply1
Doesn’t store value, just a connection
input, output, inout are default “wire”
Can’t appear in “always” block assignment

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Four-valued Logic
Verilog’s nets and registers hold four-valued
data
0 represent a logic zero or false condition
1 represent a logic zero or false condition
z
Output of an undriven tri-state driver –
high-impedance value
Models case where nothing is setting a wire’s value
x
Models when the simulator can’t decide the value –
uninitialized or unknown logic value
Initial state of registers
When a wire is being driven to 0 and 1 simultaneously
Output of a gate with z inputs

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Logic System
Four values: 0, 1, x or X, z or Z // Not case sensitive here
The logic value x denotes an unknown (ambiguous) value
The logic value z denotes a high impedance
Primitives have built-in logic
Simulators describe 4-value logic (see Appendix A in text)
a y
0 1 X Z b

0 0 0 0 0 0 1 x z
a
1 0 1 X X
b x z x z x z x z
X 0 X X X
Z 0 X X X
y x x x

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Number Representation
Format: <size>’<base_format><number>
<size> - decimal specification of number of bits
default is unsized and machine-dependent but at least 32
bits
<base format> - ' followed by arithmetic base of
number
<d> <D> - decimal - default if no <base_format> given
<h> <H> - hexadecimal
<o> <O> - octal
<b> <B> - binary
<number> - value given in base of <base_format>
_ can be used for reading clarity
x, z is automatically extented

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Number Representation
Examples:
6’b010_111 gives 010111
8’b0110 gives 00000110
4’bx01 gives xx01
16’H3AB gives 0000001110101011
24 gives 0…0011000
5’O36 gives 11110
16’Hx gives xxxxxxxxxxxxxxxx
8’hz gives zzzzzzzz

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Value and Number Expressions :
Examples
659 // unsized decimal // underline usage
‘h 837ff // unsized hexadecimal 27_195_000
‘o7460 // unsized octal 16’b0001_0101_0001_1111
4af // illegal syntax 32’h12ab_f001
4’b1001 // 4-bit binary
5’D 3 // 5-bit decimal // X and Z is sign-extended
3’b01x // 3-bit number with
unknown LSB reg [11:0] a;
12’hx // 12-bit unknown initial
8’d -6 // illegal syntax begin
-8’d 6 // phrase as - (8’d6) a = ‘hx; // yields xxx
a = ‘h3x; // yields 03x
a = ‘h0x; // yields 00x
end

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Net Concatenations :
An Easy Way to Group Nets
Module B
Module A
Module C
3‘o7
Representations Meanings
{b[3:0],c[2:0]} {b[3] ,b[2] ,b[1] ,b[0], c[2] ,c[1] ,c[0]}
{a,b[3:0],w,3’b101} {a,b[3] ,b[2] ,b[1] ,b[0],w,1’b1,1’b0,1’b1}
{4{w}} {w,w,w,w}
{b,{3{a,b}}} {b,a,b,a,b,a,b}

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 (excerpts from CIC training course： Verilog_9807.pdf)

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 (excerpts from CIC training course： Verilog_9807.pdf)

all bits are 0 →logic false

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Compiler Directives
`define
`define RAM_SIZE 16
Defining a name and gives a constant value to it.
`include
`include adder.v
Including the entire contents of other verilog source file.
`timescale
`timescale 100ns/1ns
Setting the reference time unit and time precision of
your simulation.

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 System Tasks
$monitor
$monitor ($time,"%d %d %d",address,sinout,cosout);
Displays the values of the argument list whenever any
of the arguments change except $time.
$display
$display ("%d %d %d",address,sinout,cosout);
Prints out the current values of the signals in the
argument list
$finish
$finish
Terminate the simulation

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Gate Level Modeling

Gate Level Modeling

Case Study

Lecture Note on Verilog, Course #90132300, EE, NTU, C.H. Chao

 Gate Level Modeling
Steps
Develope the boolean function of output
Draw the circuit with logic gates/primitives
Connect gates/primitives with net (usually
wire)
HDL: Hardware Description Language
Figure out architecture first, then write code.

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Primitives

Primitives are modules ready to be

instanced
Smallest modeling block for simulator
Verilog build-in primitive gate
and, or, not, buf, xor, nand, nor, xnor
prim_name inst_name( output, in0, in1,.... );
User defined primitive (UDP)
building block defined by designer

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Case Study
1-bit Full Adder
A B

Full
Co Ci
Adder

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Case Study
1-bit Full Adder
co = (a•b) + (b•ci) + (ci•a);

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Case Study
1-bit Full Adder
sum = a b ci

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Case Study
1-bit Full Adder
Full Adder Connection full adder

Instance ins_c from FA_co carry out

Instance ins_s from FA_sum a connection

b
b
co
c
c
a

sum
connection
a
b sum
c

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 RT-Level & Behavioral Level
Modeling

RT-Level & Behavioral Level Modeling

Case Study

Lecture Note on Verilog, Course #90132300, EE, NTU, C.H. Chao

 RT-Level & Behavioral Level
Modeling
High level description
User friendly
Concise code
Faster simulation speed ( event driven )
Widely used for some common operations
+,-,*
&,|,~
Two main formats
always block ( for behavior level )
assign ( for RT level )

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Case Study
1-bit Full Adder
A B

Full
Co Ci
Adder

S
{Co,S} = A + B + Ci

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Case Study
1-bit Full Adder
RT-level modeling of combinational circuit
Describe boolean function with operators and
use continuous assignment assign

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Case Study
1-bit Full Adder
Behavior-level modeling of combinational
circuit:
Use event-driven construct: always block
Event: @( sensitive_list )

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Test bench

Lecture Note on Verilog, Course #90132300, EE, NTU, C.H. Chao

 Test Methodology
Systematically verify the Test bench
functionality of a model.
Simulation: data_i
(1) detect syntax violations in
input ports
source code
(2) simulate behavior
(3) monitor results Design
Top Module

answer_o output ports

Equal? data_o

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Verilog Simulator

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Testbench for Full Adder
module t_full_add();
reg a, b, cin; // for stimulus waveforms
wire sum, c_out;
full_add M1 (sum, c_out, a, b, cin); //DUT
initial #200 $finish; // Stopwatch
initial begin // Stimulus patterns
#10 a = 0; b = 0; cin = 0; // Statements execute in sequence
#10 a = 0; b = 1; cin = 0;
#10 a = 1; b = 0; cin = 0;
#10 a = 1; b = 1; cin = 0;
#10 a = 0; b = 0; cin = 1;
#10 a = 0; b = 1; cin = 1;
#10 a = 1; b = 0; cin = 1;
#10 a = 1; b = 1; cin = 1;
end
endmodule

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Summary
Design module
Gate-level or RT-level
Real hardware
Instance of modules exist all the time
Each module has architecture figure
Plot architecture figures before you write verilog codes
Test bench
Feed input data and compare output values versus
time
Usually behavior level
Not real hardware, just like C/C++

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005
 Note
Verilog is a platform
Support hardware design (design module)
Also support C/C++ like coding (test bench)
How to write verilog well
Know basic concepts and syntax
Get a good reference (a person or some code files)
Form a good coding habit
Naming rule, comments, format partition (assign or always
block)
Hardware
Combinational circuits (today’s topic)
畫圖(architecture), then 連連看(coding)
Sequential circuits (we won’t model them in this course)
register: element to store data

Lecture Note on Verilog, Course #901 32300, EE, NTU C.H. Chao, 11/18/2005