FPGA-based state encoding using symbolic functional decomposition

Citations Over Time

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.

Related Papers

• → Logic synthesis for look-up table based FPGAs using functional decomposition and support minimization(1995)53 cited
• → High-quality FPGA designs through functional decomposition with sub-function input support selection based on information relationship measures(2002)7 cited
• → High-quality sub-function construction in functional decomposition based on information relationship measures(2001)11 cited
• → High-quality sub-function construction in functional decomposition based on information relationship measures(2002)10 cited
• → Performance-directed technology mapping for LUT-based FPGAs — What role do decomposition and covering play?(1996)3 cited