Work

Machine-Learning-Based PPA Optimization for VLSI Design-Space Exploration

Year: 2026
Type: article
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.
Institution: Quantum University
Language: English
Open Access status: bronze
OpenAlex ID: W7236783036
FWCI:
Cites: 6
Cited by:
Related to: 10