2006
DOI: 10.1117/12.714537
|View full text |Cite
|
Sign up to set email alerts
|

<title>Modelling and synthesis of automata in HDLs</title>

Abstract: In the paper digital modelling and synthesis of automata in Hardware Description Languages is described. There is presented different kinds of automata and methods of realization using languages like VHDL and Verilog. Basic models for control units are: Finite State Machine (FSM), Algorithmic State Machine (ASM) and Linked State Machine (LSM). FSM, ASM and LSM can be represented graphically, which would help a designer to visualize and design in a more efficient way. On the other hand, a designer needs a fast … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2006
2006
2013
2013

Publication Types

Select...
2
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 0 publications
0
4
0
Order By: Relevance
“…However, in the presented method synchronization of the concurrent processes is realized by the additional signals as transition conditions. Implementation of decomposed Petri nets onto set of SM-components can be carried out in different methods [6]. In the presented paper a modeling of automata in Verilog is focused.…”
Section: Verilog Modeling and Synthesismentioning
confidence: 99%
“…However, in the presented method synchronization of the concurrent processes is realized by the additional signals as transition conditions. Implementation of decomposed Petri nets onto set of SM-components can be carried out in different methods [6]. In the presented paper a modeling of automata in Verilog is focused.…”
Section: Verilog Modeling and Synthesismentioning
confidence: 99%
“…Elements of the mentioned models are shown in Fig. 1; for the details see [9], [12], [13]. In our experiments we have used the Mealy state machines, which are (in a sense) more general than the Moore automata.…”
Section: Finite State Machinesmentioning
confidence: 99%
“…8. Such structure requires less logical blocks (note that it is true only for Mealy FSMs) [13], [14]. Common minimization of two systems of Boolean functions requires (according to the interpretation by Altera Quartus) description of all of them in the same process.…”
Section: Y_assignmentmentioning
confidence: 99%
See 1 more Smart Citation