Machine Learning-Guided Multi-Objective Optimization of Carry-Based Adder Architectures for High-Performance Digital Systems
This paper presents a verification-first, implementation-aware research protocol for studying machine-learning-guided multi-objective optimization of carry-based adder architectures. The planned benchmark comprises Ripple Carry (RCA), Carry Lookahead (CLA), Carry Select (CSLA), Kogge–Stone, Brent–Kung, and parameterized hybrid-prefix structures under a common arithmetic interface and a declared set of operand widths. The protocol connects parameterized RTL generation, functional verification, implementation-specific synthesis and timing analysis, provenance-preserving dataset construction, surrogate modeling, and budget-matched multi-objective search. Random Forest, gradient-boosted trees, and neural-network regressors are treated as candidate models rather than presumed winners. Functional validity and successful completion of the declared implementation flow are eligibility requirements. FPGA and ASIC experiments are specified as separate tracks, with platform-specific metrics and constraints. The protocol defines leakage-resistant grouped evaluation, uncertainty and calibration checks, measured Pareto-front validation, matched-budget baselines, and reproducibility requirements. No numerical PPA measurements, model scores, architecture rankings, or search improvements are claimed because the implementation campaign has not yet been executed.
Authors
- Priya Singh
- Partap Singh
Institutions
- Quantum University (IN)
Publication Details
- Journal
- Iconic Research and Engineering Journals
- Published
- 2026-11-19
- DOI
- https://doi.org/10.64388/ire1725411
- Primary Topic
- Low-power high-performance VLSI design
- Type
- article
- Field-Weighted Citation Impact
- 0.00