RTLocating: Intent-aware RTL Localization for Hardware Design Iteration
Authors: Changwen Xing, Yanfeng Lu, Lei Qi, Chenxu Niu, Jie Li, Xi Wang, Yong Chen, Jun Yang
Organizations: School of Integrated Circuits, Southeast University, Nanjing, China · National Center of Technology Innovation for EDA, Nanjing, China · School of Computer Science and Engineering, Southeast University, Nanjing, China · Department of Computer Science, Texas Tech University, Lubbock, USA
Industrial chip development is inherently iterative, favoring localized, intent-driven updates over rewriting RTL from scratch. Yet most LLM-Aided Hardware Design (LAD) work focuses on one-shot synthesis, leaving this workflow underexplored. To bridge this gap, we for the first time formalize ΔSpec-to-RTL localization, a multi-positive problem mapping natural language change requests (ΔSpec) to the affected Register Transfer Level (RTL) syntactic blocks. We propose RTLocating, an intent-aware RTL localization framework, featuring a dynamic router that adaptively fuses complementary views from a textual semantic encoder, a local structural encoder, and a global interaction and dependency encoder (GLIDE). To enable scalable supervision, we introduce EvoRTL-Bench, the first industrial-scale benchmark for intent-code alignment derived from OpenTitan's Git history, comprising 1,905 validated requests and 13,583 ΔSpec-RTL block pairs. On EvoRTL-Bench, RTLocating achieves 0.568 MRR and 15.08% R@1, outperforming the strongest baseline by +22.9% and +67.0%, respectively, establishing a new state-of-the-art for intent-driven localization in evolving hardware designs.
Figures & tables
Figure 1: Intent-Driven RTL Change Localization vs. Surface Matching
Figure 2: Overview of RTLocating Framework.
Tier
LOC Range
#IPs
Share
Lightweight
<1 k
6
16.2%
Small/Utility
1k–5k
15
40.6%
Medium-Scale
5k–10k
8
21.6%
Large-Scale
10k–20k
6
16.2%
High-Complexity
>20 k
2
5.4%
Total
–
37
100.0%
Table 1: OpenTitan IP Complexity Statistics (LOC).
Model
Setting
MRR
MAP
Recall (%)
Hit (%)
R@1
R@5
R@10
H@1
H@5
H@10
Lexical & General Dense Retrievers
BM25
-
0.421
0.292
8.33
28.02
33.90
28.18
59.09
65.45
all-MiniLM-L6-v2
Off-the-shelf
0.373
0.229
7.39
25.56
31.04
22.73
54.55
64.55
Code-Specific Pre-trained Models
CodeBERT
Off-the-shelf
0.110
0.046
0.86
2.21
4.98
5.45
15.45
21.82
Table 2: Main Retrieval Performance of RTLocating and Baselines.
Model
Params (M)
Latency (ms)
CodeBERT
124.65
7.23
GraphCodeBERT
124.65
7.14
UniXcoder
125.93
7.15
Sparse–Dense Hybrid
125.93
14.32
RTLocating (Ours)
23.04
6.25
Table 3: Comparison of Model Parameters and Inference Latency.
Figure 3: RTLocating Ablation Heatmap.
Figure 4: Intent-aware Routing Analysis: (a) encoder weight distributions; (b) PCA of weight clusters; (c) top TF-IDF keywords.
Figure 5: Robustness Analysis via Slope Chart.
Appendix figures & tables5 assets
Supplementary material from the paper’s appendix.
Appendix
Component
Hyperparameter
Value
General Settings
Frameworks
PyTorch, PyG
Random Seed
36
Optimizer
AdamW
Text Expert
Base Model
MiniLM-L6
Appendix
Table 4: Detailed hyperparameters and configurations.
Subsystem Category
IP Modules
Functional Description
Cryptography
aes , hmac , kmac ,
Symmetric encryption, hashing, key management,
& Security
keymgr , csrng
and hardware-based entropy sourcing.
Computing
otbn
High-complexity Big Number accelerator for public-key cryptography.
Infrastructure
tlul , prim
On-chip bus protocols (TileLink) and fundamental hardware primitives.
Storage &
flash_ctrl , otp_ctrl ,
Controller logic for non-volatile memory, SRAM,
Lifecycle
lc_ctrl , sram_ctrl
and hardware lifecycle state management.
Appendix
Table 5: Functional Diversity and Subsystem Representation
Criterion
Pass rate (%)
Label correctness
98.0
Sold/Snew behavioral fidelity
95.0
Context grounded (no change narration)
96.0
Intention supported by message
99.0
Block localization consistent with diff/AST
97.0
Appendix
Table 6: Manual audit checklist and outcomes.
Statistic
Time (s)
#Snapshots
25
Min / Median / Mean
0 / 9 / 17.1
P90 / P95
33.2 / 54.8
Max
110
Total
428
Appendix
Table 7: Offline DTG construction time over 25 representative snapshots.
Metric
Min
Median
Mean
Max
Snapshots per IP
5
71
88.0
389
Avg Nodes per IP
38.2
278.8
418.5
1,980.1
Avg Edges per IP
231
18,607
173,633
1,682,282
Appendix
Table 8: Statistical summary of DTGs across OpenTitan IPs.
Generating implementation-quality RTL with large language models (LLMs) remains difficult because direct generation must resolve microarchitecture while simultaneously producing and debugging low-level code. We present HINT, an executable hardware-intent intermediate representation layer between behavioral specifications or executable oracles and RTL. HINT makes RTL-relevant microarchitecture explicit, supports pre-RTL checking, and supplies explicit RTL-lowering obligations. We evaluate HINT using both a minimal single-agent flow and a full staged workflow. Across seven operator cases, the HINT-mediated route, with no post-synthesis QoR refinement, produces contract-compliant synthesizable RTL on 7/7 cases; Direct C2RTL and C2HLSC apply to five cases and succeed on 5/5 and 1/5, respectively. Under matched Design Compiler synthesis, HINT reduces area by 5.0%--26.2% relative to five manual RTL implementations and by 8.9%--86.1% relative to five accepted Direct C2RTL results. RealBench AES and SDC, together with a Vortex VPU synthesizing to 561.67k~μm2, further demonstrate specification-driven, protocol-rich, memory-rich, and hierarchical designs. In the controlled operator study, the HINT-mediated route shows better observed convergence and avoids the severe implementation-quality degradation seen in several direct-generation results.
Tairan Cheng, Yi Liu, Dongsheng Zuo +6
The Chinese University of Hong Kong Hong Kong, China · Southeast University Nanjing, China
Register Transfer Level (RTL) design translates high-level specifications into hardware using HDLs such as Verilog. Although LLM-based RTL generation is promising, the scarcity of functionally verifiable high-quality data limits both accuracy and diversity. Existing post-training typically produces a single HDL implementation per specification, lacking awareness of RTL variations needed for different design goals. We propose RTLSeek, a post-training paradigm that applies rule-based Diversity-Oriented Reinforcement Learning to improve RTL correctness and diversity. Our Diversity-Centric Multi-Objective Reward Scheduling integrates expert knowledge with EDA feedback, and a three-stage framework maximizes the utility of limited data. Experiments on the RTLLM benchmark show that RTLSeek surpasses prior methods, with ablation results confirming that encouraging broader design-space exploration improves RTL quality and achieves the principle of "the more generated, the better results." Implementation framework, including the dataset, source code, and model weights, is shown at https://anonymous.4open.science/r/DAC2026ID71-ACB4/.
Xinyu Zhang, Zhiteng Chao, Yonghao Wang +6
State Key Lab of Processors, Institute of Computing Technology, Chinese Academy of Sciences, China · University of Chinese Academy of Sciences, China · Peking University, China +1
Large language models (LLMs) have shown strong promise in specification-to-RTL generation. Among the explorations, the self-correction paradigm has significantly advanced LLM-based RTL generation. However, two challenges limit further progress. Existing benchmarks are saturated by advanced LLMs, leaving little room to evaluate the agentic self-correction framework. The monolithic self-correction paradigm rewrites the entire design at once, where LLMs are susceptible to error confusion and corruption of originally correct code. To address the benchmark challenge, we contribute ScaleBench, a more challenging benchmark of 200 complex RTL designs. To address the challenge in methodology, we propose CorrectRTL, an agentic framework that realizes a new decompose-then-correct paradigm, in which the LLM agent explicitly decouples scaffold construction from detailed implementation. CorrectRTL contributes three core techniques: (1)Structure-oriented decomposition, (2)Snippet-based RAG, and (3)~SVA-based self-correction. On ScaleBench, CorrectRTL improves Pass@1 from 20.5% to 49.0% (+28.5%). On VerilogEval, CorrectRTL achieves up to 96.1% Pass@1, demonstrating consistent improvements across both simple and complex designs.
Jing Wang, Shang Liu, Hangan Zhou +4
Hong Kong University of Science and Technology Clear Water Bay, Hong Kong