ON CONVERGENCE OF GENETIC ALGORITHM FOR FPGA RECONFIGURATION
Городилов Алексей Юрьевич · В мире научных открытий · 2015
The article discusses the problem of increasing the reliability and fault tolerance of programmable logic integrated circuits of type FPGA. Currently there are several approaches to improve the reliability. One of them is to use elements with redundant basis, an appropriate diagnosis and reconfiguration. The aim of the study is to develop a genetic algorithm for FPGA reconfiguration, with the use of elements with redundant basis. Reconfiguration task is understood as a problem of finding a workable elements that cover a given functional circuit. These elements should be arranged more compactly. In this paper we prove a theorem, which theoretically justifies the convergence of the algorithm to an optimal solution. Practical experiments confirm the theoretical conclusions. The results can be used to develop new genetic algorithms and creating FPGA based on elements with redundant basis.