Saved in:
Bibliographic Details
Main Authors: Yin, Shuo, Wang, Yihe, Zou, Lancheng, Yao, Xufeng, Chen, Tinghuan, Bai, Chen, Wang, Zhengrong, Ho, Tsung-Yi, Yu, Bei
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2605.17892
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909053908680704
author Yin, Shuo
Wang, Yihe
Zou, Lancheng
Yao, Xufeng
Chen, Tinghuan
Bai, Chen
Wang, Zhengrong
Ho, Tsung-Yi
Yu, Bei
author_facet Yin, Shuo
Wang, Yihe
Zou, Lancheng
Yao, Xufeng
Chen, Tinghuan
Bai, Chen
Wang, Zhengrong
Ho, Tsung-Yi
Yu, Bei
contents Large language models (LLMs) have shown promise in register-transfer level (RTL) design automation, but direct RTL generation remains difficult to validate, optimize, and integrate with compiler-based hardware design flows. Hardware compiler infrastructures such as CIRCT provide typed intermediate representations, legality checks, and optimization passes, yet current LLMs struggle to emit raw compiler IR because of MLIR syntax, SSA discipline, dialect-specific operations, and strict width constraints. This paper presents CPPL, a compiler-mediated design framework that turns LLM-assisted hardware generation into a statically checkable frontend problem rather than an unconstrained RTL text-generation task. CPPL combines a Python frontend DSL for declaring module interfaces and hierarchy with CPPL IR, a JSON-based circuit IR designed to expose compiler-visible structure while remaining accessible to LLMs. The compiler infers operation widths from declared module ports, validates generated IR, checks hierarchy and port bindings, and deterministically lowers the result to CIRCT for synthesizable Verilog generation. On the RTLLM benchmark, CPPL improves functional correctness over direct Verilog and direct CIRCT IR generation, while CIRCT optimization reduces post-synthesis AIG node counts. These results show that a compiler-mediated interface can make LLM-assisted hardware design more reliable, analyzable, and amenable to backend optimization. CPPL is available at https://github.com/SawyDust1228/CPPL.
format Preprint
id arxiv_https___arxiv_org_abs_2605_17892
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle CPPL: A Circuit Prompt Programming Language
Yin, Shuo
Wang, Yihe
Zou, Lancheng
Yao, Xufeng
Chen, Tinghuan
Bai, Chen
Wang, Zhengrong
Ho, Tsung-Yi
Yu, Bei
Hardware Architecture
Large language models (LLMs) have shown promise in register-transfer level (RTL) design automation, but direct RTL generation remains difficult to validate, optimize, and integrate with compiler-based hardware design flows. Hardware compiler infrastructures such as CIRCT provide typed intermediate representations, legality checks, and optimization passes, yet current LLMs struggle to emit raw compiler IR because of MLIR syntax, SSA discipline, dialect-specific operations, and strict width constraints. This paper presents CPPL, a compiler-mediated design framework that turns LLM-assisted hardware generation into a statically checkable frontend problem rather than an unconstrained RTL text-generation task. CPPL combines a Python frontend DSL for declaring module interfaces and hierarchy with CPPL IR, a JSON-based circuit IR designed to expose compiler-visible structure while remaining accessible to LLMs. The compiler infers operation widths from declared module ports, validates generated IR, checks hierarchy and port bindings, and deterministically lowers the result to CIRCT for synthesizable Verilog generation. On the RTLLM benchmark, CPPL improves functional correctness over direct Verilog and direct CIRCT IR generation, while CIRCT optimization reduces post-synthesis AIG node counts. These results show that a compiler-mediated interface can make LLM-assisted hardware design more reliable, analyzable, and amenable to backend optimization. CPPL is available at https://github.com/SawyDust1228/CPPL.
title CPPL: A Circuit Prompt Programming Language
topic Hardware Architecture
url https://arxiv.org/abs/2605.17892