Algorithms for the statistical design of electrical circuits

Imperial Users onl

NASA SERC 1990 Symposium on VLSI Design

This document contains papers presented at the first annual NASA Symposium on VLSI Design. NASA's involvement in this event demonstrates a need for research and development in high performance computing. High performance computing addresses problems faced by the scientific and industrial communities. High performance computing is needed in: (1) real-time manipulation of large data sets; (2) advanced systems control of spacecraft; (3) digital data transmission, error correction, and image compression; and (4) expert system control of spacecraft. Clearly, a valuable technology in meeting these needs is Very Large Scale Integration (VLSI). This conference addresses the following issues in VLSI design: (1) system architectures; (2) electronics; (3) algorithms; and (4) CAD tools

Strategic Optimization Techniques For FRTU Deployment and Chip Physical Design

Combinatorial optimization is a complex engineering subject. Although formulation often depends on the nature of problems that differs from their setup, design, constraints, and implications, establishing a unifying framework is essential. This dissertation investigates the unique features of three important optimization problems that can span from small-scale design automation to large-scale power system planning: (1) Feeder remote terminal unit (FRTU) planning strategy by considering the cybersecurity of secondary distribution network in electrical distribution grid, (2) physical-level synthesis for microfluidic lab-on-a-chip, and (3) discrete gate sizing in very-large-scale integration (VLSI) circuit. First, an optimization technique by cross entropy is proposed to handle FRTU deployment in primary network considering cybersecurity of secondary distribution network. While it is constrained by monetary budget on the number of deployed FRTUs, the proposed algorithm identi?es pivotal locations of a distribution feeder to install the FRTUs in different time horizons. Then, multi-scale optimization techniques are proposed for digital micro?uidic lab-on-a-chip physical level synthesis. The proposed techniques handle the variation-aware lab-on-a-chip placement and routing co-design while satisfying all constraints, and considering contamination and defect. Last, the first fully polynomial time approximation scheme (FPTAS) is proposed for the delay driven discrete gate sizing problem, which explores the theoretical view since the existing works are heuristics with no performance guarantee. The intellectual contribution of the proposed methods establishes a novel paradigm bridging the gaps between professional communities

Parametric Yield of VLSI Systems under Variability: Analysis and Design Solutions

Variability has become one of the vital challenges that the designers of integrated circuits encounter. variability becomes increasingly important. Imperfect manufacturing process manifest itself as variations in the design parameters. These variations and those in the operating environment of VLSI circuits result in unexpected changes in the timing, power, and reliability of the circuits. With scaling transistor dimensions, process and environmental variations become significantly important in the modern VLSI design. A smaller feature size means that the physical characteristics of a device are more prone to these unaccounted-for changes. To achieve a robust design, the random and systematic fluctuations in the manufacturing process and the variations in the environmental parameters should be analyzed and the impact on the parametric yield should be addressed. This thesis studies the challenges and comprises solutions for designing robust VLSI systems in the presence of variations. Initially, to get some insight into the system design under variability, the parametric yield is examined for a small circuit. Understanding the impact of variations on the yield at the circuit level is vital to accurately estimate and optimize the yield at the system granularity. Motivated by the observations and results, found at the circuit level, statistical analyses are performed, and solutions are proposed, at the system level of abstraction, to reduce the impact of the variations and increase the parametric yield. At the circuit level, the impact of the supply and threshold voltage variations on the parametric yield is discussed. Here, a design centering methodology is proposed to maximize the parametric yield and optimize the power-performance trade-off under variations. In addition, the scaling trend in the yield loss is studied. Also, some considerations for design centering in the current and future CMOS technologies are explored. The investigation, at the circuit level, suggests that the operating temperature significantly affects the parametric yield. In addition, the yield is very sensitive to the magnitude of the variations in supply and threshold voltage. Therefore, the spatial variations in process and environmental variations make it necessary to analyze the yield at a higher granularity. Here, temperature and voltage variations are mapped across the chip to accurately estimate the yield loss at the system level. At the system level, initially the impact of process-induced temperature variations on the power grid design is analyzed. Also, an efficient verification method is provided that ensures the robustness of the power grid in the presence of variations. Then, a statistical analysis of the timing yield is conducted, by taking into account both the process and environmental variations. By considering the statistical profile of the temperature and supply voltage, the process variations are mapped to the delay variations across a die. This ensures an accurate estimation of the timing yield. In addition, a method is proposed to accurately estimate the power yield considering process-induced temperature and supply voltage variations. This helps check the robustness of the circuits early in the design process. Lastly, design solutions are presented to reduce the power consumption and increase the timing yield under the variations. In the first solution, a guideline for floorplaning optimization in the presence of temperature variations is offered. Non-uniformity in the thermal profiles of integrated circuits is an issue that impacts the parametric yield and threatens chip reliability. Therefore, the correlation between the total power consumption and the temperature variations across a chip is examined. As a result, floorplanning guidelines are proposed that uses the correlation to efficiently optimize the chip's total power and takes into account the thermal uniformity. The second design solution provides an optimization methodology for assigning the power supply pads across the chip for maximizing the timing yield. A mixed-integer nonlinear programming (MINLP) optimization problem, subject to voltage drop and current constraint, is efficiently solved to find the optimum number and location of the pads

Development of evolutionary based techniques with applications to engineering.

Every possible problem can be considered to have a set of possible states by which amongst them, some are considered better than others by some chosen measure. It is the intention of optimisation to discover such states that perform better than all others for any given problem. It is an important tool within an array of subject areas, arguably all, in particular engineering, which tackles such applications as shape optimisation and industrial scheduling to name but a few. The aims of this work, are to increase the performance of the in-house general-purpose particle swarm optimiser designed at the department of engineering at Swansea University. This is to be achieved through its hybridisation with a local search, considering both solution refinement and early triggering mechanisms. In the discrete domain, an ant colony algorithm is to be chosen and evaluated by way of a parameter study and comparison against other leading ant colony algorithms made for the purpose of development for the future application to scheduling problems. Objectives are achieved through the increased refinement properties of the particle swarm optimiser with its hybridisation with local search. Additionally, an early switching mechanism is derived for the local search, resulting on average in a 20% reduction in the number of function evaluations required for constrained problems. With the highly unpredictable responses to unconstrained problems, only stagnation measures are derived. This study bridges the gap between the in-house optimiser and other hybrid particle swarm techniques available in the literature, resulting in competitive performance. An extensive literature review of ant colony identified the population-based ant colony algorithm (PACO) for further investigation. A detailed parameter study is conducted, resulting in the realisation of the strongly coupled parameters present. Following this, a hybrid off-line tuning method is devised, hybridising a simple particle swarm optimiser with the ant colony algorithm, resulting in an overall better performing algorithm. This indicated clear strengths in some cases over the more popular of ant colony algorithms

Bio-inspired computation: where we stand and what's next

In recent years, the research community has witnessed an explosion of literature dealing with the adaptation of behavioral patterns and social phenomena observed in nature towards efficiently solving complex computational tasks. This trend has been especially dramatic in what relates to optimization problems, mainly due to the unprecedented complexity of problem instances, arising from a diverse spectrum of domains such as transportation, logistics, energy, climate, social networks, health and industry 4.0, among many others. Notwithstanding this upsurge of activity, research in this vibrant topic should be steered towards certain areas that, despite their eventual value and impact on the field of bio-inspired computation, still remain insufficiently explored to date. The main purpose of this paper is to outline the state of the art and to identify open challenges concerning the most relevant areas within bio-inspired optimization. An analysis and discussion are also carried out over the general trajectory followed in recent years by the community working in this field, thereby highlighting the need for reaching a consensus and joining forces towards achieving valuable insights into the understanding of this family of optimization techniques

Bio-inspired computation: where we stand and what's next

In recent years, the research community has witnessed an explosion of literature dealing with the adaptation of behavioral patterns and social phenomena observed in nature towards efficiently solving complex computational tasks. This trend has been especially dramatic in what relates to optimization problems, mainly due to the unprecedented complexity of problem instances, arising from a diverse spectrum of domains such as transportation, logistics, energy, climate, social networks, health and industry 4.0, among many others. Notwithstanding this upsurge of activity, research in this vibrant topic should be steered towards certain areas that, despite their eventual value and impact on the field of bio-inspired computation, still remain insufficiently explored to date. The main purpose of this paper is to outline the state of the art and to identify open challenges concerning the most relevant areas within bio-inspired optimization. An analysis and discussion are also carried out over the general trajectory followed in recent years by the community working in this field, thereby highlighting the need for reaching a consensus and joining forces towards achieving valuable insights into the understanding of this family of optimization techniques

Multiobjective particle swarm optimization: Integration of dynamic population and multiple-swarm concepts and constraint handling

Scope and Method of Study: Over the years, most multiobjective particle swarm optimization (MOPSO) algorithms are developed to effectively and efficiently solve unconstrained multiobjective optimization problems (MOPs). However, in the real world application, many optimization problems involve a set of constraints (functions). In this study, the first research goal is to develop state-of-the-art MOPSOs that incorporated the dynamic population size and multipleswarm concepts to exploit possible improvement in efficiency and performance of existing MOPSOs in solving the unconstrained MOPs. The proposed MOPSOs are designed in two different perspectives: 1) dynamic population size of multiple-swarm MOPSO (DMOPSO) integrates the dynamic swarm population size with a fixed number of swarms and other strategies to support the concepts; and 2) dynamic multiple swarms in multiobjective particle swarm optimization (DSMOPSO), dynamic swarm strategy is incorporated wherein the number of swarms with a fixed swarm size is dynamically adjusted during the search process. The second research goal is to develop a MOPSO with design elements that utilize the PSO's key mechanisms to effectively solve for constrained multiobjective optimization problems (CMOPs).Findings and Conclusions: DMOPSO shows competitive to selected MOPSOs in producing well approximated Pareto front with improved diversity and convergence, as well as able to contribute reduced computational cost while DSMOPSO shows competitive results in producing well extended, uniformly distributed, and near optimum Pareto fronts, with reduced computational cost for some selected benchmark functions. Sensitivity analysis is conducted to study the impact of the tuning parameters on the performance of DSMOPSO and to provide recommendation on parameter settings. For the proposed constrained MOPSO, simulation results indicate that it is highly competitive in solving the constrained benchmark problems