Hierarchical finite-state machines and their use for digital control

Sklyarov, Valery

doi:10.1109/92.766749

Cited by 60 publications

(48 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is known that control algorithms can be constructed from modules and described hierarchically with the aid of the language that is called hierarchical graph-schemes (HGS) [4]. An example of such a specification (that is very similar to flow-charts in programming) that contains two modules z 0 and z 2 is shown in Fig.…”

Section: Specification and Hardware Implementation Of Recursive Contrmentioning

confidence: 99%

“…In this case, the module z 2 begins execution starting from the node Begin and the module z 0 suspends its execution (see Ref. [4] for other details). When the node End in the module z 2 is reached the execution flow has to be continued starting from the node following the point where the module z 2 was called the last time.…”

Section: Specification and Hardware Implementation Of Recursive Contrmentioning

confidence: 99%

“…It is known that a recursive algorithm can be implemented in a hierarchical finite state machine (HFSM) [4]. However, the primary model of an HFSM has a number of disadvantages including a book-keeping overhead.…”

mentioning

confidence: 99%

See 2 more Smart Citations

FPGA-based implementation of recursive algorithms

Sklyarov

2004

Microprocessors and Microsystems

View full text Add to dashboard Cite

The paper suggests a novel method for implementing recursive algorithms in hardware. The required support for recursion has been provided through a modular and a hierarchical specification of a control unit that can be translated to an implementation of the respective hardware circuit on the basis of a recursive hierarchical finite state machine and through a mechanism that permits the contents of an execution unit to be stored/restored between hierarchical calls/returns. The paper describes all the details that are required to implement recursive algorithms in hardware. It begins with software (Cþþ) models and finishes with synthesizable VHDL codes. Two practical applications of recursive algorithms in the data sorting and compression area have been studied in detail. q 2004 Published by Elsevier B.V.

show abstract

Section: Specification and Hardware Implementation Of Recursive Contrmentioning

confidence: 99%

Section: Specification and Hardware Implementation Of Recursive Contrmentioning

confidence: 99%

See 1 more Smart Citation

FPGA-based implementation of recursive algorithms

Sklyarov

2004

Microprocessors and Microsystems

View full text Add to dashboard Cite

show abstract

“…The first method is called Statecharts [14] and the second is called hierarchical graph-schemes (HGS) [3]. We employ the second method because it permits a synthesizable specification to be built and supports virtualization of control algorithms.…”

Section: Hierarchical Specification Of Control Algorithmsmentioning

confidence: 99%

“…That is why we employ a reconfigurable hardware/software (RHS) model of the computations [2]. The task of point 2 can be handled with the aid of a hierarchical specification of the virtual control algorithms [3]. There are many known methods that can be used for synthesis of control systems (see point 3), for example [4].…”

Section: Introductionmentioning

confidence: 99%

FPGA-Based Implementation of Genetic Algorithm for the Traveling Salesman Problem and Its Industrial Application

Skliarova

Ferrari

2002

Developments in Applied Artificial Intelligence

View full text Add to dashboard Cite

Abstract.In this paper an adaptive distribution system for manufacturing applications is considered and examined. The system receives a set of various components at a source point and supplies these components to destination points. The objective is to minimize the total distance that has to be traveled. At each destination point some control algorithms have to be activated and each segment of motion between destination points has also to be controlled. The paper suggests a model for such a distribution system based on autonomous sub-algorithms that can further be linked hierarchically. The links are set up during execution time (during motion) with the aid of the results obtained from solving the respective traveling salesman problem (TSP) that gives a proper tour of minimal length. The paper proposes an FPGA-based solution, which integrates a specialized virtual controller implementing hierarchical control algorithms and a hardware realization of genetic algorithm for the TSP.

show abstract

Synthesis and Implementation of RAM-Based Finite State Machines in FPGAs

Skylarov

2000

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Hierarchical finite-state machines and their use for digital control

Cited by 60 publications

References 4 publications

FPGA-based implementation of recursive algorithms

FPGA-based implementation of recursive algorithms

FPGA-Based Implementation of Genetic Algorithm for the Traveling Salesman Problem and Its Industrial Application

Synthesis and Implementation of RAM-Based Finite State Machines in FPGAs

Contact Info

Product

Resources

About