A Polarity Search Method for Fixed Polarity Reed-Muller Logic Circuit

Abstract

The invention provides a polarity searching method of a fixed-polarity Reed-Muller logic circuit. The best polarity of an FPRM logic circuit is searched by using the new binary differential evolution algorithm, compared with a polarity searching method of the FPRM logic circuit based on the genetic algorithm, the capacity of local optimum and the capacity of premature convergence are avoided, and the convergence rate and the polarity searching efficiency are improved. The method comprises the following steps that firstly, a Boolean logic circuit is read; secondly, an evolution parameter is input; thirdly, an initial population is generated randomly, wherein the polarity is encoded into a binary individual; fourthly, the improved binary stochastic mutation operation is performed; fifthly, the binomial crossover operation is performed; an FPRM expression of the target individual and the FPRM expression of a test individual of the target individual are obtained; seventhly, the fitness value of the target individual and the fitness value of the test individual of the target individual are calculated; eighthly, the greedy selection operation and an elitism selection strategy are performed; ninthly, if the current evolution algebra is smaller than the maximum evolution algebra, the fourth to eighth steps are executed in sequence, and otherwise, the best polarity is output.

Description

technical field [0001] The invention relates to the field of polarity optimization of Reed-Muller logic circuits, in particular to a polarity search method for fixed-polarity Reed-Muller logic circuits based on a new binary differential evolution algorithm. Background technique [0002] Logic circuits can be represented by Boolean logic based on AND / OR / NOT operations, or Reed-Muller (RM) logic based on AND / XOR or OR / XNOR operations. For circuits such as arithmetic circuits, parity check circuits, and communication circuits, RM logic representation has greater advantages in terms of power consumption, area, and speed than Boolean logic representation. Fixed Polarity RM (Fixed Polarity RM, FPRM) expression is a more popular standard RM expression. For a logistic function of n variables, it has 2 n FPRM expressions of different polarities. The polarity directly determines the complexity of the FPRM expression, which in turn affects the performance of the circuit. Therefore,...

AI Technical Summary

Problems solved by technology

[0004] (1) The selection operation of the genetic algorithm itself makes the variance and entropy of the population evolve in the direction of decreasing, thereby reducing the diversity of the population;

[0005] (2) The genetic algorithm is essentially a random search optimization algorithm. When the problem scale is large or the problem is more complex, the search space will increase sharply.

In addition, group dispersion and convergence contradict each other, resulting in slower convergence speed;

[0006] (3) When the fitness of individuals in the population is not much different, the new individuals in the offspring population are also similar, making the search process ineffective, and the selection mechanism based on fitness tends to be purely random selection, thus falling into local best

However, traditional differential evolution algorithms are mainly used to solve global optimization problems with continuous variables, and cannot solve discrete binary coded combinatorial optimization problems like FPRM logic circuit polarity search.

Images