CSpace
Efficient large-scale sparse LU factorization for fast radio frequency circuit simulation
Feng, Guofeng1,2; Wang, Hongyu1,3; Guo, Zhuoqiang1,2; Li, Mingzhen1,2; Zhao, Tong1,2; Jin, Zhou4; Jia, Weile1,2; Tan, Guangming1,2; Sun, Ninghui1,2
2025-12-07
发表期刊INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS
ISSN1094-3420
页码18
摘要Sparse LU factorization is a fundamental operation in circuit simulation, and its efficiency directly impacts the overall simulation performance, particularly for large-scale circuits. As the demand for high-performance simulation of radio frequency (RF) circuits increases, driven by the proliferation of advanced wireless communication technologies such as 5G and WiFi, optimizing RF circuit simulation has become crucial. RF simulation matrices, often sparse, exhibit a unique structure characterized by dense blocks. This distinct structural pattern has been underexplored in prior works, resulting in suboptimal exploitation of available computational resources. In this paper, we address this gap by proposing a novel blocked format for the L and U factors in sparse LU factorization, explicitly tailored to the block structure inherent in RF matrices. This approach facilitates a more efficient representation of the data objects in LU factorization by preserving and exploiting the spatial locality of RF matrices. We then redesign the sparse LU factorization algorithm, aligning it with our proposed blocked storage format. Our algorithm leverages the inherent data locality present in RF matrices, which not only reduces memory transactions but also minimizes the need for costly indirect memory access that typically degrades performance. The proposed data format transformation is streamlined to remove redundant data movement, mitigating the memory-bound operations. Furthermore, we convert vector-based operations into matrix operations, which significantly enhances data reuse and enables more efficient parallelization at the data level. By aligning computational patterns with the underlying memory hierarchy, our method improves computational efficiency. Experimental results demonstrate that our approach substantially outperforms existing state-of-the-art implementations, achieving notable performance improvements, and thereby providing advanced support for high-performance large-scale RF circuit simulation.
关键词sparse LU factorization RF circuit simulation performance optimization
DOI10.1177/10943420251400893
收录类别SCI
语种英语
WOS研究方向Computer Science
WOS类目Computer Science, Hardware & Architecture ; Computer Science, Interdisciplinary Applications ; Computer Science, Theory & Methods
WOS记录号WOS:001631478200001
出版者SAGE PUBLICATIONS LTD
引用统计
文献类型期刊论文
条目标识符http://119.78.100.204/handle/2XEOYT63/42976
专题中国科学院计算技术研究所
通讯作者Li, Mingzhen
作者单位1.Chinese Acad Sci, Inst Comp Technol, State Key Lab Processors, 6 Kexueyuan Nanlu, Beijing 100190, Peoples R China
2.Univ Chinese Acad Sci, Beijing, Peoples R China
3.Univ Chinese Acad Sci, Sch Adv Interdisciplinary Sci, Beijing, Peoples R China
4.Zhejiang Univ, Zhejiang, Peoples R China
推荐引用方式
GB/T 7714
Feng, Guofeng,Wang, Hongyu,Guo, Zhuoqiang,et al. Efficient large-scale sparse LU factorization for fast radio frequency circuit simulation[J]. INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS,2025:18.
APA Feng, Guofeng.,Wang, Hongyu.,Guo, Zhuoqiang.,Li, Mingzhen.,Zhao, Tong.,...&Sun, Ninghui.(2025).Efficient large-scale sparse LU factorization for fast radio frequency circuit simulation.INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS,18.
MLA Feng, Guofeng,et al."Efficient large-scale sparse LU factorization for fast radio frequency circuit simulation".INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS (2025):18.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Feng, Guofeng]的文章
[Wang, Hongyu]的文章
[Guo, Zhuoqiang]的文章
百度学术
百度学术中相似的文章
[Feng, Guofeng]的文章
[Wang, Hongyu]的文章
[Guo, Zhuoqiang]的文章
必应学术
必应学术中相似的文章
[Feng, Guofeng]的文章
[Wang, Hongyu]的文章
[Guo, Zhuoqiang]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。