LocalV: Exploiting Information Locality for IP-level Verilog Generation
Hanqi Lyu, Di Huang, Yaoyu Zhu, Kangcheng Liu, Bohan Dou, Chongxiao Li, Pengwei Jin, Shuyao Cheng, Rui Zhang, Zidong Du, Qi Guo, Xing Hu, Yunji Chen

TL;DR
LocalV introduces a multi-agent framework that exploits information locality to improve IP-level Verilog code generation, addressing scalability and correctness issues faced by existing LLM-based approaches.
Contribution
It presents a novel hierarchical, locality-aware approach combining document partitioning, task planning, and debugging to enhance large-scale hardware description generation.
Findings
LocalV achieves a 45.0% pass rate on RealBench, outperforming SOTA LLMs.
Decomposing tasks into localized subproblems improves code correctness.
The framework effectively handles long, detailed hardware design documents.
Abstract
The generation of Register-Transfer Level (RTL) code is a crucial yet labor-intensive step in digital hardware design, traditionally requiring engineers to manually translate complex specifications into thousands of lines of synthesizable Hardware Description Language (HDL) code. While Large Language Models (LLMs) have shown promise in automating this process, existing approaches-including fine-tuned domain-specific models and advanced agent-based systems-struggle to scale to industrial IP-level design tasks. We identify three key challenges: (1) handling long, highly detailed documents, where critical interface constraints become buried in unrelated submodule descriptions; (2) generating long RTL code, where both syntactic and semantic correctness degrade sharply with increasing output length; and (3) navigating the complex debugging cycles required for functional verification through…
Peer Reviews
Decision·Submitted to ICLR 2026
This paper addresses an underexplored problem: generating functionally correct Verilog code for large-scale, IP-level designs using large language models (LLMs). The proposed LocalV framework builds on the insightful observation of *information locality* in hardware specifications, demonstrating that modular design documents can be decomposed into semantically cohesive segments for localized code generation. The authors provide empirical justification for this hypothesis through an entropy-based
Despite its strong motivation, the technical novelty of LocalV is somewhat incremental compared to prior multi-agent systems such as MAGE and VerilogCoder. The main conceptual contribution lies in leveraging information locality to guide task granularity rather than introducing fundamentally new agent coordination mechanisms. The evaluation scope is also somewhat narrow, as RealBench is the only benchmark used. While the results are encouraging, it remains unclear how well the proposed approach
1. Quantitative validation of Information Locality (Eqs. 1–4, Fig. 3) is a novel and principled idea beyond heuristic agent planning. 2. Dual-level indexing, deterministic planning, and AST-guided debugging form a coherent, effective pipeline. 3. Strong improvement on REALBENCH over model and agent baselines.
1. The framework's core assumption is the availability of a complete, detailed, and well-structured natural-language specification as input. This is a significant prerequisite that defines a more constrained problem setting than what many general-purpose agent systems address. In practice, such a document may not exist and would need to be generated from higher-level requirements, a task not covered by the proposed workflow. The paper should discuss this dependency, as the method's performance i
1. The information locality is intuitive. By grounding the workflow in the modular structure of hardware specifications, this paper establishes a conceptual foundation for decomposing long, complex design documents into smaller, tractable tasks.
1. The granularity of document partitioning and task decomposition is unclear. Since different hardware modules can span multiple paragraphs or share interfaces, it is unclear how partition boundaries are chosen or adapted to maintain coherence across related fragments. 2. The merging and debugging stages appear to rely primarily on observations rather than formal verification. Without stronger guarantees of merging correctness or synthesized design quality (e.g., timing, area), it is difficult
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEmbedded Systems Design Techniques · Formal Methods in Verification · Model-Driven Software Engineering Techniques
