Shuo Yin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Shuo Yin has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Bei Yu
The Chinese University of Hong Kong
7 shared publications - Su Zheng
Computer Science and Engineering, The Chinese University of Hong Kong
3 shared publications - Wenqian Zhao
The Chinese University of Hong Kong
3 shared publications - Yuzhe Ma
The Hong Kong University of Science and Technology - Guangzhou Campus
3 shared publications - Ziyang Yu
The Chinese University of Hong Kong
3 shared publications - Jiahao Xu
The Chinese University of Hong Kong
2 shared publications
Latest Publications
- Open Access
- 2 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 32 (1) , 1-25
ODCGate: Leveraging Observability Don’t Care Conditions for Enhanced Power Efficiency in Clock Gating
Clock gating reduces dynamic power by integrating activation functions and integrated clock gating (ICG) cells into the clock path, selectively disabling the clock signal to register when unnecessary. While conventional activation function extraction methods rely on manual design or register-transfer level analysis, a gate-level alternative exists: deriving activation functions through the extraction of observability don’t care (ODC) conditions from the underlying netlist. This article presents ODCGate , a framework designed to automatically detect ODC conditions as the activation functions and safely block clock transitions for unused registers, thereby further reducing dynamic power consumption during clock gating. The computation begins with cut boundary enumeration and simulation. To further minimize additional PPA overhead, we apply hybrid simplification techniques to the extracted logic, and enable sharing among registers through clustering. Experimental results show that, beyond the clock gating optimization of a commercial logic synthesis tool, our method achieves an average 33.46% additional reduction in dynamic power, with minimal impact on other PPA metrics.
- 2 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 32 (1) , 1-25
Open AccessODCGate: Leveraging Observability Don’t Care Conditions for Enhanced Power Efficiency in Clock Gating
Clock gating reduces dynamic power by integrating activation functions and integrated clock gating (ICG) cells into the clock path, selectively disabling the clock signal to register when unnecessary. While conventional activation function extraction methods rely on manual design or register-transfer level analysis, a gate-level alternative exists: deriving activation functions through the extraction of observability don’t care (ODC) conditions from the underlying netlist. This article presents ODCGate , a framework designed to automatically detect ODC conditions as the activation functions and safely block clock transitions for unused registers, thereby further reducing dynamic power consumption during clock gating. The computation begins with cut boundary enumeration and simulation. To further minimize additional PPA overhead, we apply hybrid simplification techniques to the extracted logic, and enable sharing among registers through clustering. Experimental results show that, beyond the clock gating optimization of a commercial logic synthesis tool, our method achieves an average 33.46% additional reduction in dynamic power, with minimal impact on other PPA metrics.
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Coordinated Clip-Wise Gradient Scheduling for Full-Chip ILT via Policy Learning
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessCoordinated Clip-Wise Gradient Scheduling for Full-Chip ILT via Policy Learning
- Open Access
- 14 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 31 (6) , 1-27
FuILT-S: Full Chip ILT With Unified Boundary Healing and SRAF Co-Optimization
Mask optimization in lithography is becoming increasingly important as the technology node size shrinks down. Inverse Lithography Technology (ILT) remains one of the most robust and high-performance solutions adopted in industry, yet it suffers from significant computational overhead and complexity. With the growing scale of transistor integration, industry attention has shifted toward improving efficiency and workload scalability. However, most recent academic efforts remain confined to localized pattern restoration regardless of full-chip manufacturing conditions. In this work, we present FuILT-S , a practical full-chip ILT-based mask optimization framework that incorporates sub-resolution assist features (SRAFs) co-optimization to address real-world manufacturing challenges. To enable full-chip scalability, we build a multi-level partitioning strategy following the divide-and-conquer mindset, paired with a workload distribution framework for efficient multi-GPU parallelization. To fix inter-region boundary stitching artifacts, we propose a gradient-fusion technique alongside a multi-level healing strategy. Furthermore, by leveraging rich information from the fused gradient and mask intensity maps, we integrate an SRAF generation module co-optimized with the main layout patterns. Experimental results across different layers from real-world designs demonstrate that FuILT-S is both effective and generalizable. Our framework is open-sourced at https://github.com/OpenOPC/OpenFuILT.
- 14 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 31 (6) , 1-27
Open AccessFuILT-S: Full Chip ILT With Unified Boundary Healing and SRAF Co-Optimization
Mask optimization in lithography is becoming increasingly important as the technology node size shrinks down. Inverse Lithography Technology (ILT) remains one of the most robust and high-performance solutions adopted in industry, yet it suffers from significant computational overhead and complexity. With the growing scale of transistor integration, industry attention has shifted toward improving efficiency and workload scalability. However, most recent academic efforts remain confined to localized pattern restoration regardless of full-chip manufacturing conditions. In this work, we present FuILT-S , a practical full-chip ILT-based mask optimization framework that incorporates sub-resolution assist features (SRAFs) co-optimization to address real-world manufacturing challenges. To enable full-chip scalability, we build a multi-level partitioning strategy following the divide-and-conquer mindset, paired with a workload distribution framework for efficient multi-GPU parallelization. To fix inter-region boundary stitching artifacts, we propose a gradient-fusion technique alongside a multi-level healing strategy. Furthermore, by leveraging rich information from the fused gradient and mask intensity maps, we integrate an SRAF generation module co-optimized with the main layout patterns. Experimental results across different layers from real-world designs demonstrate that FuILT-S is both effective and generalizable. Our framework is open-sourced at https://github.com/OpenOPC/OpenFuILT.
- 1 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 45 (2) , 929-942
Oiso: Outlier-Isolated Data Format for Low-Bit Large Language Model Quantization
The scale of large language models (LLMs) has steadily increased over time, leading to enhanced performance in multimodal understanding and complex reasoning, but with significant execution overhead on hardware. Quantization is a promising approach to reduce computation and memory overhead for LLM deployment. However, maintaining accuracy and efficiency simultaneously is challenging due to the presence of outliers. Moreover, low-bit quantization tends to deteriorate accuracy due to its limited precision. Existing outlier-aware quantization/hardware co-design methods split the sparse outliers from the normal values with dedicated encoding schemes. However, such separation produces a nonuniform data format for normal values and outliers, leading to additional hardware design and inefficient memory access. This article presents an outlier-isolated data format (Oiso) for low-bit LLM quantization called Oiso. Oiso is a unified representation for both outliers and normal values. It isolates the normal values from the outliers, which can reduce the impact of outliers on the normal values during the quantization process. Taking advantage of the uniform format, Oiso arithmetic can be performed using a homogeneous computational unit, and Oiso values can be stored in a standardized format. Hierarchical block encoding with a subblock alignment scheme is introduced to reduce the encoding cost and the hardware overhead. We introduce the Oiso architecture, equipped with Oiso processing elements and encoders tailored for Oiso arithmetic, realizing efficient low-bit LLM inference. Oiso quantization can push the limits of low-bit LLM quantization, and the Oiso accelerator outperforms the state-of-the-art outlieraware accelerator design with $1.26\times $ performance improvement and 25% energy reduction.
- 1 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 45 (2) , 929-942
Oiso: Outlier-Isolated Data Format for Low-Bit Large Language Model Quantization
The scale of large language models (LLMs) has steadily increased over time, leading to enhanced performance in multimodal understanding and complex reasoning, but with significant execution overhead on hardware. Quantization is a promising approach to reduce computation and memory overhead for LLM deployment. However, maintaining accuracy and efficiency simultaneously is challenging due to the presence of outliers. Moreover, low-bit quantization tends to deteriorate accuracy due to its limited precision. Existing outlier-aware quantization/hardware co-design methods split the sparse outliers from the normal values with dedicated encoding schemes. However, such separation produces a nonuniform data format for normal values and outliers, leading to additional hardware design and inefficient memory access. This article presents an outlier-isolated data format (Oiso) for low-bit LLM quantization called Oiso. Oiso is a unified representation for both outliers and normal values. It isolates the normal values from the outliers, which can reduce the impact of outliers on the normal values during the quantization process. Taking advantage of the uniform format, Oiso arithmetic can be performed using a homogeneous computational unit, and Oiso values can be stored in a standardized format. Hierarchical block encoding with a subblock alignment scheme is introduced to reduce the encoding cost and the hardware overhead. We introduce the Oiso architecture, equipped with Oiso processing elements and encoders tailored for Oiso arithmetic, realizing efficient low-bit LLM inference. Oiso quantization can push the limits of low-bit LLM quantization, and the Oiso accelerator outperforms the state-of-the-art outlieraware accelerator design with $1.26\times $ performance improvement and 25% energy reduction.
- Open Access
- 17 March 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
EasyMRC: Efficient Mask Rule Checking via Representative Edge Sampling
The photolithography process is getting more sophisticated with technology node scaling down and VLSI designs becoming complex. As photomask patterns get finer, mask rule checks (MRCs) are inevitable to avoid discrepancies in the layout and to ensure manufacturability. This paper introduces an efficient mask rule checking approach that utilizes a representative edge sampling scheme. The representative edge sampling scheme selects a subset of edges and points of each polygon that capture its contour, meanwhile greatly reducing the number of edges involved in actual checking. Experimental results demonstrate that the proposed approach achieves significant speedup compared with the state-of-the-art academic tool.
- 17 March 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
Open AccessEasyMRC: Efficient Mask Rule Checking via Representative Edge Sampling
The photolithography process is getting more sophisticated with technology node scaling down and VLSI designs becoming complex. As photomask patterns get finer, mask rule checks (MRCs) are inevitable to avoid discrepancies in the layout and to ensure manufacturability. This paper introduces an efficient mask rule checking approach that utilizes a representative edge sampling scheme. The representative edge sampling scheme selects a subset of edges and points of each polygon that capture its contour, meanwhile greatly reducing the number of edges involved in actual checking. Experimental results demonstrate that the proposed approach achieves significant speedup compared with the state-of-the-art academic tool.
- 15 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 44 (5) , 1915-1927
RuleLearner: OPC Rule Extraction From Inverse Lithography Technique Engine
Model-based Optical Proximity Correction (OPC) with Sub-Resolution Assist Feature (SRAF) generation is a critical standard practice for compensating lithography distortions in the fabrication of integrated circuits at advanced technology nodes. Typical model-based OPC and SRAF algorithms involve the selection of user-controlled rule parameters. Conventionally, these rules are heuristically determined and applied globally throughout the correction regions, which can be time-consuming and require expert knowledge of the tool. Additionally, the correlations of rule parameters to the objectives are highly nonlinear. All these factors make designing a high-performance OPC engine for complex metal designs a non-trivial task. This paper proposes RuleLearner, a comprehensive mask optimization system designed for SRAF generation and model-based OPC in real industrial scenarios. The proposed framework learns from the guidance of an information-augmented ILT engine, which, although expressive for complex designs, is expensive to generate refined masks for a whole set of design clips. Considering the non-linearity and the trade-off between local and global performance, the extracted rule value distributions are further optimized with customized natural gradients. The sophisticated SRAF generation, the edge segmentation and movements are then guided by the rule parameter. Experimental results show that RuleLearner can be applied across different complex design patterns and achieve the best lithographic performance and computational efficiency.
- 15 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 44 (5) , 1915-1927
RuleLearner: OPC Rule Extraction From Inverse Lithography Technique Engine
Model-based Optical Proximity Correction (OPC) with Sub-Resolution Assist Feature (SRAF) generation is a critical standard practice for compensating lithography distortions in the fabrication of integrated circuits at advanced technology nodes. Typical model-based OPC and SRAF algorithms involve the selection of user-controlled rule parameters. Conventionally, these rules are heuristically determined and applied globally throughout the correction regions, which can be time-consuming and require expert knowledge of the tool. Additionally, the correlations of rule parameters to the objectives are highly nonlinear. All these factors make designing a high-performance OPC engine for complex metal designs a non-trivial task. This paper proposes RuleLearner, a comprehensive mask optimization system designed for SRAF generation and model-based OPC in real industrial scenarios. The proposed framework learns from the guidance of an information-augmented ILT engine, which, although expressive for complex designs, is expensive to generate refined masks for a whole set of design clips. Considering the non-linearity and the trade-off between local and global performance, the extracted rule value distributions are further optimized with customized natural gradients. The sophisticated SRAF generation, the edge segmentation and movements are then guided by the rule parameter. Experimental results show that RuleLearner can be applied across different complex design patterns and achieve the best lithographic performance and computational efficiency.
- Open Access
- 23 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
WinoGen: A Highly Configurable Winograd Convolution IP Generator for Efficient CNN Acceleration on FPGA
The convolution neural network (CNN) has been widely adopted in computer vision tasks. In the FPGA-based CNN accelerator design, Winograd convolution can effectively improve computation performance and save hardware resources. However, building efficient and highly compatible IP for arbitrary Winograd convolution on FPGA remains underexplored. To address this issue, we propose a novel and efficient reformulation of Winograd convolution, named Structured Direct Winograd Convolution (SDW). We further develop WinoGen, a Chisel-based highly configurable Winograd convolution IP generator. Given arbitrary input/output tile size and kernel size, it can generate optimized high-performance IP automatically. Meanwhile, our generated IP can be compatible with multiple kernel sizes and tile sizes. Experimental results show that the IP generated by WinoGen achieves DSP efficiency up to 3.80 GOPS/DSP and energy efficiency up to 652.77 GOPS/W while showing 2.45× and 3.10× improvements when processing a same CNN model compared with state-of-the-arts.
- 23 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessWinoGen: A Highly Configurable Winograd Convolution IP Generator for Efficient CNN Acceleration on FPGA
The convolution neural network (CNN) has been widely adopted in computer vision tasks. In the FPGA-based CNN accelerator design, Winograd convolution can effectively improve computation performance and save hardware resources. However, building efficient and highly compatible IP for arbitrary Winograd convolution on FPGA remains underexplored. To address this issue, we propose a novel and efficient reformulation of Winograd convolution, named Structured Direct Winograd Convolution (SDW). We further develop WinoGen, a Chisel-based highly configurable Winograd convolution IP generator. Given arbitrary input/output tile size and kernel size, it can generate optimized high-performance IP automatically. Meanwhile, our generated IP can be compatible with multiple kernel sizes and tile sizes. Experimental results show that the IP generated by WinoGen achieves DSP efficiency up to 3.80 GOPS/DSP and energy efficiency up to 652.77 GOPS/W while showing 2.45× and 3.10× improvements when processing a same CNN model compared with state-of-the-arts.