danm v0.1.4 Danm.FiniteStateMachine
A finite state machine is a design entity with a flopped output that represent a state. The next state depend on the current state and various inputs The state transfer graph can be expressed as a following:
[
{:state0, {{condition, next_state},
{condition, next_state},
...},
{:state1, {{condition, next_state},
{condition, next_state},
...},
...
]
each possible state is represented as a atom. conditions are expressions
Link to this section Summary
Functions
A finite state machine has a state transfer graph, a reset clause, a name, clock and width clk is a string of the clock name
create a FSM logic
Link to this section Functions
A finite state machine has a state transfer graph, a reset clause, a name, clock and width clk is a string of the clock name
Link to this function
new(graph, clk, list)
create a FSM logic