Liangquan Qiao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Liangquan Qiao has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Fangfa Fu
Department of Electronic Science and Technology, Harbin Institute of Technology
2 shared publications - Jinxiang Wang
Microelectronics Center, Harbin Institute of Technology, Harbin, China
2 shared publications - Bing Yang
Department of Computer Science and Technology, Harbin University of Science and Technology
1 shared publication - Defu Hu
58th Research Institute of China Electronics Technology Group Corporation, Wuxi, China
1 shared publication - Guolin Ning
School of Astronautics, Harbin Institute of Technology
1 shared publication - He Zhou
Department of Electronic Science and Technology, Harbin Institute of Technology
1 shared publication
Latest Publications
- Open Access
- 15 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 31 (6) , 1-23
A Fast and Accurate Single-Event Transient Reliability Analysis of Logic Circuits Using Adaptive Importance Sampling Method
In nanometric integrated circuits, reliability has become one of the main design measures for space and safety-critical applications. This makes the reliability evaluation process an inevitable part of the circuit design flow. The Monte Carlo method typically adopts random sampling for single-event transient reliability evaluation, which leads to large variance in the estimated reliability. To address this issue, we develop an adaptive importance sampling (AIS) method for early stages of the design. AIS has several iterations of sampling region adjustments. By iteratively searching for failure regions, AIS may lead to better efficiency and accuracy. Additionally, a fast fault injection method is proposed to support adaptive importance sampling and multi-dimensional reliability analysis for logic circuits. Furthermore, we design an open-source netlist-level fault injection tool named NFIT . The convergence speed of the AIS method has been demonstrated to achieve up to an 18x acceleration compared to the Monte Carlo method on the ISCAS’85, EPFL, and ALS benchmark suites. We use the NFIT tool to evaluate the effect of circuit structure and targeted hardening on circuit reliability. The results indicate that, for the same Boolean function, the circuit structure has a notable influence on reliability. They also show that hardening a few critical gates can significantly improve circuit reliability.
- 15 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 31 (6) , 1-23
Open AccessA Fast and Accurate Single-Event Transient Reliability Analysis of Logic Circuits Using Adaptive Importance Sampling Method
In nanometric integrated circuits, reliability has become one of the main design measures for space and safety-critical applications. This makes the reliability evaluation process an inevitable part of the circuit design flow. The Monte Carlo method typically adopts random sampling for single-event transient reliability evaluation, which leads to large variance in the estimated reliability. To address this issue, we develop an adaptive importance sampling (AIS) method for early stages of the design. AIS has several iterations of sampling region adjustments. By iteratively searching for failure regions, AIS may lead to better efficiency and accuracy. Additionally, a fast fault injection method is proposed to support adaptive importance sampling and multi-dimensional reliability analysis for logic circuits. Furthermore, we design an open-source netlist-level fault injection tool named NFIT . The convergence speed of the AIS method has been demonstrated to achieve up to an 18x acceleration compared to the Monte Carlo method on the ISCAS’85, EPFL, and ALS benchmark suites. We use the NFIT tool to evaluate the effect of circuit structure and targeted hardening on circuit reliability. The results indicate that, for the same Boolean function, the circuit structure has a notable influence on reliability. They also show that hardening a few critical gates can significantly improve circuit reliability.
- 25 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. PP (02780070) , 1
Automated Cross-Level Verification for Heterogeneous Systems Using Attribute Recursive Hypergraph and Fault-Tolerant Bus Resolver
In the post-Moore era, heterogeneous integrated systems—such as chiplet-based designs—exhibit increasingly complex functional interface interconnections, demanding scalable and accurate verification methods. Traditional manual approaches are time-consuming and error-prone, while mainstream EDA tools lack standardized cross-level models and comprehensive multi-level rule checking. To address these limitations, we propose an automated verification mechanism based on an Attribute Recursive Hypergraph (ARH). The method constructs a five-layer hierarchical mapping network (component → interface → signal cluster → signal → pad) to represent architecture-to-schematic relationships. Verification proceeds in two stages. First, a Fault-Tolerant Bus Resolver (FT-Bus Resolver) applies matrix operations to extract interface structures from pad-netlists and generates a multi-level hypergraph. These structures are compared with system architecture for consistency. Second, a hierarchical rule base, executed by a Rule Executor, validates electrical compatibility and bus-topology constraints across abstraction levels. The implementation integrates a reusable component model library, recursive hypergraph representations, and a rule execution framework, which bridges semantic gaps and supports complex constraint checking. Experiments demonstrate full coverage and 100% correctness for 54 interface-level rules, compared with only one rule supported by commercial EDA tools. Across 7,350 connections and 6,500 injected errors, the framework eliminates all false positives, reduces missed errors by 63%, achieves 1,125×/1,034× speedups for consistency and rule checking, and exhibits near-linear memory growth for scalable deployment. Together, these results demonstrate that the proposed mechanism offers a scalable, robust, and high-coverage solution for cross-level verification in emerging heterogeneous and chiplet-based systems.
- 25 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. PP (02780070) , 1
Automated Cross-Level Verification for Heterogeneous Systems Using Attribute Recursive Hypergraph and Fault-Tolerant Bus Resolver
In the post-Moore era, heterogeneous integrated systems—such as chiplet-based designs—exhibit increasingly complex functional interface interconnections, demanding scalable and accurate verification methods. Traditional manual approaches are time-consuming and error-prone, while mainstream EDA tools lack standardized cross-level models and comprehensive multi-level rule checking. To address these limitations, we propose an automated verification mechanism based on an Attribute Recursive Hypergraph (ARH). The method constructs a five-layer hierarchical mapping network (component → interface → signal cluster → signal → pad) to represent architecture-to-schematic relationships. Verification proceeds in two stages. First, a Fault-Tolerant Bus Resolver (FT-Bus Resolver) applies matrix operations to extract interface structures from pad-netlists and generates a multi-level hypergraph. These structures are compared with system architecture for consistency. Second, a hierarchical rule base, executed by a Rule Executor, validates electrical compatibility and bus-topology constraints across abstraction levels. The implementation integrates a reusable component model library, recursive hypergraph representations, and a rule execution framework, which bridges semantic gaps and supports complex constraint checking. Experiments demonstrate full coverage and 100% correctness for 54 interface-level rules, compared with only one rule supported by commercial EDA tools. Across 7,350 connections and 6,500 injected errors, the framework eliminates all false positives, reduces missed errors by 63%, achieves 1,125×/1,034× speedups for consistency and rule checking, and exhibits near-linear memory growth for scalable deployment. Together, these results demonstrate that the proposed mechanism offers a scalable, robust, and high-coverage solution for cross-level verification in emerging heterogeneous and chiplet-based systems.