CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert...
Transcript of CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert...
![Page 1: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/1.jpg)
Dr. Hao ZhengComp Sci & Eng
U of South Florida
CDA 4253/CIS 6930 FPGA System Design Finite State Machines
![Page 2: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/2.jpg)
2
Outline and Reading
➺Modeling FSMs in VHDL�Mealy and Moore
➺Modeling FSMD in VHDL�Map computation into FSMD
➺Reading – P. Chu, FPGA Prototyping by VHDL Examples� Chapter 5, FSM (skip discussion on ASM)� Chapter 6, FSMD
![Page 3: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/3.jpg)
3
Datapath vs. Controller
![Page 4: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/4.jpg)
4
Structure of a Typical Digital System
Datapath(Execution
Unit)
Controller(Control
Unit)
Data Inputs
Data Outputs
Control & Status Inputs
Control & Status Outputs
Control Signals
StatusSignals
![Page 5: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/5.jpg)
5
Datapath (Execution Unit)�Manipulates and processes data.�Performs arithmetic and logic operations,
shifting/rotating, and other data-processing tasks.�Is composed of registers, multiplexers, adders,
decoders, comparators, ALUs, gates, etc.�Provides all necessary resources and interconnects
among them to perform specified task.�Interprets control signals from the controller and
generates status signals for the controller.
![Page 6: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/6.jpg)
6
Controller (Control Unit)➺ Controls data movement in the datapath by switching
multiplexers and enabling or disabling resourcesExample: enable signals for registersExample: select signals for muxes
➺ Provides signals to activate various processing tasks in the datapath, i.e. +, -, or *, ...
➺Determines the sequence of operations performed by the datapath.
➺ Follows some �program� or schedule.
![Page 7: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/7.jpg)
7
Programmable vs. Non-Programmable Controller
➺ Controller can be programmable or non-programmable➺ Programmable� Has a program counter which points to next instruction� Instructions are stored in a RAM or ROM� Microprocessor is an example of programmable
controller➺ Non-Programmable� Once designed, implements the same functionality� Another term is a �hardwired state machine,� or �hardwired FSM,� or �hardwired instructions�
� In this course we will be focusing on non-programmable controllers.
![Page 8: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/8.jpg)
8
Finite State Machines➺ Controllers can be described as Finite State Machines
(FSMs)� Counters and shift registers are simple FSMs
➺ Finite State Machines can be represented using� State Diagrams and State Tables - suitable for simple
controllers with a relatively few inputs and outputs�Algorithmic State Machine (ASM) ChartsWill be skipped as it is equivalent to state diagrams.
➺All of these descriptions can be easily translated to the corresponding synthesizable VHDL code
![Page 9: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/9.jpg)
Design Process
9
1. Text description2. Define interface3. Describe the functionality using pseudo-code4. Convert pseudo-code to FSM in state diagram
1. Define states and state transitions2. Define datapath operations in each state.
5. Develop VHDL code to implement FSM6. Develop testbench for simulation and debugging7. Implementation and timing simulation
• Timing simulation can reveal more bugs than pre-synthesis simulation
8. Test the implementation on FPGA boards
![Page 10: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/10.jpg)
10
Finite State MachinesRefresher
![Page 11: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/11.jpg)
11
Finite State Machines (FSMs)➺ An FSM is used to model a system that transits among
a finite number of internal states. The transitions depend on the current state and external input.
➺ The main application of an FSM is to act as the controller to a large digital system
➺ Design of FSMs involves� Define states� Define state transitions� Define operations performed in each state� Optimize / minimize FSM
➺ Manual optimization/minimization is practical for small FSMs only.
![Page 12: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/12.jpg)
12
Moore FSM
➺Output is a function of the present state only
Stateregister
Next Statefunction
Outputfunction
Inputs
Present StateNext State
Outputs
clockreset
![Page 13: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/13.jpg)
13
Mealy FSM➺Output is a function of the present state and the inputs.
Next Statefunction
Outputfunction
Inputs
Present StateNext State
Outputs
Stateregister
clockreset
![Page 14: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/14.jpg)
14
State Diagrams
![Page 15: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/15.jpg)
15
Moore Machine
➺State operations: datapath operations including output assignments.
➺Transition conditions: Boolean expressions
transition condition 1
transition condition 2
State 1 /operations
State 2 /operations
![Page 16: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/16.jpg)
16
Mealy Machine
transition condition 1 /datapath operations
transition condition 2 /datapath operations
State 1 State 2
![Page 17: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/17.jpg)
17
Moore FSM – Example 1
➺Moore FSM that recognizes sequence �10�
reset
Meaning of states:
S0: No elements of the sequenceobserved
S1: �1�observed
S2: �10�observed
S0 / 0 S1 / 0 S2 / 11
01
0
0 1
Ex: 0100011101010
![Page 18: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/18.jpg)
18
Mealy FSM – Example 1
➺Mealy FSM that recognizes sequence �10�
S0 S1
0 / 0 1 / 0
1 / 0
0 / 1reset
Meaning of states:
S0: No elements of the sequenceobserved
S1: �1�observed
Ex: 0100011101010
![Page 19: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/19.jpg)
19
Moore & Mealy FSMs – Example 1
clock
input
Moore
Mealy
0 1 0 0 0
S0 S0 S1 S2 S0 S0
S0 S0 S1 S0 S0 S0
state
output
state
output
![Page 20: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/20.jpg)
20
Moore vs. Mealy FSM (1)
➺Moore and Mealy FSMs are functionally equivalent.� Equivalent Mealy FSM can be derived from Moore
FSM and vice versa.
➺Mealy FSM usually requires less number of states� Smaller circuit area.
![Page 21: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/21.jpg)
21
Moore vs. Mealy FSM (2)
➺Mealy FSM computes outputs as soon as inputs change.�Mealy FSM responds to inputs one clock cycle sooner
than equivalent Moore FSM.� There are direct paths from inputs to outputs – can
cause output glitches.
➺Moore FSM has no combinational path between inputs and outputs.� Less likely to affect the critical path of the entire
circuit.
![Page 22: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/22.jpg)
22
Which Way to Go?
Safer.Less likely to affect
the critical path.
Mealy FSM Moore FSM
Lower Area
Responds one clockcycle earlier
Fewer states
![Page 23: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/23.jpg)
23
Finite State Machinesin VHDL
![Page 24: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/24.jpg)
24
FSMs in VHDL
➺Finite State Machines can be easily described with processes.
➺Synthesis tools understand FSM description if certain rules are followed.� State transitions should be described in a process
sensitive to clock and asynchronous reset signals only.
�Output function described using rules for combinational logic, i.e. as concurrent statements or a process with all inputs and state variables in the sensitivity list.
![Page 25: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/25.jpg)
25
Moore FSM
StateRegister
Next Statefunction
Outputfunction
Inputs
Present State
Next State
Outputs
process(clock, reset)
concurrent statements
clockreset
![Page 26: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/26.jpg)
26
Mealy FSM
Next Statefunction
Outputfunction
Inputs
Present StateNext State
Outputs
StateRegister
process(clock, reset)
concurrent statements
clockreset
![Page 27: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/27.jpg)
27
Moore FSM - Example 1
➺Moore FSM that Recognizes Sequence �10�
S0 / 0 S1 / 0 S2 / 1
0
0
0
1
11
reset
![Page 28: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/28.jpg)
28
Moore FSM in VHDL (1)architecture ...
type state_type is (S0, S1, S2); -- enumeration typesignal state: state_type;
begin
U_Moore: process(clock, reset)
begin
if (reset = �1�) then
state <= S0;
elsif rising_edge(clock) then
case state is
when S0 =>
if input = �1� then
state <= S1;
else
state <= S0;
end if;
S0 / 0 S1 / 0
0
1
next state logic
reset
![Page 29: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/29.jpg)
29
Moore FSM in VHDL (2) – cont’d when S1 =>
if input = �0� thenstate <= S2;
elsestate <= S1;
end if;when S2 =>
if input = �0� thenstate <= S0;
else state <= S1;
end if;end case;
end if;end process;
-- output functionOutput <= �1� when state = S2 else
�0�;
next state logic
![Page 30: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/30.jpg)
30
Mealy FSM - Example 1
➺Mealy FSM that Recognizes Sequence �10�.
S0 S1
0 / 01 / 0 1 / 0
0 / 1reset
![Page 31: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/31.jpg)
31
Mealy FSM in VHDL (1)architecture ...
type state_type is (S0, S1);
signal Mealy_state: state_type;
begin
U_Mealy: process (clock, reset)
begin
if (reset = �1�) then
Mealy_state <= S0;
elsif rising_edge(clock) then
case Mealy_state is
when S0 =>
if input = �1� then
Mealy_state <= S1;
else
Mealy_state <= S0;
end if;
next state logic
![Page 32: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/32.jpg)
32
Mealy FSM in VHDL (2)when S1 =>
if input = �0� then
Mealy_state <= S0; else
Mealy_state <= S1;end if;
end case;end if;
end process;
-- output functionOutput <= �1� when (Mealy_state=S1 and input = �0�) else
�0�;end architecture;
next state logic
What would happen if output logic is merged with next state logic?
![Page 33: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/33.jpg)
33
Generalized FSM
Based on RTL Hardware Design by P. Chu
![Page 34: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/34.jpg)
Case Study 1A Simple Communication Protocol
![Page 35: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/35.jpg)
35
Inter-Component Communication
Master Slave
How does master transfer information to slave if they operate at different speeds?
![Page 36: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/36.jpg)
36
Inter-Component Communication
Master Slave
How does master transfer information to slave if they operate at different speeds?
Valid
![Page 37: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/37.jpg)
37
Communication Protocol
Master Slave
Valid
Ready
Valid
Ready
![Page 38: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/38.jpg)
38
Communication Protocol – Master
Valid
Ready
M0/valid=0 M1/Valid=1
Ready = 1
Whenever data output is valid
![Page 39: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/39.jpg)
39
Communication Protocol – Slave
Valid
Ready
S0/ready=0 S1/Ready=1
Valid = 1
When ready to accept data input
![Page 40: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/40.jpg)
40
Case Study 2Fibonacci Number
(section 6.3.1, Chu’s book)
![Page 41: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/41.jpg)
41
Fibonacci Number
fib(i) =
8<
:
01fib(i� 1) + fib(i� 2)
if i = 0if i = 1
ex. 0, 1, 1, 2, 3, 5, 8, 13, . . .
![Page 42: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/42.jpg)
42
Fibonacci Number – cont’d
idle/done <= ‘0’
done/done <= ‘1’
f <= t1
op/t1 <= t1+t0t0 <= t1n <= n-1
n=0
n/=1
start: start the operationdone: result is availablen: number of iterationsf: outputt0: register holding fib(i-2)t1: register holding fib(i-1)
start=‘1’
![Page 43: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/43.jpg)
43
Case Study 3Binary Division
(Section 6.3.2, Chu’s Book)
![Page 44: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/44.jpg)
44
Binary Division144 FSMD
rh
divisor
0 0 11 0 - quotient 0 0 1 0 1 0 0 0 0 1 10 1 - dividend
0000 0001 0000 0011
rI
Figure 6.10 Long division of two 4-bit unsigned integers.
Figure 6.11 Sketch of division circuit’s data path.
be summarized as follows: 1. Double the dividend width by appending 0’s in front and align the divisor to the
leftmost bit of the extended dividend. 2. If the corresponding dividend bits are greater than or equal to the divisor, subtract the
divisor from the dividend bits and make the corresponding quotient bit 1. Otherwise, keep the original dividend bits and make the quotient bit 0.
3. Append one additional dividend bit to the previous result and shift the divisor to the right one position.
4. Repeat steps 2 and 3 until all dividend bits are used. The sketch of the data path is shown in Figure 6.11. Initially, the divisor is stored in the
d register and the extended dividend is stored in the rh and rl registers. In each iteration, the rh and rl registers are shifted to the left one position. This corresponds to shifting the divisor to the right of the previous algorithm. We can then compare rh and d and perform subtraction if r h is greater than or equal to d. When r h and rl are shifted to the left, the rightmost bit of rl becomes available. It can be used to store the current quotient bit. After
![Page 45: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/45.jpg)
45
Binary Division Algorithm
1. Double the dividend width by appending ‘0’ to its left.
2. Align the divisor – double its width by appending ‘0’ to its right.
3. If dividend >= divisor, subtract divisor from dividend, and left shift ‘1’ into quotient. Otherwise, left shift ‘0’ into quotient.
4. Right shift divisor one position.5. Repeat 3 and 4 until the remaining dividend is
less than divisor.
![Page 46: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/46.jpg)
46
Binary Division Algorithm1101 / 0010 = ?
Dividend Divisor Quotient
00001101 00100000 align divisor
00001101 00010000 0 right shift divisor
00001101 00001000 00 right shift divisor
00000101 00000100 001 dividend – divisorright shift divisor
00000001 00000010 0011 dividend – divisorright shift divisor
00000001 00000010 00110 dividend < divisorterminate
![Page 47: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/47.jpg)
47
Binary Division Algorithm – FSM
![Page 48: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/48.jpg)
Case Study 4Debouncing Circuit
![Page 49: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/49.jpg)
Original & Debounced Inputs DESIGN EXAMPLES 11 9
original switch output
bounces bounces (last less than 20 ms) (last less than 20 ms)
- -
- - -
L 20 ms- debounced output (scheme 1) *Oms I
I , 20ms debounced output
(scheme 2)
20 ms - ;
Figure 5.8 Original and debounced waveforms.
Figure 5.9 State diagram of a debouncing circuit.
![Page 50: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/50.jpg)
50
DESIGN EXAMPLES 11 9
original switch output
bounces bounces (last less than 20 ms) (last less than 20 ms)
- -
- - -
L 20 ms- debounced output (scheme 1) *Oms I
I , 20ms debounced output
(scheme 2)
20 ms - ;
Figure 5.8 Original and debounced waveforms.
Figure 5.9 State diagram of a debouncing circuit.
sw: input from slide switches or push buttons.
m_tick: input from a timer with 10ms period.
See listing 5.6 for VHDL code that implements this FSM
Debouncing Circuit – Scheme 1
![Page 51: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/51.jpg)
Debouncing Circuit – Scheme 1
DESIGN EXAMPLES 11 9
original switch output
bounces bounces (last less than 20 ms) (last less than 20 ms)
- -
- - -
L 20 ms- debounced output (scheme 1) *Oms I
I , 20ms debounced output
(scheme 2)
20 ms - ;
Figure 5.8 Original and debounced waveforms.
Figure 5.9 State diagram of a debouncing circuit.
sw: input from slide switches or push buttons.
m_tick: input from a timer with 10ms period.
See listing 5.6 for VHDL code that implements this FSM
sw.m_tick
![Page 52: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/52.jpg)
Debouncing Testing Circuit
122 FSM
- - btn(1) level tick - en q - > detector
edge counter > 4- hex0 sseg sseg - hex1 an - an
95
sw db - level tick -
> debouncing edge clk - > detector
105
en 9 disp-mux-hex counter
> reset
I10
Figure 5.10 Debouncing testing circuit.
end i f ; when w a i t 0 - 2 = >
db < = ’ I > ; i f s w = ’ 1 ’ then
e l s e s t a t e - n e x t <= o n e ;
i f m - t i c k = ’ l J then
end i f ; s t a t e - n e x t <= w a i t 0 - 3 ;
end i f ; when w a i t 0 - 3 = >
db < = ’ I > ; i f s w = ’ 1 ’ then
e l s e s t a t e - n e x t <= o n e ;
i f m - t i c k = ’ l ’ then
end i f ; s t a t e - n e x t <= z e r o ;
end i f ; end c a s e ;
end p r o c e s s ; 11s end a r c h ;
5.3.3 Testing circuit
We use a bounce counting circuit to verify operation of the rising-edge detector and the debouncing circuit. The block diagram is shown in Figure 5.10. The input of the verification circuit is from a pushbutton switch. In the lower part, the signal is first fed to the debouncing circuit and then to the rising-edge detector. Therefore, a one-clock-cycle tick is generated each time the button is pressed and released. The tick in turn controls the enable input of an 8-bit counter, whose content is passed to the LED time-multiplexing circuit and shown on the left two digits of the prototyping board’s seven-segment LED display. In the upper part, the input signal is fed directly to the edge detector without the debouncing circuit, and the number is shown on the right two digits of the prototyping board’s seven-segment LED display. The bottom counter thus counts one desired 0-to- 1 transition as well as the bounces.
![Page 53: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/53.jpg)
Debouncing Circuit – Exercise
sw: input from slide switches or push buttons.
tick_20ms: input from a timer with 20ms period.
timer can be controller by swinput.
Re-design the debouncer using a 20ms timer
![Page 54: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/54.jpg)
Loop Statements
![Page 55: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/55.jpg)
55
For-Loop Statements
– – Count number of ‘0’ in the inputlibrary ieee; use ieee.std_logic_1164.all; use ieee.std_logic_unsigned.all;
entity countzeros is
port(a : in std_logic_vector(7 downto 0);
Count : out std_logic_vector(2 downto 0)
);
end countzeros;
![Page 56: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/56.jpg)
56
architecture behavior of countzeros is
signal zeros: std_logic_vector(2 downto 0);
begin
process (a, zeros)
begin
zeros <= "000";
for i in 7 downto 0 loop -- bounds must
if (a(i) = ’0’) then -- be constants
zeros <= zeros + 1;
end if;
end loop;
Count <= zeros;
end process;
end behavior;
![Page 57: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/57.jpg)
57
Combinational loop
![Page 58: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/58.jpg)
58
Another Example
shreg <= shreg (6 downto 0) & SI;
for i in 0 to 6 loop
shreg(i+1) <= shreg(i);
end loop;
shreg(0) <= SI;
![Page 59: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/59.jpg)
59
Another Example
for i in 0 to 6 loop
shreg(i+1) <= shreg(i);
end loop;
for i in 0 to 6 loop
shreg(1) <= shreg(1);
…
shreg(7) <= shreg(7);
end loop;
![Page 60: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/60.jpg)
60
While Loop Statementprocess (A)
variable I : integer range 0 to 4;
begin
Z <= "0000";
I := 0;
while (I <= 3) loop
if (A = I) then
Z(I) <= '1';
end if;
I := I + 1;
end loop;
end process;
![Page 61: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/61.jpg)
Alternative Coding Stylesby Dr. Chu
(to be used with caution)
![Page 62: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/62.jpg)
Traditional Coding Style
StateRegister
Next Statefunction
Moore Outputfunction
Inputs
Present State
Next State
clockreset
process(clock, reset)
concurrent statements
Mealy Outputfunction
Mealy Outputs Moore Outputs
![Page 63: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/63.jpg)
Alternative Coding Style 1
StateRegister
Next Statefunction
Moore Outputfunction
Inputs
Present State
Next State
clockreset
Process(Present State, Inputs)
Mealy Outputfunction
Mealy Outputs Moore Outputs
Process(clock, reset)
Process(Present State)Process(Present State, Inputs)
![Page 64: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/64.jpg)
Alternative Coding Style 2
Process(clk, reset)
Process(Present State,Inputs)
![Page 65: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/65.jpg)
Backup
![Page 66: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/66.jpg)
66
Hardware Design with RTL VHDL
Pseudocode
Datapath Controller
Blockdiagram
Blockdiagram
State diagramor ASM chart
VHDL code VHDL code VHDL code
Interface
![Page 67: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/67.jpg)
67
Algorithmic State Machine (ASM)Charts
![Page 68: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/68.jpg)
68
Algorithmic State Machine
Algorithmic State Machine –representation of a Finite State Machine suitable for FSMs with a larger number of inputs and outputs compared to FSMs expressed using state diagrams and state tables.
![Page 69: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/69.jpg)
69
Elements used in ASM charts (1)
Output signalsor actions
(Moore type)
State name
Condition expression
0 (False) 1 (True)
Conditional outputs or actions (Mealy type)
(a) State box (b) Decision box
(c) Conditional output box
![Page 70: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/70.jpg)
70
State Box➺ A state box represents a state.➺ Equivalent to a node in a state diagram or
a row in a state table.➺ Contains register transfer actions or output
signals➺ Moore-type outputs are listed inside of
the box.➺ It is customary to write only the name of
the signal that has to be asserted in the given state, e.g., z instead of z<=1.
➺ Also, it might be useful to write an action to be taken, e.g., count <= count + 1, and only later translate it to asserting a control signal that causes a given action to take place (e.g., enable signal of a counter).
Output signalsor actions
(Moore type)
State name
![Page 71: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/71.jpg)
71
Decision Box
➺A decision box indicates that a given condition is to be tested and the exit path is to be chosen accordingly.
➺The condition expression may include one or more inputs to the FSM.
Condition expression
0 (False) 1 (True)
![Page 72: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/72.jpg)
72
Conditional Output Box
➺A conditional output box denotes output signals that are of the Mealy type.
➺The condition that determines whether such outputs are generated is specified in the decision box.
Conditional outputs or actions (Mealy type)
![Page 73: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/73.jpg)
73
ASMs Representing Simple FSMs
➺Algorithmic state machines can model both Mealy and Moore Finite State Machines
➺They can also model machines that are of the mixed type.
![Page 74: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/74.jpg)
74
Moore FSM – Example 2: State diagram
C z 1 = ⁄
Reset
B z 0 = ⁄ A z 0 = ⁄ w 0 =
w 1 =
w 1 =
w 0 =
w 0 = w 1 =
![Page 75: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/75.jpg)
75
Present Next state Output
state w = 0 w = 1 z
A A B 0
B A C 0
C A C 1
Moore FSM – Example 2: State Table
![Page 76: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/76.jpg)
76
w
w
w 0 1
0
1
0
1
A
B
C
z
Reset
w
w
w 0 1
0
1
0
1
A
B
C
z
Reset
ASM Chart for Moore FSM – Example 2
![Page 77: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/77.jpg)
77
entity simple isport( clock : in STD_LOGIC;
resetn : in STD_LOGIC;w : in STD_LOGIC;z : out STD_LOGIC);
end simple ;
architecture Behavior of simple is type State_type IS (A, B, C) ;signal state : State_type ;
beginprocess( resetn, clock )begin
if resetn = '0' thenstate <= A ;
elsif rising_edge(Clock) then
Example 2: VHDL Code (1)
![Page 78: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/78.jpg)
78
case state is when A =>
if w = '0' thenstate <= A ;
else
state <= B ;end if;
when B =>if w = '0' then
state <= A ;else
state <= C ;end if;
when C =>if w = '0' then
state <= A ;else
state <= C ;end if;
end case;
Example 2: VHDL Code (2)
w
w
w 0 1
0
1
0
1
A
B
C
z
Reset
w
w
w 0 1
0
1
0
1
A
B
C
z
Reset
![Page 79: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/79.jpg)
79
Example 2: VHDL Code (3)
END IF;
END PROCESS;
z <= '1' when state = C else
'0’;
END Behavior;
w
w
w 0 1
0
1
0
1
A
B
C
z
Reset
w
w
w 0 1
0
1
0
1
A
B
C
z
Reset
![Page 80: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/80.jpg)
80
A
w 0 = z 0 = ⁄ w 1 = z 1 = ⁄
B
w 0 = z 0 = ⁄
Reset w 1 = z 0 = ⁄
Mealy FSM – Example 3: State Diagram
![Page 81: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/81.jpg)
81
ASM Chart for Mealy FSM – Example 3
w
w 0 1
0
1
A
B
R e s e t
z
A
w 0 = z 0 = ⁄ w 1 = z 1 = ⁄
B
w 0 = z 0 = ⁄
Reset w 1 = z 0 = ⁄
![Page 82: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/82.jpg)
82
entity Mealy isPORT ( clock : IN STD_LOGIC;
resetn : IN STD_LOGIC;w : IN STD_LOGIC;z : OUT STD_LOGIC);
end Mealy;
architecture Behavior of Mealy istype State_type is (A, B) ;signal state: State_type ;
beginprocess (resetn, clock)begin
if resetn = '0' thenstate<= A ;
elsif rising_edge(clock) then
Example 3: VHDL Code (1)
![Page 83: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/83.jpg)
83
Example 3: VHDL Code (2)case state is
when A =>if w = '0' then
state<= A ;else
state<= B ;end if;
when B =>if w = '0' then
state<= A ;else
state<= B ;end if;
end case;
end if;
end process;
A
w 0 = z 0 = ⁄ w 1 = z 1 = ⁄
B
w 0 = z 0 = ⁄
Reset w 1 = z 0 = ⁄
![Page 84: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/84.jpg)
84
Example 3: VHDL Code (3)
z <= '1' when (y = B) and (w=‘1’) else
'0’;
end architecture Behavior ;
A
w 0 = z 0 = ⁄ w 1 = z 1 = ⁄
B
w 0 = z 0 = ⁄
Reset w 1 = z 0 = ⁄
![Page 85: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/85.jpg)
Case Study 1Arbiter
![Page 86: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/86.jpg)
Arbiter – Interface
Arbiter
reset
r1
r2
r3
g1
g2
g3
clock
![Page 87: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/87.jpg)
r 1 r 2
r 1 r 2 r 3
Idle
Reset
gnt1 g 1 ⁄ 1 =
gnt2 g 2 ⁄ 1 =
gnt3 g 3 ⁄ 1 =
r 1 r 1
r 1
r 2
r 3
r 2
r 3
r 1 r 2 r 3
r 1 r 2
r 1 r 2 r 3
Idle
Reset
gnt1 g 1 ⁄ 1 =
gnt2 g 2 ⁄ 1 =
gnt3 g 3 ⁄ 1 =
r 1 r 1
r 1
r 2
r 3
r 2
r 3
r 1 r 2 r 3
Arbiter – FSM
![Page 88: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/88.jpg)
88
ENTITY arbiter IS
PORT(Clock, Resetn : IN STD_LOGIC ;
r : IN STD_LOGIC_VECTOR(1 TO 3);
g : OUT STD_LOGIC_VECTOR(1 TO 3));
END arbiter;
ARCHITECTURE Behavior OF arbiter IS
TYPE State_type IS (Idle, gnt1, gnt2, gnt3);
SIGNAL state: State_type;
begin
Arbiter – VHDL Code
![Page 89: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/89.jpg)
89
PROCESS(Resetn, Clock)
BEGIN
IF Resetn = '0' THEN
state <= Idle ;
ELSIF (Clock'EVENT AND Clock = '1') THEN
CASE state IS
WHEN Idle =>
IF r(1) = '1' THEN state <= gnt1 ;
ELSIF r(2) = '1' THEN state <= gnt2 ;
ELSIF r(3) = '1' THEN state <= gnt3 ;
ELSE state <= Idle ;
END IF ;
WHEN gnt1 =>
IF r(1) = '1' THEN state <= gnt1 ;
ELSE state <= Idle ;
END IF ;
-- continue on the next slide
Arbiter – VHDL Code (cont’d)
![Page 90: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/90.jpg)
90
WHEN gnt2 =>
IF r(2) = '1' THEN state <= gnt2 ;
ELSE state <= Idle ;
END IF ;
WHEN gnt3 =>
IF r(3) = '1' THEN state <= gnt3 ;
ELSE state <= Idle ;
END IF ;
END CASE ;
END IF ;
END PROCESS ;
-- continue on the next slide
Arbiter – VHDL Code (cont’d)
![Page 91: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/91.jpg)
91
-- output function
g(1) <= '1' WHEN state = gnt1 ELSE
'0’;
g(2) <= '1' WHEN state = gnt2 ELSE
'0’;
g(3) <= '1' WHEN state = gnt3 ELSE
'0’;
END architecture Behavior ;
Arbiter – VHDL Code (cont’d)
![Page 92: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/92.jpg)
92
Control Unit Example: Arbiter (1)
Arbiter
reset
r1
r2
r3
g1
g2
g3
clock
![Page 93: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/93.jpg)
93
Idle
000
1--
Reset
gnt1 g 1 ⁄ 1 =
-1-
gnt2 g 2 ⁄ 1 =
--1
gnt3 g 3 ⁄ 1 =
0-- 1--
01--0-
001 --0
Control Unit Example: Arbiter (2)
![Page 94: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/94.jpg)
94
r 1 r 2
r 1 r 2 r 3
Idle
Reset
gnt1 g 1 ⁄ 1 =
gnt2 g 2 ⁄ 1 =
gnt3 g 3 ⁄ 1 =
r 1 r 1
r 1
r 2
r 3
r 2
r 3
r 1 r 2 r 3
r 1 r 2
r 1 r 2 r 3
Idle
Reset
gnt1 g 1 ⁄ 1 =
gnt2 g 2 ⁄ 1 =
gnt3 g 3 ⁄ 1 =
r 1 r 1
r 1
r 2
r 3
r 2
r 3
r 1 r 2 r 3
Control Unit Example: Arbiter (3)
![Page 95: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/95.jpg)
95
ASM Chart for Control Unit - Example 4
r 1
r 3 0 1
1
Idle
Reset
r 2
r 1
r 3
r 2
gnt1
gnt2
gnt3
1
1
1
0
0
0
g 1
g 2
g 3
0
0
1
r 1
r 3 0 1
1
Idle
Reset
r 2
r 1
r 3
r 2
gnt1
gnt2
gnt3
1
1
1
0
0
0
g 1
g 2
g 3
0
0
1
![Page 96: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/96.jpg)
96
Example 4: VHDL Code (1)
ENTITY arbiter IS
PORT(Clock, Resetn : IN STD_LOGIC ;
r : IN STD_LOGIC_VECTOR(1 TO 3);
g : OUT STD_LOGIC_VECTOR(1 TO 3));
END arbiter;
ARCHITECTURE Behavior OF arbiter IS
TYPE State_type IS (Idle, gnt1, gnt2, gnt3);
SIGNAL state: State_type;
begin
![Page 97: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/97.jpg)
97
Example 4: VHDL code (2)PROCESS(Resetn, Clock)
BEGIN
IF Resetn = '0' THEN
state <= Idle ;
ELSIF (Clock'EVENT AND Clock = '1') THEN
CASE state IS
WHEN Idle =>
IF r(1) = '1' THEN state <= gnt1 ;
ELSIF r(2) = '1' THEN state <= gnt2 ;
ELSIF r(3) = '1' THEN state <= gnt3 ;
ELSE state <= Idle ;
END IF ;
WHEN gnt1 =>
IF r(1) = '1' THEN state <= gnt1 ;
ELSE state <= Idle ;
END IF ;
-- continue on the next slide
![Page 98: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/98.jpg)
98
Example 4: VHDL code (3)WHEN gnt2 =>
IF r(2) = '1' THEN state <= gnt2 ;
ELSE state <= Idle ;
END IF ;
WHEN gnt3 =>
IF r(3) = '1' THEN state <= gnt3 ;
ELSE state <= Idle ;
END IF ;
END CASE ;
END IF ;
END PROCESS ;
-- continue on the next slide
![Page 99: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/99.jpg)
99
Example 4: VHDL code (3)g(1) <= '1' WHEN y = gnt1 ELSE
'0’;
g(2) <= '1' WHEN y = gnt2 ELSE
'0’;
g(3) <= '1' WHEN y = gnt3 ELSE
'0’;
END architecture Behavior ;
![Page 100: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/100.jpg)
100
ASM Summary• ASM (algorithmic state machine) chart
– Flowchart-like diagram
– Provides the same info as a state diagram– More descriptive, better for complex description
– ASM block• One state box• One or more optional decision boxes:
with T (1) or F (0) exit path• One or more conditional output boxes:
for Mealy output
![Page 101: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/101.jpg)
101
![Page 102: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/102.jpg)
ASM Chart Rules
Based on RTL Hardware Design by P. Chu
• Difference between a regular flowchart
and an ASM chart:
– Transition governed by clock
– Transition occurs between ASM blocks
• Basic rules:
– For a given input combination, there is one
unique exit path from the current ASM block
– Any closed loop in an ASM chart must
include a state box
![Page 103: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/103.jpg)
Incorrect ASM Charts
Based on RTL Hardware Design by P. Chu
![Page 104: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/104.jpg)
Alternative Coding Stylesby Dr. Chu
(to be used with caution)
![Page 105: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/105.jpg)
Traditional Coding Style
StateRegister
Next Statefunction
Moore Outputfunction
Inputs
Present State
Next State
clockreset
process(clock, reset)
concurrent statements
Mealy Outputfunction
Mealy Outputs Moore Outputs
![Page 106: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/106.jpg)
Alternative Coding Style 1
StateRegister
Next Statefunction
Moore Outputfunction
Inputs
Present State
Next State
clockreset
Process(Present State, Inputs)
Mealy Outputfunction
Mealy Outputs Moore Outputs
Process(clock, reset)
Process(Present State)Process(Present State, Inputs)
![Page 107: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/107.jpg)
107
Next state logic depends on mem, rw, and burst.
Moore output: re and we.
Mealy output: we_me that depends on mem and rw.
![Page 108: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/108.jpg)
108
![Page 109: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/109.jpg)
109
Next state logic depends on mem, rw, and burst.
![Page 110: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/110.jpg)
110
Moore output: re and we.
![Page 111: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/111.jpg)
111
Mealy output: we_me that depends on mem and rw.
![Page 112: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/112.jpg)
Alternative Coding Style 2
Process(clk, reset)
Process(Present State,Inputs)
![Page 113: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/113.jpg)
113
![Page 114: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/114.jpg)
114
![Page 115: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/115.jpg)
115
![Page 116: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/116.jpg)
116
VHDL Variables
![Page 117: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/117.jpg)
Chapter 3: VHDL Support
Signal Assignment in a Process VHDL Coding Example---- Signal assignment in a process---- Download: http://www.xilinx.com/txpatches/pub/documentation/misc/xstug_examples.zip-- File: VHDL_Language_Support/signals_variables/signal_in_process.vhd--entity signal_in_process is
port (A, B : in BIT;S : out BIT );
end signal_in_process;
architecture archi of signal_in_process isbegin
process (A, B)begin
S <= ’0’ ;if ((A and B) = ’1’) then
S <= ’1’ ;end if;
end process;end archi;
Variable and Signal Assignment in a Process VHDL Coding Example---- Variable and signal assignment in a process---- Download: http://www.xilinx.com/txpatches/pub/documentation/misc/xstug_examples.zip-- File: VHDL_Language_Support/signals_variables/variable_in_process.vhd--library ieee;use ieee.std_logic_1164.all;use ieee.std_logic_arith.all;use ieee.std_logic_unsigned.all;
entity variable_in_process isport (
A,B : in std_logic_vector (3 downto 0);ADD_SUB : in std_logic;S : out std_logic_vector (3 downto 0) );
end variable_in_process;
architecture archi of variable_in_process isbegin
process (A, B, ADD_SUB)variable AUX : std_logic_vector (3 downto 0);
beginif ADD_SUB = ’1’ then
AUX := A + B ;else
AUX := A - B ;end if;S <= AUX;
end process;end archi;
VHDL If-Else Statementsif-else and if-elsif-else statements use true-false conditions to execute statements.
• If the expression evaluates to true, the if branch is executed.
• If the expression evaluates to false, x, or z, the else branch is executed.
• A block of multiple statements is executed in an if or else branch.
• begin and end keywords are required.
• if-else statements can be nested.
XST User Guide for Virtex-6, Spartan-6, and 7 Series DevicesUG687 (v 14.5) March 20, 2013 www.xilinx.com 47
Send Feedback
![Page 118: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/118.jpg)
Differences: Signals vs Variables• Variables can only be declared and used within
processes or procedures.- Used to hold temporary results.
• Signals can only be declared in architecture.- Used for inter-process communications.
• Variables are updated immediately.• Signals are updated after current execution of a
process is finished.• Synthesis results:- Variables: wires or nothing- Signals: wires, registers, or latches.
![Page 119: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/119.jpg)
Differences: Signals vs Variablesarchitecture var_ex of test isbegin
process (clk)
variable out3 : std_logic;
beginif rising_edge(clk) then
out3 := a and b;
out4 <= out3 xor c;
end if;
end process;
end var_ex;AND
XOR
abc
FF
out3
out4
![Page 120: CDA 4253/CIS 6930 FPGA System Designhaozheng/teach/cda4253/slides/vhdl-4.pdf · 4.Convert pseudo-code to FSM in state diagram 1.Define states and state transitions 2.Define datapathoperations](https://reader034.fdocuments.net/reader034/viewer/2022042805/5f5d240521ece70379740b5a/html5/thumbnails/120.jpg)
Differences: Signals vs Variables
architecture sig_ex of test is
signal out1, out2 : std_logic;
beginprocess (clk)
begin
if rising_edge(clk) then
out1 <= a and b;
out2 <= out1 xor c;
end if;
end process;
end sig_ex;
FF
FF
AND
XOR
ab
c
out1
out2