A Powerful Optimization Tool for Analog Integrated Circuits Design

This paper presents a new optimization tool for analog circuit design. Proposed tool is based on the robust version of the differential evolution optimization method. Corners of technology, temperature, voltage and current supplies are taken into account during the optimization. That ensures robust resulting circuits. Those circuits usually do not need any schematic change and are ready for the layout.. The newly developed tool is implemented directly to the Cadence design environment to achieve very short setup time of the optimization task. The design automation procedure was enhanced by optimization watchdog feature. It was created to control optimization progress and moreover to reduce the search space to produce better design in shorter time. The optimization algorithm presented in this paper was successfully tested on several design examples

Development of an experiment-based robust design paradigm for multiple quality characteristics using physical programming

The well-known quality improvement methodology, robust design, is a powerful and cost-effective technique for building quality into the design of products and processes. Although several approaches to robust design have been proposed in the literature, little attention has been given to the development of a flexible robust design model. Specifically, flexibility is needed in order to consider multiple quality characteristics simultaneously, just as customers do when judging products, and to capture design preferences with a reasonable degree of accuracy. Physical programming, a relatively new optimization technique, is an effective tool that can be used to transform design preferences into specific weighted objectives. In this paper, we extend the basic concept of physical programming to robust design by establishing the links of experimental design and response surface methodology to address designers’ preferences in a multiresponse robust design paradigm. A numerical example is used to show the proposed procedure and the results obtained are validated through a sensitivity study

Development of a variance prioritized multiresponse robust design framework for quality improvement

Robust design is a well-known quality improvement method that focuses on building quality into the design of products and services. Yet, most well established robust design models only consider a single performance measure and their prioritization schemes do not always address the inherent goal of robust design. This paper aims to propose a new robust design method for multiple quality characteristics where the goal is to first reduce the variability of the system under investigation and then attempt to locate the mean at the desired target value. The paper investigates the use of a response surface approach and a sequential optimization strategy to create a flexible and structured method for modeling multiresponse problems in the context of robust design. Nonlinear programming is used as an optimization tool. The proposed methodology is demonstrated through a numerical example. The results obtained from this example are compared to that of the traditional robust design method. For comparison purposes, the traditional robust design optimization models are reformulated within the nonlinear programming framework developed here. The proposed methodology provides enhanced optimal robust design solutions consistently. This paper is perhaps the first study on the prioritized response robust design with the consideration of multiple quality characteristics. The findings and key observations of this paper will be of significant value to the quality and reliability engineering/management community

Demand uncertainty In modelling WDS: scaling laws and scenario generation

Water distribution systems (WDS) are critical infrastructures that should be designed to work properly in different conditions. The design and management of WDS should take into account the uncertain nature of some system parameters affecting the overall reliability of these infrastructures. In this context, water demand represents the major source of uncertainty. Thus, uncertain demand should be either modelled as a stochastic process or characterized using statistical tools. In this paper, we extend to the 3rd and 4th order moments the analytical equations (namely scaling laws) expressing the dependency of the statistical moments of demand signals on the sampling time resolution and on the number of served users. Also, we describe how the probability density function (pdf) of the demand signal changes with both the increase of the user’s number and the sampling rate variation. With this aim, synthetic data and real indoor water demand data are used. The scaling laws of the water demand statistics are a powerful tool which allows us to incorporate the demand uncertainty in the optimization models for a sustainable management of WDS. Specifically, in the stochastic/robust optimization, solutions close to the optimum in different working conditions should be considered. Obviously, the results of these optimization models are strongly dependent on the conditions that are taken into consideration (i.e. the scenarios). Among the approaches for the definition of demand scenarios and their probability-weight of occurrence, the moment-matching method is based on matching a set of statistical properties, e.g. moments from the 1st (mean) to the 4th (kurtosis) order

Cross Validation and Maximum Likelihood estimations of hyper-parameters of Gaussian processes with model misspecification

The Maximum Likelihood (ML) and Cross Validation (CV) methods for estimating covariance hyper-parameters are compared, in the context of Kriging with a misspecified covariance structure. A two-step approach is used. First, the case of the estimation of a single variance hyper-parameter is addressed, for which the fixed correlation function is misspecified. A predictive variance based quality criterion is introduced and a closed-form expression of this criterion is derived. It is shown that when the correlation function is misspecified, the CV does better compared to ML, while ML is optimal when the model is well-specified. In the second step, the results of the first step are extended to the case when the hyper-parameters of the correlation function are also estimated from data.Comment: A supplementary material (pdf) is available in the arXiv source

On the Minimization of Convex Functionals of Probability Distributions Under Band Constraints

The problem of minimizing convex functionals of probability distributions is solved under the assumption that the density of every distribution is bounded from above and below. A system of sufficient and necessary first-order optimality conditions as well as a bound on the optimality gap of feasible candidate solutions are derived. Based on these results, two numerical algorithms are proposed that iteratively solve the system of optimality conditions on a grid of discrete points. Both algorithms use a block coordinate descent strategy and terminate once the optimality gap falls below the desired tolerance. While the first algorithm is conceptually simpler and more efficient, it is not guaranteed to converge for objective functions that are not strictly convex. This shortcoming is overcome in the second algorithm, which uses an additional outer proximal iteration, and, which is proven to converge under mild assumptions. Two examples are given to demonstrate the theoretical usefulness of the optimality conditions as well as the high efficiency and accuracy of the proposed numerical algorithms.Comment: 13 pages, 5 figures, 2 tables, published in the IEEE Transactions on Signal Processing. In previous versions, the example in Section VI.B contained some mistakes and inaccuracies, which have been fixed in this versio