FPGA Implementation of Reconfigurable Finite State Machine with Input Multiplexing Architecture Using Hungarian Method

Algorithm 2

State_matching.

Input. Combinations_of_input_lines, the descriptions of base_ckt & recon_ckt_b (i.e. [)

Output. Assignment_cost_e, total_cost_e, modified description of recon_ckt_b

begin

for all (combinations_of_input_lines) do

if (_base ≥ _recon) then equating the number of states in both the FSMs

add (_base −  _recon) dummy states in recon_ckt_b;

_base;

else if (_base < _recon) then

add (_recon −  _base) dummy states in base_ckt;

_recon;

end

weight_assignment( ); calling the procedure- “weight_assignment”

GBH_hungarian_algorithm( ); performing present state matching

assignment_; where ;

total_; where ;

replace all states of recon_ckt_b by their corresponding states of base_ckt obtained

from GBH_hungarian_algorithm;

corresponding to order, arrange all the complete arrays of recon_ckt_b;

end

end