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
- Yinshui Xia
- Chengkai Qiu
- Zhufei Chu (ORCID: https://orcid.org/0000-0001-5718-4822)
- Yanzhen Wang (ORCID: https://orcid.org/0000-0002-8309-4828)
- Lunyao Wang
- Hongyang Pan (ORCID: https://orcid.org/0009-0009-0874-4518)
Institutions
- Ningbo University (CN)
- Fudan University (CN)
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