Home / Current Issue / Paper 1725411
Machine Learning-Guided Multi-Objective Optimization of Carry-Based Adder Architectures for High-Performance Digital Systems
Subject area: Science,Engineering and Technology · Area of research: Machine Learning
Abstract
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.
Keywords
FPGA, machine learning, NSGA-II, PPA, surrogate modeling, Verilog, VLSI design-space exploration
References
[1] Kogge PM, Stone HS. A parallel algorithm for the efficient solution of a general class of recurrence equations. IEEE Transactions on Computers. 1973;C-22(8):786–793. https://doi.org/10.1109/TC.1973.5009159
[2] Ladner RE, Fischer MJ. Parallel prefix computation. Journal of the ACM. 1980;27(4):831–838. https://doi.org/10.1145/322217.322232
[3] Brent RP, Kung HT. A regular layout for parallel adders. IEEE Transactions on Computers. 1982;C-31(3):260–264. https://doi.org/10.1109/TC.1982.1675982
[4] Balasubramanian P, Mastorakis N. Performance comparison of carry-lookahead and carry-select adders based on accurate and approximate additions. Electronics. 2018;7(12):369. https://doi.org/10.3390/electronics7120369
[5] 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
[6] Breiman L. Random forests. Machine Learning. 2001;45:5–32. https://doi.org/10.1023/A:1010933404324
[7] Chen T, Guestrin C. XGBoost: a scalable tree boosting system. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2016:785–794. https://doi.org/10.1145/2939672.2939785
[8] 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
[9] Sklansky J. Conditional-sum addition logic. IRE Transactions on Electronic Computers. 1960;EC-9(2):226–231.
[10] Han T, Carlson DA. Fast area-efficient VLSI adders. In: Proceedings of the 8th IEEE Symposium on Computer Arithmetic. 1987:49–56.
[11] Harris D. A taxonomy of parallel prefix networks. In: Proceedings of the 37th Asilomar Conference on Signals, Systems and Computers. 2003;2:2213–2217. https://doi.org/10.1109/ACSSC.2003.1292373
[12] Yagain D, Krishna V, Baliga A. Design of high-speed adders for efficient digital design blocks. International Scholarly Research Notices. 2012;2012:253742. https://doi.org/10.5402/2012/253742
[13] Balasubramanian P, Maskell DL. A new carry look-ahead adder architecture optimized for speed and energy. Electronics. 2024;13(18):3668. https://doi.org/10.3390/electronics13183668
[14] Harris D, Sutherland I. Logical effort of carry propagate adders. In: Proceedings of the 37th Asilomar Conference on Signals, Systems and Computers. 2003.
How to cite this paper
@article{1725411,
author = {Priya Singh, Dr Partap Singh},
title = {Machine Learning-Guided Multi-Objective Optimization of Carry-Based Adder Architectures for High-Performance Digital Systems},
journal = {Iconic Research And Engineering Journals},
year = {2026},
volume = {10},
number = {5},
pages = {4055-4070},
issn = {2456-8880},
url = {https://www.irejournals.com/formatedpaper/1725411.pdf},
abstract = {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.},
keywords = {FPGA, machine learning, NSGA-II, PPA, surrogate modeling, Verilog, VLSI design-space exploration},
month = {November},
}