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
- Quan Chen (ORCID: https://orcid.org/0000-0001-5570-2462)
- Hao Zhou (ORCID: https://orcid.org/0000-0002-4715-5486)
Institutions
- Southern University of Science and Technology (CN)
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
- National Natural Science Foundation of China