Implementation Of Finite State Machines Research Articles

New design procedure for digital filters based on a finite-state machine implementation

The concept of a finite-state machine (FSM) is used in an attempt to cover the deficiencies of the conventional digital filter design procedure with respect to finite-word-length effects. The problem of synthesis is considered in detail and a procedure whereby the FSM mappings are designed to best model a given difference equation is presented. This procedure is based on a well known graph theory algorithm. The FSM digital filter design procedure is evaluated by computer simulation of various small-word-length filters. Several examples are presented to demonstrate the improved performance of the FSM filters with respect to conventional fixed-point designs. The design procedure also allows the construction of limit-cycle-free high-order direct-form filters. This form is compared to the more conventional cascade structure.

Self-Diagnosing Cellular Implementations of Finite-State Machines

Cellular spaces are shown to possess properties favorable to reconfiguration. As a first step in the direction of reconfigurable cellular spaces, this paper demonstrates the implementation of arbitrary finite-state machines in self-diagnosing cellular spaces. The results cover single cell failures caused by erroneous state transitions or by erroneous outputs. One of the attractive features of the implementation is the absence of any hard core components. As an intermediate step, it is shown how to transform any given cellular space into a self-diagnosing cellular space. The results demonstrate that the control structure (which is a finite-state machine) of any computing device can be implemented as a self-diagnosing entity without hard core.