Design of Embedded Control Systems
DOI: 10.1007/0-387-28327-7_15
|View full text |Cite
|
Sign up to set email alerts
|

Finite State Machine Implementation in FPGAs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
2
0

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 4 publications
1
2
0
Order By: Relevance
“…2. Example of headers KISS2 [4] Due to application of TimeQuest Timing Analyzer from Tools Menu Quartus Altera [7] there was estimated time of performance for hybrid of finite state machine from [1] and [5,6]. The results from Report Fmax Summary are for Auto and One-Hot Encoding -854.7MHz, for Sequential and Minimal Bits 1000 MHz, .Johnson and Gray encoding 1001 MHz, which partially coincide with results from [2].…”
Section: Using Benchmark Tests For Compare Speed Of Performance For Different State Memory Encodingsupporting
confidence: 60%
“…2. Example of headers KISS2 [4] Due to application of TimeQuest Timing Analyzer from Tools Menu Quartus Altera [7] there was estimated time of performance for hybrid of finite state machine from [1] and [5,6]. The results from Report Fmax Summary are for Auto and One-Hot Encoding -854.7MHz, for Sequential and Minimal Bits 1000 MHz, .Johnson and Gray encoding 1001 MHz, which partially coincide with results from [2].…”
Section: Using Benchmark Tests For Compare Speed Of Performance For Different State Memory Encodingsupporting
confidence: 60%
“…To ensure that two different synthesis methods are used: modular synthesis and architectural synthesis but other known can also considered [9], [24], [25]. In addition, different description styles are applied: assertion based [21], [26], [18] and structural RTL description [27], [28].…”
Section: Synthesis and Implementationmentioning
confidence: 99%
“…their description and verification, and their implementation. Several approaches based on formal models have been proposed, for example the B-method [1] and more "usual" discrete event system (DES) modeling techniques such as finite state machines (FSM) [3], StateCharts [23] and Petri nets (PN) [25]. PN have been widely used for the study of complex systems [4] [5] because of their easily understood graphic representation -which allows parallelism, choice, synchronization, resource sharing, etc.…”
Section: Introductionmentioning
confidence: 99%