Area optimization for MPRM logic circuits based on improved multiple disturbances fireworks algorithm

Abstract Area optimization is one of the most important contents of circuit logic synthesis. In logical function expressions, mixed polarity Reed–Muller (MPRM) expansion produces a smaller area than Boolean expansion and fixed polarity Reed–Muller (FPRM) expansion. However, the area optimization for MPRM logic circuits is a combinatorial optimization problem, and the existing area optimization effect of MPRM logic circuits is poor. In this paper, an improved multiple disturbances fireworks algorithm is proposed to solve the combinatorial optimization problem of three-valued variables. Based on the ordinary fireworks algorithm, the algorithm we proposed initializes the individual of the fireworks population by introducing the Latin hypercube sampling model and introduces multiple disturbances in the process of iterative optimization of the population, so that the algorithm takes the global and local search into account, and achieves a good result. Moreover, we propose an MPRM logic circuits area optimization method, which uses the proposed improved multiple disturbances fireworks algorithm to search for the optimal polarity corresponding to MPRM logic circuits with minimum area. An adequate comparative analysis based on different MCNC benchmark circuits has been presented. The results of the experiment show that the method we proposed has a good effect on MPRM logic circuits area optimization.