- Rating
- 2(−1)
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 2(−1)
- Soundness
- 3
Read review
Paper summary
This paper presents MUL‑GPT, an internal‑timing‑structure‑aware generative optimization framework for multiplier circuits. It reformulates compressor‑tree construction as constrained GPT‑style autoregressive sequence generation, adopts DAPO reinforcement learning with area‑delay‑product (ADP) derived from static‑timing‑analysis (STA) as reward, and alternately optimizes compressor‑tree topology and arrival‑time‑conditioned final‑adder generation. A critical‑path‑guided Cross‑Entropy‑Method (CEM) is further deployed for local interconnection rewiring. The framework outputs valid Verilog RTL. It achieves reduced ADP compared with existing state‑of‑the‑art approaches on 8‑to‑64‑bit AND‑encoded and Booth‑encoded multipliers as well as MAC units. Performance gains persist when optimized arithmetic components are integrated into AI‑accelerator PE arrays. Ablation studies verify the contribution of each component, and the local rewiring module is demonstrated to serve as a general‑purpose post‑processing plugin compatible with other multiplier optimization methods.
Critical strengths
- Joint Optimization of Time Sequence Awareness for the Complete Multiplier Chain: Unlike most methods that only look at area delay indicators globally, MUL-GPT explicitly models internal timing coupling relationships within the multiplier, jointly optimizing three stages: compressed tree generation, time-constrained adder generation, and local rerouting of critical paths; The adder adapts the non-uniform signals output from the compression tree to reach the cross-section, solving the pain point of "timing mismatch between the compression tree and the final adder," rather than independently optimizing the two submodules.
- Novel Structured Circuit Sequence Generation Solution: Transforms compression tree topologies into GPT autoregressive sequences with dynamic validity masks, using multi-branch cascaded prediction of column, level, and compressor types, filtering out invalid circuits during the generation phase to ensure the output structure meets hardware constraints; Paired with DAPO reinforcement learning, it rewards ADP from actual STA simulations using EDA tools, directly guiding model iteration with real comprehensive time-series feedback rather than relying on simplified theoretical models.
- Modular Reusable Critical Path Rerouting Component: Based on STA, the compressor slice corresponding to the critical path is positioned, and signal port redistribution is performed only in bottleneck regions using CEM cross-entropy methods, greatly reducing the search footprint; This rerouting module is not bound to the MUL-GPT master generator and can serve as a general-purpose post-processing plugin, directly enhancing the performance of multipliers produced by other algorithms such as Wallace, RL-MUL, ARITH-DAS, and more, making it highly versatile.
- Comprehensive and industrial-specific experimental verification: covers multipliers and MAC units encoded in 8-64 bit AND and Booth; Not only does it isolate evaluation arithmetic units, but it also integrates generative circuits into AI accelerator PE arrays and Koios 2.0 benchmarks, allowing validation unit-level optimization benefits to be retained in large-scale systems; Using Pareto Frontier + Hypervolume Metric for comprehensive area-delay trade-off, not only a single ADP scalar but also functional simulation and formal equivalence checks are performed to ensure the correctness of RTL generation.
- Detailed and controllable ablation and mechanism analysis: Through multiple ablation experiments, the compression tree generation, conditional adders, and CEM rewiring each contribute their own contributions; Conducting attention analysis confirmed that Transformer pays more attention to historical tokens strongly related to timing; Provides multi-turn independent operation of fluctuation statistics and training convergence curves; Fair comparison baseline, controlling candidate circuit search budgets to be consistent, excluding unfair comparisons caused by different search budgets.
Critical weaknesses
- Simulation evaluation relies on fixed 45nm NanGate process libraries, and generalization capability has not been fully verified. All experiments were based on the NanGate 45nm open-source unit library, with no control trials conducted at other process nodes (such as 7nm/28nm); Under different processes, the timing and area characteristics of compressor and adder units vary greatly, making it impossible to directly prove that the optimization benefits of this method can be seamlessly transferred to other processes.
- High computational overhead and high hardware resource threshold. A large amount of EDA synthesis and STA timing simulation is needed as reinforcement learning reward signals; 32-bit and 64-bit tasks must be trained using dual GPUs, and running them fully takes a long time. Although batch parallel sampling is used, it demands high computing power, EDA tool licenses, and CPU computing clusters, making it costly for ordinary researchers to replicate complete experiments.
- Only for compressed tree multiplier architectures, applicable scenarios are limited. The framework only supports compression tree multipliers composed of FA/HA, does not support other multiplication topologies, and does not extend to other arithmetic circuits such as division or root squares; The input is limited to powers of 2, a conventional bit-width multiplier, and does not evaluate asymmetric bit-width multiplication.
- Optimization goals heavily dependent on ADP scalars, Pareto has shortcomings in its optimization capability. In the reinforcement learning stage, 'Area × Delay' is directly used as a single-scalar reward, favoring a compromise solution; The training process does not explicitly maintain the complete Pareto solution, making it difficult to generate extreme solutions with extreme speeds or extremely small areas; A complete Pareto frontier can only be obtained through post-processing sampling, and the training phase lacks a multi-objective reinforcement learning mechanism.
- CEM Local Rerouting Assumptions Exist and Carry Failure Risk. The algorithm assumes that performance gains mainly come from critical path slicing, with port redistribution only on the critical path; When multiple paths approach critical paths (multiple bottlenecks), optimizing only a single set of key slices significantly reduces the yield. Rerouting only modifies the signal-port mapping and cannot change the type or position of the compressor itself; the optimization limit is constrained by the results generated by the pre-compression tree.
- Evaluate only at the level of logical synthesis without considering physical implementation effects. All metrics come from logical synthesis + STA, without place-route evaluation; Ignore routing delays, congestion, and routing area costs. RTL with excellent logical synthesis may see area-latency returns shrink or even reverse after backend layout and routing.
- 64-bit Equal Bit Width Exists Model Compromise. The 64-bit multiplier corresponds to a very long token sequence. To control memory usage, enabling sliding window attention while reducing the number of samples and iteration cycles is also reduced, thereby lowering the search budget. With large bit widths, model expression capability and search sufficiency are compromised.
- Lack of thorough noise and robustness testing. The experiment was conducted under ideal input conditions and did not study algorithm performance under perturbations such as defects in some input products or changes in timing constraints; Lack of robustness testing under different clock constraints and load conditions.
Questions for authors
- All experiments in this paper are based on the NanGate 45 nm process library, and the time-sequence-area characteristics of full and half adders differ significantly under different processes. Have you observed fluctuations in MUL-GPT's output structure as it migrates to other process nodes? What improvements will be made going forward so that the model can adapt to new processes without large-scale RL training?
- Currently, reinforcement learning uses ADP (area-delay product) as a single-scalar reward, and the Pareto solution is not explicitly maintained during training. Is there consideration for introducing multi-objective reinforcement learning, with direct sampling during training favoring extremely high-speed or ultra-small area candidates, rather than only post-processing to build Pareto frontiers?
- CEM rerouting only modifies the mapping between signal and port, without altering the compressor position or type; And only optimize critical path slicing. When the circuit has multiple near-critical paths (multiple bottleneck scenarios), the optimization benefit of this module decreases. Have you considered expanding the search scope for rewiring or dynamically identifying multiple candidate slices to further unlock optimization potential?
- All performance evaluations remain at the logic synthesis and STA levels, without layout or routing. RTL with excellent logical synthesis and backend routing introduces line delay and congestion that can affect actual performance. How do you plan to incorporate feedback from layout and routing into the optimization closed loop in the future? Is it possible to lightweightly estimate routing costs and avoid running the full physical implementation every time?
- 64-bit multipliers sacrifice some search sufficiency due to the long sequence tokens, use sliding window attention, and reduce search budget. For multipliers with larger bit widths, besides sliding windows, should we consider a strategy of layered/chunky compression tree generation, solving the memory and efficiency challenges caused by long sequences without significantly reducing search budgets?
5 comments
Response to Reviewer 92Qi
W4, Q2—Multi-Objective Optimization and Pareto Coverage
Thank you for the suggestion. The current ADP reward imposes a fixed area–delay preference and does not guarantee coverage of nondominated solutions under different preferences. A nondominated set obtained through post-processing also does not substitute for multi-objective exploration during training.
HAVE uses Pareto hypervolume gains to guide the selection of preferences and timing constraints. Adaptive Pareto Reset uses current nondominated designs and their perturbations to guide subsequent exploration. Inspired by these approaches, we plan to condition generation on optimization preferences, maintain an archive of nondominated designs during training, and adjust sampling based on frontier coverage, including extreme preferences that emphasize area or delay. We also plan to explore legal perturbations and continuations of compression sequences so that Pareto information can guide training directly, and to evaluate these changes under a matched synthesis budget.
W5, Q3—Rewiring Multiple Near-Critical Paths
Thank you for the suggestion. We agree that multiple near-critical paths can limit the gains from local rewiring. In an early experiment, we considered three paths simultaneously, but the larger search space yielded no clear additional gain under that configuration. We therefore optimize sequentially, rerunning STA after each accepted improvement to update the critical path and candidate slices. We plan to use timing slack to select multiple near-critical paths dynamically and group the search to control its cost. We will evaluate the gains under a matched synthesis budget.
W6—Post-Route Evaluation and Physical Feedback
Thank you for the suggestion. Post-synthesis area and STA delay only partially reflect the effects of interconnects, congestion, and physical optimization. We will clarify this limitation in the revision.
1.Post-Route
We use an OpenROAD placement-and-routing flow with Nangate45. We initialize the floorplan with 30% utilization, a 1.0 aspect ratio, and a 10 μm core boundary margin. We then insert tap cells, generate the power delivery network, and perform global placement, pin placement, detailed placement, global routing, and detailed routing. The target density for global placement is 0.3. After routing, we extract parasitics and check timing, area, and routing. The post-route ADP results are as follows.
| Design | 8-bit | 16-bit | 32-bit | 64-bit |
|---|---|---|---|---|
| MUL-GPT | 218.35 | 1546.74 | 8948.69 | 52794.37 |
| ARITH-DAS | 252.31 | 1626.90 | 9938.16 | 57000.39 |
| ArithTreeRL | 247.06 | 1617.48 | 9618.69 | 58429.97 |
| UFO-MAC | 288.46 | 1935.65 | 10965.27 | 62621.39 |
| GOMIL | 307.82 | 1949.57 | 11029.75 | 60513.83 |
| MUTE | 257.42 | 1743.06 | 10388.68 | 56017.01 |
| Wallace | 306.25 | 1926.72 | 11156.67 | 67251.55 |
| RL-MUL | 267.70 | 1769.64 | 10654.61 | 58000.43 |
2.Future Work
We plan to use a staged evaluation. We will screen candidates through synthesis, then place and globally route a small set of promising designs. We will feed timing under estimated parasitics, wirelength, and congestion back into the optimization loop. We will also calibrate a lightweight cost model with physical implementation data to help evaluate the remaining candidates. The final selected designs will undergo full placement and routing to verify their performance while controlling evaluation cost.
Response to Reviewer 92Qi
W7, Q5—Scaling to Larger Bit Widths
We agree that hierarchical or blockwise generation is a promising direction for scaling to larger bit widths. MUL-GPT uses (column, compression stage, type) tokens to specify compressor choices explicitly. ArithTreeRL and RL-MUL select compressor types or counts by column and then assign stages and connections according to rules. Our finer-grained representation preserves more structural freedom. Even when the FA and HA counts are identical in each column, different stage assignments and connections can produce different propagation paths and arrival times. The tokens describe the structure, while wiring, synthesis, and STA determine the timing.
This representation can produce sequences of more than 4,000 tokens at 64 bits. A global planner could set compression targets for each block while local generators retain the operation-level representation. Blocks would pass carry weights, stages, and arrival times between them, and the complete design would be evaluated as a whole. This approach could shorten local sequences and reduce GPU memory requirements. Whether it can maintain optimization quality under the same search budget remains to be verified.
W8—Model Robustness
Thank you for the suggestion. Our experiments use ideal inputs and fixed evaluation conditions. Systematic perturbation and robustness tests remain to be conducted. The role of per-bit arrival times in guiding adder generation motivates us to include output loads and timing constraints as conditioning features for multiplier generation. We plan to explore training with multiple conditioning inputs and evaluate adaptation across load conditions, timing requirements, and input perturbations to reduce reliance on a single evaluation setup.
Reference
[1]Clark L T, Vashishtha V, Shifren L, et al. ASAP7: A 7-nm finFET predictive process design kit[J]. Microelectronics Journal, 2016, 53: 105-115.
[2]Lu Y C, Nath S, Khandelwal V, et al. Rl-sizer: Vlsi gate sizing for timing optimization using deep reinforcement learning[C]//2021 58th ACM/IEEE Design Automation Conference (DAC). IEEE, 2021: 733-738.
[3]Zhang X, Zhu B, Liu F, et al. Disentangle, align and generalize: Learning a timing predictor from different technology nodes[C]//Proceedings of the 61st ACM/IEEE Design Automation Conference. 2024: 1-6.
Response to Reviewer 92Qi
We sincerely thank you for your careful review and constructive, insightful, and valuable comments. We have uploaded the revised manuscript, with changes highlighted in blue. Below, we provide detailed responses to your questions.
W1, Q1—Process Adaptation and ASAP7 Evaluation
Thank you for your comments. The Nangate45 experiments alone do not establish that the optimization gains transfer directly to other processes. MUL-GPT’s structural representation and legality constraints are process-independent, while performance optimization relies on synthesis and timing feedback from the target process. A change in process therefore requires reoptimization. We will clarify the distinction between adapting the framework and transferring a trained model.
1.Cross-Library Resynthesis of Optimized RTL Designs
When RTL designs optimized under Nangate45 are directly resynthesized using ASAP7[1], the relative ADP rankings of the methods change. Synthesis-feedback-driven optimization may be more closely tailored to the source technology library, so its performance advantages may not transfer directly. Some methods relying on logic-level proxy models perform well in this transfer evaluation.
2.Reoptimization with the ASAP7 Library
However, when optimization is rerun using synthesis feedback from the target library, synthesis-feedback-driven methods often outperform those based on logic-level proxy models. Given the time constraints, we conducted additional 16- and 32-bit experiments at the ASAP7 FF corner with MUL-GPT and two state-of-the-art baselines, ARITH-DAS and ArithTreeRL, to assess the framework’s adaptability to a different process. MUL-GPT achieved lower ADP than both baselines at both bit widths.
3.Future Work
Inspired by RL-Sizer [2], we plan to encode standard-cell area and port timing characteristics as conditioning inputs and train jointly across multiple processes. For a new process, we plan to reuse the existing model and explore calibrating a performance predictor with a small number of target-library synthesis samples, drawing on cross-node timing adaptation in AdaTimer[3]. We will also investigate parameter-efficient fine-tuning to reduce retraining costs.
W2—Computational Cost and Resource Requirements
Thank you for your comments. We agree that repeated logic synthesis and STA calls account for most of MUL-GPT’s computational cost, and that the full search takes considerable time at 32 and 64 bits. Batched sampling and parallel evaluation increase throughput, while the total computational cost remains. Our evaluation flow uses the open-source tools Yosys and OpenROAD and requires no commercial EDA licenses. Researchers with limited hardware can reduce the sampling batch size per iteration.
W3—Scope and Extensions to Other Circuits
Thank you for the suggestion. We focus on multiplier compressor trees built from full and half adders (FAs and HAs). We cover AND and Booth partial-product encodings and evaluate their practical use in MAC units and PE arrays. Our results on compressor and prefix trees suggest that autoregressive generation could extend to other circuits. Its applicability to other arithmetic circuits remains to be established.
We could support asymmetric operand widths by adjusting the initial partial-product distribution and additional compressor types, such as 4:2 compressors, by modifying the legality masks. Division and square root would require new task formulations. We will clarify these scope boundaries in the revision.