Encoding of internal states in synthesis and implementation process of automata into FPGAs
Arkadiusz Bukowiec, Alexander A. Barkalov, Larysa Titarenko
Abstract
Arkadiusz Bukowiec, Alexander A. Barkalov, Larysa Titarenko
Abstract
The method of synthesis and implementation of Mealy FSMs into FPGAs is proposed. Synthesis is based on the architectural decomposition and multiple encoding of internal states. States are divided into subsets based on a current state and encoded separately in each subset. The state is decoded in the second-level circuit based on the multiple code and the code of a current state. It leads to implementation of FSM in double-level structure where utilization of both, LUTs and memory blocks of FPGA, is applied. It leads to balanced usage of hardware resources of an FPGA device.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The method of synthesis and implementation of Mealy FSMs into FPGAs is proposed. Synthesis is based on the architectural decomposition and multiple encoding of internal states. States are divided into subsets based on a current state and encoded separately in each subset. The state is decoded in the second-level circuit based on the multiple code and the code of a current state. It leads to implementation of FSM in double-level structure where utilization of both, LUTs and memory blocks of FPGA, is applied. It leads to balanced usage of hardware resources of an FPGA device.
Key concepts: Field-programmable gate array, Encoding (memory), Computer science, Finite-state machine, State (computer science), Automaton, Process (computing), Code (set theory)