QMQian Ma

Qian Ma

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Qian Ma has a total of 77 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Type-Aware Heterogeneous Graph Network for Circuit Link Prediction

    by Meilin Li, Hui Li, Wenjun Tang, Qian Ma, Feng Min, Rubing Huang, He Jiang, Shikai Guo

    Link prediction for circuit completion is a crucial task in Electronic Design Automation (EDA), aiming to infer missing connections in incomplete circuits to accelerate design workflows and ensure Printed Circuit Board (PCB) reliability. However, due to the practical reality that circuit connectivity is defined by nets that connect specific pins of component instances, existing methods that rely on homogeneous representations and scalar shortest path distances collapse pin-level constraints into a single proximity signal. This collapse obscures component identities and pin semantics, and fails to capture long-range functional paths, which can slow design closure and potentially compromise PCB reliability by increasing the risk of electrically invalid links and subsequent rework. Addressing these challenges, we present a T ype-aware H eterogeneous G raph network for C ircuit link prediction ( THGC ), which enables accurate circuit link prediction by explicitly preserving component functional semantics and modeling type-aware dependencies. Specifically, THGC constructs a circuit-aware heterogeneous graph from netlists to preserve physical connectivity and component semantics, and refines representations through a multi-view encoder with Type-Aware Distance Encoding (TADE) to capture non-local dependencies. It then performs circuit-oriented link prediction using a heterogeneous graph network with dense convolutions and global sort pooling, optimized by a composite objective enforcing topological and semantic consistency, to predict electrically feasible missing connections for circuit completion. Comprehensive experiments are performed on 6,195 circuits collected from three benchmarks, and the results demonstrate that THGC consistently outperforms state-of-the-art methods, achieving up to a 47.51% relative improvement in terms of AUC. These results confirm that THGC effectively preserves component functional semantics and captures type-aware non-local dependencies for accurate circuit link prediction. The source code is available at https://anonymous.4open.science/r/THGC .

  • Structural-Mutation-Based Differential Testing for FPGA Logic Synthesis Compilers

    by Zhihao Xu, Shikai Guo, Guilin Zhao, Siwen Wang, Qian Ma, Hui Li, Furui Zhan

    Field Programmable Gate Arrays (FPGAs) play a crucial role in Electronic Design Automation (EDA) applications, which have been widely used in safety-critical environments, including aerospace, chip manufacturing, and medical devices. A critical stage in FPGA development is logic synthesis, which enables developers to translate their software designs into hardware net lists. However, bugs in FPGA logic synthesis compilers may lead to unexpected behaviors in target hardware net lists, which may cause potential security risks. Therefore, it is critical to detect and repair such bugs in FPGA logic synthesis compilers. While recent testing methods have made progress in automatic bug detection, they remain limited by a fundamental weakness, the generated test cases exhibit minimal timing complexity and structural diversity. To address this challenge, we propose a mutation-based method integrated with Bayesian optimization to detect bugs in FPGA logic synthesis compilers. The method, called SmootHDL, consists with three key components, the Test-program Generation Component (TPG), the Bayesian Diversity Selection Component (BDS), and the Equivalent Test Check Component (ETC). SmootHDL starts with a set of test cases which are called original test cases. To expand the timing test space, the TPG use a control-flow mutation strategy to generate new test cases which is functional equivalent with the original test cases. Furthermore, for increasing diversity of the generated test cases, the BDS combine the Bayesian optimizer to construct a selector based on the control-flow diversity. Finally, the ETC identifies bugs by comparing simulation outputs between original and generated test cases. Since the mutations preserve functional equivalence, functional equivalent test case should have same output. When SmootHDL detects any discrepancy between the outputs, it indicates a potential compiler bug. SmootHDL then reproduces the inconsistent behavior and reports the bug to official developers. We evaluated our method on the mainstream FPGA logic synthesis compilers. Experiments show that SmootHDL can generate more diverse test cases and detect more bugs compared with the latest testing methods for FPGA logic synthesis compilers. Over three months, SmootHDL found 16 bugs, 12 of which were confirmed by official technical support, and 6 have already been fixed.

  • Open Access

    Co-Design of Circuit Representations: Cross-Modal Graph Matching for Verilog-AIG Alignment

    by Yichuan Zhai, Shikai Guo, Qian Ma, Furui Zhan, Min Feng, Hui Li

    Circuit representations are essential for modeling large-scale digital circuits and facilitating efficient logic synthesis analysis. However, due to the inherent complexity of structural dependencies and functional interactions, existing approaches often struggle with inconsistencies between structural and functional behaviors. To address these issues, we propose AlignAIG, a novel framework for global circuit representation learning that ensures structural-functional consistency. Specifically, AlignAIG integrates a global message-passing network to capture long-range dependencies across large-scale circuits and employs a structured masking strategy that safeguards critical logic while selectively masking gates with minimal impact. Furthermore, AlignAIG introduces a cross-modal alignment decoder that utilizes attention mechanisms to align Verilog semantic features with circuit structural representations, enhancing the coherence between these two modalities. Extensive experiments on 65,500 circuit-structure files and 40,000 Verilog-AIG equivalence pairs across arithmetic, control and industrial domains demonstrate the effectiveness of AlignAIG. In the logic equivalence task, AlignAIG improves AUC by 17.01% and F1-score by 36.45% over state-of-the-art models on the global dataset. Additionally, it obtains an average gain of 39.7% in NDCG and 12.2% in the Top-𝑘% Commonality for QoR prediction. The source code is available at https: //github.com/zhongmoxingzhe/Cross_Modal_Graph_Matching_for_Verilog_AIG_Alignment.

  • Open Access

    ReCATS: Replay-Free Continual Anomaly Detection for Non-Stationary Multivariate Time Series

    by Qiuyang Li, Qian Ma, Zhongming Yao, Shikai Guo, Yu Gu, Ge Yu, Tianyi Li

  • Open Access

    PhaseConeGNN: A Phase-Aware Logic-Cone Graph Neural Network for Equivalent-Gate Identification

    by Fangzhou Zhang, Shikai Guo, Qifan Zhang, Xin Ge, Qian Ma, Wenjun Tang, Hui Li, Yongpeng Weng

    Equivalent-gate identification in And-Inverter Graphs (AIGs) aims to identify logic gates with identical or highly similar Boolean functionality, which can support logic optimization, redundancy detection, technology mapping, and functional verification. However, structurally heterogeneous AIGs contain complemented edges with explicit phase-transition semantics, and functionally equivalent gates may be distributed across different logic-cone structures and circuit scales. These characteristics pose challenges for learning-based equivalentgate identification methods, as they usually do not explicitly model complemented-edge-induced phase transitions during representation propagation and may have limited ability to align functionally equivalent gate representations under diverse logic-cone structures and circuit-scale variations. To address these challenges, this paper proposes PhaseConeGNN, a phaseaware logic-cone graph neural network for equivalent-gate identification in AIGs. Specifically, PhaseConeGNN employs phase-aware propagation, stable representation propagation, and a mixture-of-experts fusion mechanism to capture inversion-sensitive signal semantics, alleviate representation drift in heterogeneous AIG structures, and integrate logiccone information at different depths, thereby improving the identification of functionally equivalent gates under diverse circuit structures. Comprehensive experiments are conducted on 83,155 Sub-AIG samples constructed from publicly available open-source Verilog RTL repositories, which are synthesized and further converted into AIG graph samples through a standard EDA flow. The results indicate that PhaseConeGNN achieves more accurate gate-pair functional similarity estimation than the compared baselines, with 25.30% MAE reduction and 25.15% RMSE reduction over the best-performing baseline. These results indicate that PhaseConeGNN can learn phase-consistent and structure-robust gate-level functional representations for AIGs from open-source RTL designs. The source code is available at https://anonymous.4open.science/r/PhaseConeGNN-3607.

  • Open Access

    Architecture-Aware Multi-Scale Modeling with Self- and Cross-Attention for Dynamic IR Drop Analysis

    by Xianjing Zhu, Shikai Guo, Sihang Zhang, Wenjun Tang, Feng Min, Furui Zhan, Qian Ma, Ning Wang, Hui Li, He Jiang

    With the continued advancement of Very Large-Scale Integration (VLSI) technology, IR drop in Power Delivery Networks (PDNs) poses a serious threat to chip performance and reliability. Due to the complex cross-scale interactions between local hotspots and global power paths in real-world scenarios, existing approaches face the challenges of lacking a coupled representation of multi-scale features and ignoring long-range dependencies and spatiotemporal feature fusion. This severely limits the ability of IR drop prediction approaches to capture voltage-drop hotspots, undermining the accuracy and reliability of their predictions. Therefore, this paper proposes a novel prediction framework named IR-Hunter. IR-Hunter first employs heterogeneous convolution kernels to model local electrothermal hotspots and global PDN impedance distributions, precisely capturing hotspot locations and macro-scale current-flow paths critical for chip layout and routing. Then, it adaptively fuses these multi-scale features. Additionally, IR-Hunter learns global power interactions within the PDN to identify long-range voltage coupling effects affecting routing and power-grid stability. Finally, IR-Hunter leverages cross-metal-layer current propagation pathways, efficiently integrating cross-scale spatiotemporal information between the encoder and decoder stages, consistently improving IR drop prediction accuracy during chip design. Comprehensive experiments conducted on 20,578 samples collected from over 20K instances demonstrate IR-Hunter’s superior prediction accuracy, achieving an average 4.57% NRMSE reduction and 4.12% SSIM improvement compared to state-of-the-art approaches. Additionally, to foster advancements in the EDA community, we have open-sourced the code at https://github.com/xhhlzy/IR-Hunter.

  • Open Access

    CircScale: Learning Scale-Adaptive Circuit Representations for Logic Synthesis Optimization

    by Yixuan Ma, Shikai Guo, Qian Ma, Lehuan Zhang, Yongpeng Weng, Furui Zhan, Hui Li

    Logic Synthesis Optimization systematically transforms And-Inverter Graph (AIG) circuits through representation-guided transformations to improve circuit quality, serving as a critical step in Electronic Design Automation (EDA) workflows. However, real-world logic synthesis involves circuits with highly heterogeneous scales and dynamically evolving topologies. These characteristics pose significant challenges for previous circuit representation learning methods, which often struggle with the heterogeneous scale bottleneck and fail to capture the dynamic nature of optimization in static graph representations. This paper proposes CircScale, a framework that learns scale-adaptive circuit representations for logic synthesis optimization. Specifically, CircScale employs multi-hop neighborhood aggregation with circuit-aware gating to dynamically balance structural features across heterogeneous scales. It further introduces an early graph-sequence interaction mechanism that models circuit evolution and dynamically guides the optimization process. Comprehensive experiments are performed on 124,500 circuit-sequence pairs collected from five benchmarks, and the results demonstrate the superior representation capability of CircScale, achieving 14.89%-38.39% delay reduction and 23.89%-38.87% area improvement over state-of-the-art methods. These results confirm that CircScale effectively learns comprehensive and adaptive circuit representations for logic synthesis optimization. The source code is available at https://github.com/VNH0826/CircScale/.

  • Open Access

    DeepTempo: Learning Temporal Circuit Behaviors of Logic Gates

    by Yixuan Ma, Shikai Guo, Siwen Wang, Qian Ma, Furui Zhan, Yongpeng Weng, Hui Li

    With the continuous evolution of integrated circuit technology toward higher complexity and larger scales, modern Electronic Design Automation (EDA) workflows demand sophisticated representation and analysis techniques to achieve optimal circuit design performance, power consumption, and reliability. And-Inverter Graphs (AIGs) serve as a fundamental structure for core EDA tasks, efficiently enabling logic synthesis, equivalence checking, and functional verification to enhance development efficiency. However, the growing complexity and integration density of modern circuits introduce increasingly intricate temporal signal propagation patterns and multi-layered feature interactions, which leads existing works ignoring temporal signal propagation dependencies and facing feature homogenization among deep aggregation in the accurate AIG representation learning. To address these challenges, we propose DeepTempo, a spatio-temporal joint modeling framework that effectively captures temporal signal propagation dependencies and preserves spatial features during deep aggregation to enable accurate AIG representation learning. Specifically, DeepTempo incorporates temporal convolution mechanisms to model sequential signal propagation, to capture the temporal dependencies inherent in circuit behavior. In addition, DeepTempo employs adaptive gating and cross-reconstruction strategies to preserve gate-specific functional distinctiveness during multi-layer feature aggregation, effectively mitigating feature homogenization problems to enhance discriminative modeling and achieve accurate AIG representation. We conduct comprehensive experiments on 9,933 valid circuit samples from multiple EDA benchmark domains covering logic synthesis, circuit testing, and hardware design to evaluate the effectiveness of DeepTempo in AIG representation learning. Experimental results on the Signal Probability Prediction (SPP) task and Truth-Table Distance Prediction (TTDP) task demonstrate that DeepTempo outperforms state-of-theart methods, achieving improvements of 14.29% (MAE) and 20.0% (MSE) on SPP, and achieving 21.35% (MAE) and 4.55% (MSE) on TTDP. We have open-sourced the project on GitHub to facilitate the advancement and development of defect prediction-related technologies .

  • Open Access

    Architecture-Aware Multi-Scale Modeling with Self-and Cross-Attention for Dynamic IR Drop Analysis

    by Xianjing Zhu, Shikai Guo, Sihang Zhang, Wenjun Tang, Min Feng, Furui Zhan, Qian Ma, Ning Wang, Jiang He

    With the continued advancement of Very Large-Scale Integration (VLSI) technology, IR drop in Power Delivery Networks (PDNs) poses a serious threat to chip performance and reliability. Due to the complex cross-scale interactions between local hotspots and global power paths in real-world scenarios, existing approaches face the challenges of lacking a coupled representation of multi-scale features and ignoring long-range dependencies and spatiotemporal feature fusion. This severely limits the ability of IR drop prediction approaches to capture voltage-drop hotspots, undermining the accuracy and reliability of their predictions. Therefore, this paper proposes a novel prediction framework named IR-Hunter. IR-Hunter first employs heterogeneous convolution kernels to model local electrothermal hotspots and global PDN impedance distributions, precisely capturing hotspot locations and macro-scale current-flow paths critical for chip layout and routing. Then, it adaptively fuses these multi-scale features. Additionally, IR-Hunter learns global power interactions within the PDN to identify long-range voltage coupling effects affecting routing and power-grid stability. Finally, IR-Hunter leverages cross-metal-layer current propagation pathways, efficiently integrating cross-scale spatiotemporal information between encoder and decoder stages, consistently improving IR drop prediction accuracy during chip design. Comprehensive experiments conducted on 20,578 samples collected from over 20K instances demonstrate IR-Hunter’s superior prediction accuracy, achieving an average 4.57% NRMSE reduction and 4.12% SSIM improvement compared to state-of-the-art approaches. Additionally, to foster advancements in the EDA community, we have open-sourced the code at https://github.com/xhhlzy/IR-Hunter.