STPSim: Accelerating Circuit Simulation via Semi-Tensor Product-Based Parallelism

Recently, semi-tensor product (STP)-based simulators have shown promise by representing logic functions as matrices and performing Boolean operations via matrix multiplication. However, STP approaches face practical challenges, prolonged computation times from continuously expanding internal matrices. This paper presents a novel method for accelerating STP computation to enable more efficient simulation through optimized matrix operations for direct truth table construction. The proposed approach minimizes the size of identity matrices and reconstructs the truth table during canonicalization, effectively reducing matrix dimensions and enhancing STP computation speed. Additionally, a fine-grained matrix partitioning algorithm is introduced, specifically designed for GPU architectures, which dynamically distributes sub-matrix computations across GPU cores. This method is integrated into a state-of-the-art STP simulator, and experimental results demonstrate a performance improvement of 7.79× after its application.

Authors

Institutions

Publication Details

Published
2025-05-09
DOI
https://doi.org/10.1109/iseda65950.2025.11100908
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

STPSim: Accelerating Circuit Simulation via Semi-Tensor Product-Based Parallelism

Yinshui Xia, Chengkai Qiu, Zhufei Chu, Yanzhen Wang et al.
Parallel Computing and Optimization Techniques
article

STPSim: Accelerating Circuit Simulation via Semi-Tensor Product-Based Parallelism

Yinshui Xia, Chengkai Qiu, Zhufei Chu, Yanzhen Wang, Lunyao Wang, Hongyang Pan
article en

Abstract

Recently, semi-tensor product (STP)-based simulators have shown promise by representing logic functions as matrices and performing Boolean operations via matrix multiplication. However, STP approaches face practical challenges, prolonged computation times from continuously expanding internal matrices. This paper presents a novel method for accelerating STP computation to enable more efficient simulation through optimized matrix operations for direct truth table construction. The proposed approach minimizes the size of identity matrices and reconstructs the truth table during canonicalization, effectively reducing matrix dimensions and enhancing STP computation speed. Additionally, a fine-grained matrix partitioning algorithm is introduced, specifically designed for GPU architectures, which dynamically distributes sub-matrix computations across GPU cores. This method is integrated into a state-of-the-art STP simulator, and experimental results demonstrate a performance improvement of 7.79× after its application.

Ningbo University (CN), Fudan University (CN)
Openalex Percentile: Top 79%
Parallel Computing and Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.