FPGA-based state encoding using symbolic functional decomposition
Stanisław R. Deniziak, M. Wiśniewski
Abstract
Stanisław R. Deniziak, M. Wiśniewski
Abstract
Presented is a new method of finite state machine (FSM) implementation targeting LUT-based FPGAs. State encoding is performed simultaneously with decomposition of transition and output functions. This is achieved by applying symbolic functional decomposition. Experimental results show that the presented method significantly reduces the cost of implementations of FSMs for most of the evaluated benchmarks.
OpenAlex reports 8 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.
Presented is a new method of finite state machine (FSM) implementation targeting LUT-based FPGAs. State encoding is performed simultaneously with decomposition of transition and output functions. This is achieved by applying symbolic functional decomposition. Experimental results show that the presented method significantly reduces the cost of implementations of FSMs for most of the evaluated benchmarks.
Key concepts: Field-programmable gate array, Lookup table, Decomposition, Encoding (memory), Functional decomposition, Computer science, Finite-state machine, State (computer science)