Multiobjective optimization for mixed polarity Reed‒Muller logic circuits based on a multi-strategy quantum wolf pack algorithm
Chengcheng CHEN , Yuhao ZHOU , Juncai HE , Dongge QIN , Zhanhui SHI , Wei ZHANG , Jicong DUAN , Zhenxue HE , Limin XIAO
Eng Inform Technol Electron Eng ›› 2026, Vol. 27 ›› Issue (10) : 260146
Area and power need to be considered at all stages of integrated circuit design. Area and power cooperative optimization for mixed polarity Reed‒Muller (MPRM) circuits aims to find the Pareto non-dominated sets with minimum area and power. Existing multiobjective optimization approaches for MPRM circuits have a long runtime and cannot handle large-scale circuits. In this paper, we propose a multi-strategy quantum wolf pack algorithm (MQWPA), which includes quantum encoding, dual-population strategy, dynamic reverse learning strategy, mutation strategy, and termination criterion. Moreover, based on the proposed MQWPA, we propose an efficient area and power optimization approach (EAPOA), which searches for XNOR/OR-based MPRM circuits with Pareto non-dominated solution sets. Experimental results show that compared with state-of-the-art evolutionary algorithms, MQWPA can search for optimal solutions in multiobjective test problems; compared with commonly used Boolean minimization methods, EAPOA has advantages in area and power consumption. After field-programmable gate array technology and standard cell mapping, by selecting area as the optimal cost implementation, we obtain average improvements in the actual area of 16.33% and 2.27%, respectively.
Cooperative optimization / Mixed polarity Reed‒Muller / Quantum wolf pack algorithm / Pareto non-dominated sets
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
|
| [26] |
|
| [27] |
|
| [28] |
|
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
| [34] |
|
| [35] |
|
| [36] |
|
| [37] |
|
| [38] |
|
| [39] |
|
| [40] |
|
| [41] |
|
| [42] |
|
| [43] |
|
The Authors. Published by Zhejiang University Press Co., Ltd.
/
| 〈 |
|
〉 |