Abstract
The power optimization of mixed polarity Reed–Muller (MPRM) logic circuits is a classic combinatorial optimization problem. Existing optimization approaches often suffer from slow convergence and a propensity to converge to local optima, limiting their effectiveness in achieving optimal power efficiency. First, we propose a novel multi-strategy fusion memetic algorithm (MFMA). MFMA integrates global exploration via the chimp optimization algorithm with local exploration using the coati optimization algorithm based on the optimal position learning and adaptive weight factor (COA-OLA), complemented by population management through truncation selection. Second, leveraging MFMA, we propose a power optimization approach for MPRM logic circuits that searches for the best polarity configuration to minimize circuit power. Experimental results based on Microelectronics Center of North Carolina (MCNC) benchmark circuits demonstrate significant improvements over existing power optimization approaches. MFMA achieves a maximum power saving rate of 72.30% and an average optimization rate of 43.37%; it searches for solutions faster and with higher quality, validating its effectiveness and superiority in power optimization.
摘要
混合极性Reed–Muller(MPRM)逻辑电路功耗优化是一种典型的组合优化问题。现有功耗优化方法存在收敛速度慢、易陷入局部最优等问题, 在实现最佳功耗方面的有效性十分有限。首先, 本文提出一种多策略融合模因算法(MFMA), 利用黑猩猩优化算法进行全局勘探, 利用基于最优位置学习和自适应权重因子的浣熊优化算法(COA-OLA)进行局部探索, 最后采用截断选择算法进行新种群选择。其次, 基于MFMA提出一种MPRM逻辑电路功耗优化方法, 通过寻找最佳极性配置, 使得电路功耗最小化。基于MCNC基准电路的实验结果表明, 与现有的功耗优化方法相比, 本功耗优化方法有显著的改进。MFMA实现最高功耗优化率为72.30%, 平均优化率为43.37%。同时, MFMA搜索解的速度更快且质量更好, 验证了其在功耗优化方面的有效性和优越性。
Similar content being viewed by others
Data availability
Data are not available due to ethical/legal/commercial restrictions.
References
Dehghani M, Montazeri Z, Trojovská E, et al., 2023. Coati optimization algorithm: a new bio-inspired metaheuristic algorithm for solving optimization problems. Knowl-Based Syst, 259:110011. https://doi.org/10.1016/J.KNOSYS.2022.110011
Hasanien HM, Alsaleh I, Alassaf A, et al., 2023. Enhanced coati optimization algorithm-based optimal power flow including renewable energy uncertainties and electric vehicles. Energy, 283:129069. https://doi.org/10.1016/j.energy.2023.129069
He JC, He ZX, Liu J, et al., 2024. An effective power optimization approach based on whale optimization algorithm with two-populations and mutation strategies. Chin J Electron, 33(2):423–435. https://doi.org/10.23919/cje.2022.00.358
Huan GY, Hu JB, He YF, et al., 2021. Machine learning for electronic design automation: a survey. ACM Trans Des Autom Electron Syst, 26(5):40. https://doi.org/10.1145/3451179
Ju XX, Yuan S, Yang XS, et al., 2024. Fixed-time neurodynamic optimization algorithms and application to circuits design. IEEE Trans Circ Syst I Regul Pap, 71(5):2171–2181. https://doi.org/10.1109/TCSI.2024.3349542
Khatana V, Saraswat G, Patel S, et al., 2024. GradConsensus: linearly convergent algorithm for reducing disagreement in multi-agent optimization. IEEE Trans Netw Sci Eng, 11(1): 1251–1264. https://doi.org/10.1109/TNSE.2023.3321757
Khishe M, Mosavi MR, 2020. Chimp optimization algorithm. Expert Syst Appl, 149:113338. https://doi.org/10.1016/j.eswa.2020.113338
Li HW, Chen HL, Li YX, et al., 2024. Reverse-designed photonic crystal fiber-based polarization filter with optimal performance. Opt Laser Technol, 168:109909. https://doi.org/10.1016/j.optlastec.2023.109909
Liu AD, Fu JY, Zhan SW, et al., 2024. A policy searched-based optimization algorithm for obstacle avoidance in robot manipulators. IEEE Trans Ind Electron, 71(9): 11262–11271. https://doi.org/10.1109/TIE.2023.3344831
Lopera DS, Servadei L, Kiprit GN, et al., 2021. A survey of graph neural networks for electronic design automation. Proc ACM/IEEE 3rd Workshop on Machine Learning for CAD, p.1–6. https://doi.org/10.1109/MLCAD52597.2021.9531070
Moscato P, 1989. On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms. C3P Report No. 826, California Institute of Technology, Rasadena, California, USA.
Qin DG, He ZX, Zhao XJ, et al., 2023. Area and power optimization for fixed polarity Reed–Muller logic circuits based on multi-strategy multi-objective artificial bee colony algorithm. Eng Appl Artif Intell, 121:105906. https://doi.org/10.1016/j.engappai.2023.105906
Suau M, Zegard T, 2023. Topology optimization with optimal design subdomain selection. Struct Multidiscipl Optim, 66(12):246. https://doi.org/10.1007/s00158-023-03696-5
Wang WC, Tian WC, Chau KW, et al., 2023. An improved bald eagle search algorithm with Cauchy mutation and adaptive weight factor for engineering optimization. Comput Model Eng Sci, 136(2):1603–1642. https://doi.org/10.32604/cmes.2023.026231
Wang X, Zhang R, Wang WK, et al., 2015. Polarity searching for MPRM logic circuit based on improved adaptive genetic algorithm. Proc IEEE 12th Int Conf on Ubiquitous Intelligence and Computing and IEEE 12th Int Conf on Autonomic and Trusted Computing and IEEE 15th Int Conf on Scalable Computing and Communications and Its Associated Workshops, p.1354–1358. https://doi.org/10.1109/UIC-ATC-ScalCom-CBDCom-IoP.2015.244
Yıldız BS, Kumar S, Panagant N, et al., 2023. A novel hybrid arithmetic optimization algorithm for solving constrained optimization problems. Knowl-Based Syst, 271:110554. https://doi.org/10.1016/j.knosys.2023.110554
Yin H, Lyu YH, Xu LW, et al., 2025. Intelligent optimization algorithm for green IoV networks based on SSA. IEEE Trans Veh Technol, 74(2):2251–2260. https://doi.org/10.1109/TVT.2023.3347744
Zhao BW, Chen WN, Wei FF, et al., 2024. PEGA: a privacy-preserving genetic algorithm for combinatorial optimization. IEEE Trans Cybern, 54(6):3638–3651. https://doi.org/10.1109/TCYB.2023.3346863
Zhao GC, Zeng ZW, Wang XL, et al., 2024. Efficient ternary logic circuits optimized by ternary arithmetic algorithms. IEEE Trans Emerg Top Comput, 12(3):826–839. https://doi.org/10.1109/TETC.2023.3321050
Zhou YH, He ZX, Chen C, et al., 2022. An efficient power optimization approach for fixed polarity Reed–Muller logic circuits based on metaheuristic optimization algorithm. IEEE Trans Comput-Aided Des Integr Circ Syst, 41(12): 5380–5393. https://doi.org/10.1109/TCAD.2022.3149720
Author information
Authors and Affiliations
Contributions
Mengyu ZHANG designed the research and drafted the paper. Zhenxue HE designed the experiment and processed the data. Yijin WANG, Xiaojun ZHAO, and Xiaodan ZHANG helped organize the paper. Limin XIAO and Xiang WANG revised and finalized the paper.
Corresponding author
Ethics declarations
All the authors declare that they have no conflict of interest.
Additional information
Project supported by the National Natural Science Foundation of China (No. 62102130), Central Government Guides Local Science and Technology Development Fund Project, China (No. 226Z0201G), Natural Science Foundation of Hebei Province, China (Nos. F2020204003 and F2024204001), and Science and Technology Research Projects of Higher Education Institutions in Hebei Province, China (No. QN2024138)
List of supplementary materials
1 Introduction
2 Preliminaries
3 Multi-strategy fusion memetic algorithm
4 Experimental results and analysis
Table S1 Test set experimental results
Table S2 Experimental results of Wilcoxon signed-rank test
Fig. S1 Flowchart of ChOA
Fig. S2 Flow of MPRM power optimization
Fig. S3 Convergence performance of optimal value on different test functions
Fig. S4 Experimental data for box plot
Supplementary materials
11714_2025_513_MOESM1_ESM.pdf
A power optimization approach for mixed polarity Reed–Muller logic circuits based on multi-strategy fusion memetic algorithm
Rights and permissions
About this article
Cite this article
Zhang, M., He, Z., Wang, Y. et al. A power optimization approach for mixed polarity Reed–Muller logic circuits based on multi-strategy fusion memetic algorithm. Front Inform Technol Electron Eng 26, 415–426 (2025). https://doi.org/10.1631/FITEE.2400513
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1631/FITEE.2400513
Key words
- Power optimization
- Multi-strategy fusion memetic algorithm (MFMA)
- Mixed polarity Reed–Muller (MPRM)
- Combinatorial optimization problem