Home / Current Issue / Paper 1725409
Machine-Learning-Based PPA Optimization for VLSI Design-Space Exploration
Subject area: Science,Engineering and Technology · Area of research: Artificial Intelligence & Machine Learning
Abstract
Power, performance, and area (PPA) optimization in digital VLSI design requires repeated evaluation of parameterized circuits under synthesis, timing, and implementation constraints. The cost of these evaluations can make broad design-space exploration impractical, particularly when architecture, RTL structure, technology context, and physical-design settings interact nonlinearly. This paper specifies an implementation-aware machine-learning framework that combines parameterized Verilog generation, functional verification, synthesis, physical implementation, feature extraction, surrogate prediction, and NSGA-II-based multi-objective candidate selection. The proposed benchmark scope includes adder architectures, multiplexers, counters, comparators, and arithmetic logic units. Random Forest, XGBoost, and artificial neural network regressors are considered as candidate surrogate models. The framework explicitly separates pre-implementation inputs, post-implementation measurements, model predictions, and verification status. Only functionally verified candidates with traceable implementation reports may contribute measured labels to the authoritative dataset or the final measured Pareto set. ASIC and FPGA experiments are treated as separate tracks because their area, timing, power, and resource metrics are technology-and flow-dependent. A reproducible experimental protocol is defined for model comparison, cross-family generalization, matched-budget search comparison, ablation, and robustness analysis. No measured PPA values, model scores, or optimization improvements are claimed in this manuscript; those results must be populated after the experiments are executed.
Keywords
active learning, artificial neural network, machine learning, NSGA-II, OpenROAD, random forest, surrogate modeling, XGBoost, Yosys
References
[1] Deb K, Pratap A, Agarwal S, Meyarivan T. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation. 2002;6(2):182–197. https://doi.org/10.1109/4235.996017
[2] Breiman L. Random forests. Machine Learning. 2001;45:5–32. https://doi.org/10.1023/A:1010933404324
[3] Chen T, Guestrin C. XGBoost: a scalable tree boosting system. In: Proc. 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2016:785–794. https://doi.org/10.1145/2939672.2939785
[4] Hornik K, Stinchcombe M, White H. Multilayer feedforward networks are universal approximators. Neural Networks. 1989;2(5):359–366. https://doi.org/10.1016/0893-6080(89)90020-8
[5] Ajayi T, Chhabria VA, Fogaça M, Hashemi S, Hosny A, Kahng AB, et al. Toward an open-source digital flow: first learnings from the OpenROAD project. In: Proceedings of the 56th Annual Design Automation Conference (DAC). 2019. Art. 76, p. 1–4. https://doi.org/10.1145/3316781.3326334
[6] YosysHQ. Yosys Open SYnthesis Suite: documentation [Internet]. [cited 2026 Nov 12]. Available from: https://yosyshq.readthedocs.io/
[7] OpenROAD Project. OpenROAD documentation [Internet]. [cited 2026 Nov 12]. Available from: https://openroad.readthedocs.io/
[8] Pedregosa F, et al. Scikit-learn: machine learning in Python. Journal of Machine Learning Research. 2011;12:2825–2830.
[9] Akiba T, Sano S, Yanase T, Ohta T, Koyama M. Optuna: a next-generation hyperparameter optimization framework. In: Proc. 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2019:2623–2631. https://doi.org/10.1145/3292500.3330701
How to cite this paper
@article{1725409,
author = {Pushkar Raj, Dr Partap Singh},
title = {Machine-Learning-Based PPA Optimization for VLSI Design-Space Exploration},
journal = {Iconic Research And Engineering Journals},
year = {2026},
volume = {10},
number = {5},
pages = {4040-4054},
issn = {2456-8880},
url = {https://www.irejournals.com/formatedpaper/1725409.pdf},
abstract = {Power, performance, and area (PPA) optimization in digital VLSI design requires repeated evaluation of parameterized circuits under synthesis, timing, and implementation constraints. The cost of these evaluations can make broad design-space exploration impractical, particularly when architecture, RTL structure, technology context, and physical-design settings interact nonlinearly. This paper specifies an implementation-aware machine-learning framework that combines parameterized Verilog generation, functional verification, synthesis, physical implementation, feature extraction, surrogate prediction, and NSGA-II-based multi-objective candidate selection. The proposed benchmark scope includes adder architectures, multiplexers, counters, comparators, and arithmetic logic units. Random Forest, XGBoost, and artificial neural network regressors are considered as candidate surrogate models. The framework explicitly separates pre-implementation inputs, post-implementation measurements, model predictions, and verification status. Only functionally verified candidates with traceable implementation reports may contribute measured labels to the authoritative dataset or the final measured Pareto set. ASIC and FPGA experiments are treated as separate tracks because their area, timing, power, and resource metrics are technology-and flow-dependent. A reproducible experimental protocol is defined for model comparison, cross-family generalization, matched-budget search comparison, ablation, and robustness analysis. No measured PPA values, model scores, or optimization improvements are claimed in this manuscript; those results must be populated after the experiments are executed.},
keywords = {active learning, artificial neural network, machine learning, NSGA-II, OpenROAD, random forest, surrogate modeling, XGBoost, Yosys},
month = {November},
}