Scribd
Upload
45 views14 pages

VHDL State Machines: 0

This document provides information on representing state machines in VHDL. It discusses representing state machines as a two dimensional array, as a set of excitation equations, or most commonly as a case statement. It then provides an example of a VHDL state machine code listing with processes to handle the current and next states, and outputs depending on the current state.

Uploaded by

mahe111
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
45 views14 pages

VHDL State Machines: 0

This document provides information on representing state machines in VHDL. It discusses representing state machines as a two dimensional array, as a set of excitation equations, or most commonly as a case statement. It then provides an example of a VHDL state machine code listing with processes to handle the current and next states, and outputs depending on the current state.

Uploaded by

mahe111
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

VHDL State Machines : 0

State machines can be represented in several ways.

As a two dimensional array

as a set of excitation equations (dataflow)

and most commonly

as a ’case statement’

which is probably the easiest.


architecture ....
type state_type is (s0, s1 )
signal current, next_ : state_type

begin
states : process( sensitivity list)
begin
case current is
when
... s0 => next_ <= s1;
end case;
end process;

ticker : process(clk)
begin
if (rising_edge(clk)) then
current <= next_;
end if;
end process;

end ;
VHDL State Machines : 2

entity controller is

port (
car : in bit;
timed : in bit;
clk : in bit;
reset : in bit;
timer_run : out bit;
minor_green : out bit;
major_green : out bit);

end controller;
VHDL State Machines : 3

architecture state_machine of controller is

type state_type is (green, red);

-- pragma CLOCK clk


-- pragma CURRENT_STATE current_state
-- pragma NEXT_STATE next_state

signal current_state : state_type;


signal next_state : state_type;
VHDL State Machines : 4

begin -- state_machine

state_comb : process(current_state,
car, timed)
begin
if (reset = ’0’) then

next_state <= green;


minor_green <= ’0’;
major_green <= ’1’;

else
VHDL State Machines : 5
case current_state is

when green =>


major_green <= ’1’;
minor_green <= ’0’;
if (car = ’1’) then
next_state <= red;
timer_run <= ’1’;
else
next_state <= green;
end if;
VHDL State Machines : 6

when red =>


major_green <= ’0’;
minor_green <= ’1’;
if (timed = ’1’) then
next_state <= green;
else
next_state <= red;
end if;
when others => null
end case;
end if;
end process state_comb;
VHDL State Machines : 7

process(clk)

begin

if (clk = ’0’ and not clk’stable) then


current_state <= next_state;
end if;

end process;

end state_machine;
Algorithmic State Machines : 0

I
00

oe <= 0
we <= 0

0
ready

1
D 11

oe <= 0
we <= 0

0 1
read_write

W 10 R 01

oe <= 0 oe <= 1
we <= 1 we <= 0

0 0
ready ready

1 1

A typical ASM diagram.


Algorithmic State Machines : symbols

Basic state symbol. Decision symbol


state name
encoding
M_G
010
0 1
read_write
register op. R <= 0
output start
condition

exit path exit path


(false) (true)

Conditional symbol
exit path or decision box

register op.
major_green
output
Algorithmic State Machines : outputs
conditional output unconditional output
A A

Z Z

1 1
C C
B2
0 0
Y
Y

B B

W W

Y is dependent on C. Y asserted if state


Asserted if C is B2 entered
true or becomes true.
Algorithmic State Machines : outputs 2

CLK CLK

Z Z

Y, C=1 Y, C=1

Y, C=0 W, C=1

W Y, C=0

W, C=0
C tested
Timing diagram for
the conditional C tested
output Y. State dependent output
Y
VHDL: monitoring state.

in vdd B;
in vss B;;
in reset B;;
in clk B;;
in read_write B;
in ready B;;
out oe B;;
out we B;
register rw_buf_x.controller_current_state(1 downto 0) B;

begin

< 0 ns > init : 10 0 0 0 0 * * **;


< +2ns > : 10 0 0 0 0 * * **;
< +2ns > : 10 0 1 0 0 * * **;
Algorithmic State Machines : outputs
syf -aEV rw_buf_x rw_buf_x

ARCHITECTURE VBE OF rw_buf_x IS

SIGNAL controller_current_state : REG_VECTOR(1 DOWNTO 0) REGISTER;

SIGNAL controller_current_state_wrte : BIT -- controller_current_state_wrte

SIGNAL controller_next_state_wrte : BIT; -- controller_next_state_wrte

SIGNAL controller_current_state_rd : BIT; -- controller_current_state_rd

# Encoding figure "controller"


-controller a 2
wrte 2
rd 1
decision 3
idle 0

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy