Kun Wang

Kun Wang

Auto-generated profile, based on publicly available information

Kun Wang

Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 June 2024
Verified
Conference Paper
Open access
KCKaiyan Chang
Kaiyan Chang
KWKun Wang
Kun Wang
NYNan Yang
Nan Yang
YWYing Wang
Ying Wang
DJDantong Jin
Dantong Jin
XLXiaowei Li
Xiaowei Li
Recent advances in large language models have demonstrated their potential for automated generation of hardware description language (HDL) code from high-level prompts. Researchers have utilized fine-tuning to enhance the ability of these large language models (LLMs) in the field of Chip Design. However, the lack of Verilog data hinders further improvement in the quality of Verilog generation by LLMs. Additionally, the absence of a Verilog and electronic design automation (EDA) script data augmentation framework significantly increases the time required to prepare the training dataset for LLM trainers. This paper proposes an automated design-data augmentation framework, which generates high-volume and high-quality natural language aligned with Verilog and EDA scripts. For Verilog generation, it translates Verilog files to an abstract syntax tree and then maps nodes to natural language with a predefined template. For Verilog repair, it uses predefined rules to generate the wrong verilog file and then pairs EDA Tool feedback with the right and wrong verilog file. For EDA Script generation, it uses existing LLM(GPT-3.5) to obtain the description of the Script. To evaluate the effectiveness of our data augmentation method, we finetune Llama2--13B and Llama2-7B models using the dataset generated by our augmentation framework. The results demonstrate a significant improvement in the Verilog generation tasks with LLMs. Moreover, the accuracy of Verilog generation surpasses that of the current state-of-the-art open-source Verilog generation model, increasing from 58.8% to 70.6% with the same benchmark. Our 13B model (ChipGPT-FT1) has a pass rate improvement compared with GPT-3.5 in Verilog generation and outperforms in EDA script (i.e., SiliconCompiler) generation with only 200 EDA script data.

27 October 2024
Verified
Conference Paper
Open access
KCKaiyan Chang
Kaiyan Chang
ZCZhirong Chen
Zhirong Chen
YZYunhao Zhou
Yunhao Zhou
WZWenlong Zhu
Wenlong Zhu
KWKun Wang
Kun Wang
YWYing Wang
Ying Wang

17 October 2025 in ACM Transactions on Design Automation of Electronic Systems
Verified
Journal Article
Open access
KCKaiyan Chang
Kaiyan Chang
WZWenlong Zhu
Wenlong Zhu
KWKun Wang
Kun Wang
XHXinyang He
Xinyang He
NYNan Yang
Nan Yang
YWYing Wang
Ying Wang
Recent advances in large language models (LLMs) have demonstrated significant potential for automated hardware description language (HDL) code generation from high-level specifications. However, two critical challenges limit further progress in this domain: the scarcity of quality Verilog training data and the inability of current approaches to generate RTL code optimized for power, performance, and area (PPA) metrics. This article presents a comprehensive data-centric framework that addresses these limitations through innovations in both pre-fine-tuning data preparation and after-fine-tuning optimization strategies. In the pre-fine-tuning phase, we tackle the data scarcity problem with an automated design-data augmentation framework that generates high-volume, high-quality natural language specifications aligned with corresponding Verilog code and EDA scripts. Our approach creates a complete RTL-level feedback loop by augmenting EDA scripts, RTL code, and EDA tool feedback. In the after-fine-tuning phase, we focus on generating PPA-aware RTL code through a novel search and prompt framework. Our approach implements iterative filtering and selection of LLM-generated Verilog variants while providing high-quality predefined prompts, including composition and interface specifications. To evaluate the effectiveness of our data augmentation method, we fine-tune Llama 2-13B and Llama 2-7B models using the dataset generated by our augmentation framework. The results demonstrate a significant improvement in the Verilog generation tasks with LLMs. Moreover, the accuracy of Verilog generation surpasses that of the current state-of-the-art open-source Verilog generation model, increasing from 58.8% to 70.6% with the same benchmark. Our 13B model has a pass rate improvement compared with GPT-3.5 in Verilog generation and outperforms in EDA script (i.e., SiliconCompiler) generation with only 200 EDA script data. Additionally, to evaluate the effectiveness of the our agent framework, we compare the PPA on the GPT-3.5, where the results show that the agent refined RTL code can have a better quality than the generated RTL code only with GPT-3.5.

20 January 2025
Verified
Conference Paper
Open access
KWKun Wang
Kun Wang
KCKaiyan Chang
Kaiyan Chang
MWMengdi Wang
Mengdi Wang
XZXingqi Zou
Xingqi Zou
HXHaobo Xu
Haobo Xu
YWYing Wang
Ying Wang
Recent advances of large language models in the field of Verilog generation have raised several ethical and security concerns, such as code copyright protection and dissemination of malicious code. Researchers have employed watermarking techniques to identify codes generated by large language models. However, the existing watermarking works fail to protect RTL code copyright due to the significant syntactic and semantic differences between RTL code and software code in languages such as Python. This paper proposes a hardware watermarking framework RTLMarker that embeds watermarks into RTL code and deeper into the synthesized netlist. We propose a set of rule-based Verilog code transformations, ensuring the watermarked RTL code's syntactic and semantic correctness. In addition, we consider an inherent tradeoff between watermark transparency and watermark effectiveness and jointly optimize them. The results demonstrate RTLMarker's superiority over the baseline in RTL code watermarking.

13 December 2025 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
KCKaiyan Chang
Kaiyan Chang
YGYiming Gan
Yiming Gan
WZWenlong Zhu
Wenlong Zhu
KWKun Wang
Kun Wang
ZCZhirong Chen
Zhirong Chen
YWYing Wang
Ying Wang
Photo-realistic rendering in XR applications using algorithms such as 3D Gaussian Splatting has been a bottleneck for real-time performance. GPUs do not provide efficient rendering, and most dedicated accelerators focus on single-object rendering, while nearly all XR scenarios involve multiple objects. We introduce ScaleGS , an algorithm-architecture co-design system designed to close the gap between real-time 3D Gaussian Splatting to real-time XR rendering. Specifically, we focus on multi-object rendering, structuring the XR rendering pipeline from an object-centric perspective and distinguishing static objects from moving ones to reduce unnecessary computations. Importantly, we identify multiple levels of parallelism across different objects and stages within the rendering pipeline, as well as high data reuse between objects within the render stage. Leveraging these insights, our acceleration framework comprises a runtime system, a micro-instruction scheduler, and a hardware accelerator. Extensive evaluations demonstrate that ScaleGS achieves comparable rendering quality to state-of-the-art dedicated 3D Gaussian Splatting accelerators, while improving throughput by 1.35× -2.14× compared with state-of-the-art rendering accelerators. 1

11 April 2026 in ACM Transactions on Design Automation of Electronic Systems
Verified
Journal Article
Open access
KCKaiyan Chang
Kaiyan Chang
WZWenlong Zhu
Wenlong Zhu
KWKun Wang
Kun Wang
XHXinyang He
Xinyang He
NYNan Yang
Nan Yang
YWYing Wang
Ying Wang
This is a corrigendum for the article “A data-centric chip design agent framework for Verilog code generation” published in ACM Trans. Des. Autom. Electron Syst. 30, 6, Article 93 (October 2025), 27 pages.