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

Algorithm 3

Dummy_replacement.

Input. The descriptions of base_ckt & recon_ckt_b (i.e. [])

Output. The descriptions base_ckt & recon_ckt_b without dummy states and dummy transitions.

begin

if (_base ≥ _recon) then replacing the dummy states

replace dummy states in recon_ckt_b by Proposition 1; by considering states in place of

transitions in the modified cost matrix

else if (_base < _recon) then

replace dummy states in base_ckt by by Proposition 2;

end

for each (matched state, ∈ recon_ckt_b) do replacing the dummy transitions

for each (transition in recon_ckt_b, ) do

if ( ≥ ) then

replace dummy transitions in recon_ckt_b by Proposition 1;

else if () then

replace dummy transitions in base_ckt by Proposition 1;

end

end

end

end