A theorem on the convergence of two-level coding genetic algorithm to the exact solution of the fpga reconfiguration task

The article gives a brief statement of the FPGA reconfiguration problem and describes basic and genetic reconfiguration algorithms. The genetic algorithm uses a two-level solution coding and intermediate representation in the form of the complete bipartite graph adjacency matrix. A theorem on the convergence of developed genetic algorithm to the exact solution of the FPGA reconfiguration task is formulated and proved.