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

Algorithm 6

GBH_hungarian_algorithm.

Input. Cost matrix C

Output. Optimal assignment between and

begin

, , and    Initialization

while (( > ) && ( > )) do

;

;

;

;

if ≤ then   performing vertex elimination from set V 

if ≤ then identify whether vertex elimination from is “profitable”

, , ;

else if ≤ then identify whether vertex elimination from is “profitable”

, , ;

end

else if > then performing vertex elimination from set U 

if ≤ then identify whether vertex elimination from is “profitable”

, , ;

else if ≤ then identify whether vertex elimination from is “profitable”

, , ;

end

end

;

end

end