Search results

The purpose of this paper is to define the process of analog circuit optimization on the basis of the control theory application. This approach produces many different strategies of optimization and determines the problem of searching of the best strategy in sense of minimal computer time. The determining of the best strategy of optimization and a searching of possible structure of this strategy with a minimal computer time is a principal aim of this work.

Different kinds of strategies for circuit optimization have been evaluated from the point of view of operations’ number. The generalized methodology for the optimization of analog circuit was formulated by means of the optimum control theory. The main equations for this methodology were elaborated. These equations include the special control functions that are introduced artificially. This approach generalizes the problem and generates an infinite number of different strategies of optimization. A problem of construction of the best algorithm of optimization is defined as a typical problem of the control theory. Numerical results show the possibility of application of this approach for optimization of electronic circuits and demonstrate the efficiency and perspective of the proposed methodology.

Examples show that the better optimization strategies that are appeared in limits of developed approach have a significant time gain with respect to the traditional strategy. The time gain increases when the size and the complexity of the optimized circuit are increasing. An additional acceleration effect was used to improve the properties of presented optimization process.

The obtained results show the perspectives of new approach for circuit optimization. A large set of various strategies of circuit optimization serves as a basis for searching the better strategies with a minimum computer time. The gain in processor time for the best strategy reaches till several thousands in comparison with traditional approach.

This paper aims to propose a new approach on the problem of circuit optimisation by using the generalised optimisation methodology presented earlier. This approach is focused on the application of the maximum principle of Pontryagin for searching the best structure of a control vector providing the minimum central processing unit (CPU) time.

The process of circuit optimisation is defined mathematically as a controllable dynamical system with a control vector that changes the internal structure of the equations of the optimisation procedure. In this case, a well-known maximum principle of Pontryagin is the best theoretical approach for finding of the optimum structure of control vector. A practical approach for the realisation of the maximum principle is based on the analysis of the behaviour of a Hamiltonian for various strategies of optimisation and provides the possibility to find the optimum points of switching for the control vector.

It is shown that in spite of the fact that the maximum principle is not a sufficient condition for obtaining the global minimum for the non-linear problem, the decision can be obtained in the form of local minima. These local minima provide rather a low value of the CPU time. Numerical results were obtained for both a two-dimensional case and an N-dimensional case.

The possibility of the use of the maximum principle of Pontryagin to a problem of circuit optimisation is analysed systematically for the first time. The important result is the theoretical justification of formerly discovered effect of acceleration of the process of circuit optimisation.

Advancement in optimization of VLSI circuits involves reduction in chip size from micrometer to nanometer level as well as fabrication of a billions of transistors in a single die where global routing problem remains significant with a trade-off of power dissipation and interconnect delay. This paper aims to solve the increased complexity in VLSI chip by minimization of the wire length in VLSI circuits using a new approach based on nature-inspired meta-heuristic, invasive weed optimization (IWO). Further, this paper aims to achieve maximum circuit optimization using IWO hybridized with particle swarm optimization (PSO).

This paper projects the complexities of global routing process of VLSI circuit design in mapping it with a well-known NP-complete problem, the minimum rectilinear Steiner tree (MRST) problem. IWO meta-heuristic algorithm is proposed to meet the MRST problem more efficiently and thereby reducing the overall wire-length of interconnected nodes. Further, the proposed approach is hybridized with PSO, and a comparative analysis is performed with geosteiner 5.0.1 and existing PSO technique over minimization, consistency and convergence against available benchmark.

This paper provides high performance–enhanced IWO algorithm, which keeps in generating low MRST value, thereby successful wire length reduction of VLSI circuits is significantly achieved as evident from the experimental results as compared to PSO algorithm and also generates value nearer to geosteiner 5.0.1 benchmark. Even with big VLSI instances, hybrid IWO with PSO establishes its robustness over achieving improved optimization of overall wire length of VLSI circuits.

This paper includes implications in the areas of optimization of VLSI circuit design specifically in the arena of VLSI routing and the recent developments in routing optimization using meta-heuristic algorithms.

This paper fulfills an identified need to study optimization of VLSI circuits where minimization of overall interconnected wire length in global routing plays a significant role. Use of nature-based meta-heuristics in solving the global routing problem is projected to be an alternative approach other than conventional method.

In this paper, on the basis of a previously developed approach to circuit optimization, the main element of which is the control vector that changes the form of the basic equations, the structure of the control vector is determined, which minimizes CPU time.

The circuit optimization process is defined as a controlled dynamic system with a special control vector. This vector serves as the main tool for generalizing the problem of circuit optimization and produces a huge number of different optimization strategies. The task of finding the best optimization strategy that minimizes processor time can be formulated. There is a need to find the optimal structure of the control vector that minimizes processor time. A special function, which is a combination of the Lyapunov function of the optimization process and its time derivative, was proposed to predict the optimal structure of the control vector. The found optimal positions of the switching points of the control vector give a large gain in CPU time in comparison with the traditional approach.

The optimal positions of the switching points of the components of the control vector were calculated. They minimize processor time. Numerical results are obtained for various circuits.

The Lyapunov function, which is one of the main characteristics of any dynamic system, is used to determine the optimal structure of the control vector, which minimizes the time of the circuit optimization process.

In this paper, the previously developed idea of generalized optimization of circuits for deterministic methods has been extended to genetic algorithm (GA) to demonstrate new possibilities for solving an optimization problem that enhance accuracy and significantly reduce computing time.

The disadvantages of GAs are premature convergence to local minima and an increase in the computer operation time when setting a sufficiently high accuracy for obtaining the minimum. The idea of generalized optimization of circuits, previously developed for the methods of deterministic optimization, is built into the GA and allows one to implement various optimization strategies based on GA. The shape of the fitness function, as well as the length and structure of the chromosomes, is determined by a control vector artificially introduced within the framework of generalized optimization. This study found that changing the control vector that determines the method for calculating the fitness function makes it possible to bypass local minima and find the global minimum with high accuracy and a significant reduction in central processing unit (CPU) time.

The structure of the control vector is found, which makes it possible to reduce the CPU time by several orders of magnitude and increase the accuracy of the optimization process compared with the traditional approach for GAs.

It was demonstrated that incorporating the idea of generalized optimization into the body of a stochastic optimization method leads to qualitatively new properties of the optimization process, increasing the accuracy and minimizing the CPU time.

This paper aims to resolve the sizing issues of analog circuit design by using proposed metaheuristic optimization algorithm.

The hybridization of whale optimization algorithm and modified gray wolf optimization (WOA-mGWO) algorithm is proposed, and the same is applied for the automated design of analog circuits.

The proposed hybrid WOA-mGWO algorithm demonstrates better performance in terms of convergence rates and average fitness of the function after testing it with 23 classical benchmark functions. Moreover, a rigorous performance evaluation is done with 20 independent runs using Wilcoxon rank-sum test.

For evaluating the performance of the proposed algorithm, a conventional two-stage operational amplifier is considered. The aspect ratios calculated by simulating the algorithm in MATLAB are later used to design the operational amplifier in Cadence environment using 180nm CMOS standard process.

The hybrid WOA-mGWO algorithm is tailored to improve the exploration ability of the algorithm by combining the abilities of two metaheristic algorithms, i.e. whale optimization algorithm and modified gray wolf optimization algorithm. To build further credence and to prove its profound existence in the latest state of the art, a statistical study is also conducted over 20 independent runs, for the robustness of the proposed algorithm, resulting in best, mean and worst solutions for analog IC sizing problem. A comparison of the best solution with other significant sizing tools proving the efficiency of hybrid WOA-mGWO algorithm is also provided. Montecarlo simulation and corner analysis are also performed to validate the endurance of the design.

The purpose of this paper is to present a new method of optimization of electronic integrated circuits (IC) with imbedded passive modules (PM). The reported method constitutes an attempt to streamline the optimization process in the AC electrical model stage of the RF Microsystems design.

In this method, the PM are described in symbolic form while the IC blocks remain described numerically. Whole PM can be represented as some sequence of expressions containing crucial model parameters, nominal and parasitic, which are first precompiled and next, merged automatically with the main program.

The input data can be updated online according to the user's desiderata. Further, the system offers the possibility to optimize PM in diverse circumstances as well as using different technologies, and including parasitic effects.

Usage of the semi‐symbolic method for IC with embedded PM optimization based on large‐change sensitivity AC analysis method, which appears to be a very efficient and flexible approach to solving such problems.

Power consumption is a top priority in high-performance asynchronous circuit design today. The purpose of this study is to provide a spatial correlation-aware statistical dual-threshold voltage design method for low-power design of template-based asynchronous circuits.

In this paper, the authors proposed a statistical dual-threshold voltage design of template-based asynchronous circuits considering process variations with spatial correlation. The utilized circuit model is an extended Timed Petri-Net which captures the dynamic behavior of the asynchronous circuit with statistical delay and power values. To have a more comprehensive framework, the authors model the spatial correlation information of the circuit. The authors applied a genetic optimization algorithm that uses a two-dimensional graph to calculate the power and performance of each threshold voltage assignment.

Experimental results show that using this statistically aware optimization, leakage power of asynchronous circuits can be reduced up to 3X. The authors also show that the spatial correlation may lead to large errors if not being considered in the design of dual-threshold-voltage asynchronous circuits.

The proposed framework is the scheme giving a low-power design of asynchronous circuits compared to other schemes. The comparison exhibits that the proposed method has better results in terms of performance and power. To consider the process variations with spatial correlation, the authors apply the principle component analysis method to transform the correlated variables into uncorrelated ones.

This work seeks to present the theoretical study considerations and the characteristics of a general design methodology in optimal time for electronic systems using numerical methods and optimal control theory. Through this, the design problem of a system is formulated in terms of optimal control in minimal time.

This general design methodology includes the traditional design strategy (TDS), and the modified traditional design strategy (MTDS), where the model of the system is part of the optimization procedure but an objective function of the optimization process is constructed such as includes the traditional objective function and some penalty functions that feign the model of the system. Many special control functions are introduced artificially to generalize the methodology and produce several design trajectories for the same optimization process – the first and final trajectories correspond to TDS and MTDS, respectively. The combination of these trajectories produce an infinite number of design strategies, some of these are quasi‐optimal in time and only one is optimal in time.

Qualitative and numeric results of this iterative process are generated in a personal computer in a C++ language elaborated with a visual C++ graphic user interface. An algorithm is constructed to form an optimal in time design strategy switching from a MTDS subset to a TDS subset. Results of measured times are analyzed, showing that there is a control input U, such that the objective function is minimized in a minimum time.

These ideas are proposed using method of gradient optimization and special acceleration effect.

The design of temperature‐compensated quartz crystal oscillators (TCXOs) in thick film hybrid technology is described. TCXOs controlled by varicap diodes are usually realised with discrete NTC thermistors and resistors. Data obtained by precision measurements of voltages on varicap diodes for the same oscillator frequencies over the operating temperature range are used for calculating values of the NTC thermistors and resistors. In most cases these values cannot be found in the Renard scale, with the result that manipulation or ‘juggling’ of values is necessary. The realisation of temperature‐compensating circuits in thick film technology has certain advantages, such as miniaturisation, better characteristics at high frequencies and in particular the possibility to trim thick film resistors and NTC thermistors to values calculated for each oscillator. The method of realisation of TCXOs in thick film hybrid technology was developed and verified on prototypes. The compensation curves were obtained by measuring compensation voltages for each oscillator over the operating temperature range from — 20°C to 70°C. From these data the values of resistors and NTC thermistors were calculated. A computer program was used to minimise frequency instability error as a function of six parameters (resistance). The frequency stability (Δf/f) of TCXOs obtained was better than ±2 ppm.