Novel methods to quantify aleatory and epistemic uncertainty in high speed networks

Kapse, Ishan Deepak, author
Roy, Sourajeet, advisor
Pasricha, Sudeep, committee member
Anderson, Charles, committee member
Journal Title
Journal ISSN
Volume Title
With the sustained miniaturization of integrated circuits to sub-45 nm regime and the increasing packaging density, random process variations have been found to result in unpredictability in circuit performance. In existing literature, this unpredictability has been modeled by creating polynomial expansions of random variables. But the existing methods prove inefficient because as the number of random variables within a system increase, the time and computational cost increases in a near-polynomial fashion. In order to mitigate this poor scalability of conventional approaches, several techniques are presented, in this dissertation, to sparsify the polynomial expansion. The sparser polynomial expansion is created, by identifying the contribution of each random variable on the total response of the system. This sparsification is performed primarily using two different methods. It translates to immense savings, in the time required, and the memory cost of computing the expansion. One of the two methods presented is applied to aleatory variability problems while the second method is applied to problems involving epistemic uncertainty. The accuracy of the proposed approaches is validated through multiple numerical examples.
2017 Summer.
Includes bibliographical references.
Rights Access
epistemic uncertainty
uncertainty quantification
fuzzy sets
aleatory uncertainty
Associated Publications