{'fraction_non_alphanumeric': 0.016563146997929608, 'fraction_numerical': 0.0, 'mean_word_length': 5.3618421052631575, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Evolutionary repair for evolutionary design of combinational logic circuits

Evolutionary algorithms have been adopted to design logic circuits for many years. However, it takes too much time for evolutionary algorithms to generate circuits directly. Recently, the repair technique has been introduced into evolutionary design of the circuit to significantly decrease the time cost. And yet, the repair technique costs a lot of gate resource. In this paper, the evolutionary repair for evolutionary design of the combinational circuit is proposed, which generates the repair circuits with an evolutionary algorithm. The evolutionary repair could reduce the gate resource cost and does not spend much more time. The evolutionary repair is merged into the traditional evolutionary algorithm to form a novel evolutionary design algorithm, i.e. the erEDA. The experimental results demonstrate that the erEDA could balance the time cost and the gate resource consumption.