FPGA Implementation of an Improved Reconfigurable FSMIM Architecture Using Logarithmic Barrier Function Based Gradient Descent Approach

Abstract

Recently, the Reconfigurable FSM has drawn the attention of the researchers for multistage signal processing applications. The optimal synthesis of Reconfigurable finite state machine with input multiplexing (Reconfigurable FSMIM) architecture is done by the iterative greedy heuristic based Hungarian algorithm (IGHA). The major problem concerning IGHA is the disintegration of a state encoding technique. This paper proposes the integration of IGHA with the state assignment using logarithmic barrier function based gradient descent approach to reduce the hardware consumption of Reconfigurable FSMIM. Experiments have been performed using MCNC FSM benchmarks which illustrate a significant area and speed improvement over other architectures during field programmable gate array (FPGA) implementation.

A Gradient‐Based Interior‐Point Method to Solve the Many‐to‐Many Assignment Problems

“…In the field of circuit design, the hypercube embedding based techniques, such as HARD [19] and Improved-FSMIM [20], are developed for hardware optimization. These techniques have never been examined to solve a generalized assignment problem such as MMAP.…”

“…In the hypercube ] , (where , ∈ ) symbolizes the Hamming distance between the vertices and . The pictorial representation for evaluation of is given in [20]. Its mathematical representation is shown in Equation 14, where is the instantaneous value of .…”

“…In this method, weight vectors (i.e., the model parameters) are determined to reduce the objective function [27,28]. Its mathematical representation is given in (20).…”

SD‐SHO: Security‐dominated finite state machine state assignment technique with a satisfactory level of hardware optimization

“…In the FSM state encoding process, a single state code cannot be used for encoding more than one state. Consequently, the dimension of each hypercube is different from one-another during hypercube embedding [25,33], which leads to cnstr i ðz 2 Þ ¼ ‖z 2;i − z 2;j ‖ 2 ≥ 0.…”

“…Let symbolize the Hamming distance between particular state codes. Therefore, the implementation cost caused due to λ is given in Equation (12) [25]. Its graphical representation is shown in Figure 3.…”