Efficient Polynomial Chaos Expansion Method based on Tensor Train Decomposition for High-Dimensional Yield Analysis

With the advancement of technology, process variations have a critical impact on key IC designs. Accurately and efficiently estimating circuit failure rates under process variations has become increasingly challenging due to the "curse of dimensionality" introduced by a large number of random variables. Traditional Monte Carlo methods incur prohibitively high computational costs. In this paper, we propose a meta-modeling approach that integrates polynomial chaos expansion (PCE) with low-rank tensor approximation to effectively address these challenges. This method mitigates the "curse of dimensionality", ensuring that computational cost scales linearly with dimensionality. Specifically, we employ tensor train (TT) decomposition to achieve a low-rank approximation of the original tensor, demonstrating superior performance in SRAM column circuit simulations. Compared to CANDECOMP/PARAFAC (CP) decomposition, the TT-based approximation offers greater accuracy and stability. Additionally, we incorporate sensitivity analysis to further reduce computational costs.

Authors

Institutions

Publication Details

Published
2025-05-09
DOI
https://doi.org/10.1109/iseda65950.2025.11101286
Primary Topic
Probabilistic and Robust Engineering Design
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Polynomial Chaos Expansion Method based on Tensor Train Decomposition for High-Dimensional Yield Analysis

Quan Chen, Hao Zhou
Probabilistic and Robust Engineering Design
article

Efficient Polynomial Chaos Expansion Method based on Tensor Train Decomposition for High-Dimensional Yield Analysis

Quan Chen, Hao Zhou
article en

Abstract

With the advancement of technology, process variations have a critical impact on key IC designs. Accurately and efficiently estimating circuit failure rates under process variations has become increasingly challenging due to the "curse of dimensionality" introduced by a large number of random variables. Traditional Monte Carlo methods incur prohibitively high computational costs. In this paper, we propose a meta-modeling approach that integrates polynomial chaos expansion (PCE) with low-rank tensor approximation to effectively address these challenges. This method mitigates the "curse of dimensionality", ensuring that computational cost scales linearly with dimensionality. Specifically, we employ tensor train (TT) decomposition to achieve a low-rank approximation of the original tensor, demonstrating superior performance in SRAM column circuit simulations. Compared to CANDECOMP/PARAFAC (CP) decomposition, the TT-based approximation offers greater accuracy and stability. Additionally, we incorporate sensitivity analysis to further reduce computational costs.

Southern University of Science and Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 80%
Probabilistic and Robust Engineering Design
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.

Efficient Polynomial Chaos Expansion Method based on Tensor Train Decomposition for High-Dimensional Yield Analysis — Quan Chen, Hao Zhou · (2025) | TGRS Research Map | TGRS