State assignment based on two-dimensional placement and hypercube mapping

Abstract

This paper addresses the problem of state assignment for Finite State Machines (FSM). This is an important problem in digital system design where added functionality often comes at the expense of a larger (and slower) FSM to control the system. We present a new scheme to solve the graph embedding problem which is the main step in the state assignment process. This new approach places the graph in a two-dimensional array (grid) while minimizing the total edge length, and then maps this two-dimensional array into an n-dimensional hypercube with dilation of at most 2. Experimental results are presented and compared against those of NOVA. These results demonstrate the effectiveness of the proposed approach.

COPAS: A New Algorithm for the Partial Input Encoding Problem

“…Finally, in order to show an application of the algorithm, results for the state assignment problem are also given. Table V compares NOVA i_hybrid, NOVA io_hybrid, ENC, Hyper_Place [14] and COPAS for the state assignment problem. The number of product terms required to implement the combinational component of an IWLS'93 FSM, tp, is shown in this table.…”