## Implementation of a Decoupled Optimization Technique for Design of Switching Regulators Using Genetic Algorithms

Citations: | 2 - 2 self |

### BibTeX

@MISC{Zhang_implementationof,

author = {Jun Zhang and Henry Shu-hung Chung and Wai-lun Lo and S. Y. (ron Hui and Senior Member and Angus Kwok-ming Wu},

title = {Implementation of a Decoupled Optimization Technique for Design of Switching Regulators Using Genetic Algorithms},

year = {}

}

### OpenURL

### Abstract

Abstract—This paper presents an implementation of a decoupled optimization technique for design of switching regulators using genetic algorithms (GAs). The optimization process entails the selection of component values in a switching regulator, in order to meet the static and dynamic requirements. Although the proposed method inherits characteristics of evolutionary computations that involve randomness, recombination, and survival of the fittest, it does not perform a whole-circuit optimization. Thus, intensive computations that are usually found in stochastic optimization techniques can be avoided. Similar to many design approaches for power electronics circuits, a regulator is decoupled into two components, namely the power conversion stage (PCS) and the feedback network (FN). The PCS is optimized with the required static characteristics, whilst the FN is optimized with the required static and dynamic behaviors of the whole system. Systematic optimization procedures will be described and the technique is illustrated with the design of a buck regulator with overcurrent protection. The predicted results are compared with the published results available in the literature and are verified with experimental measurements. Index Terms—Circuit optimization, circuit simulation, computer-aided design, genetic algorithms, power electronics. I.

### Citations

8382 |
Genetic Algorithms
- Goldberg
- 1989
(Show Context)
Citation Context ... thus, having a limitation of operating in large, multimodal, and noisy spaces. Recently, modern stochastic optimization techniques involving evolutionary computation such as genetic algorithms (GAs) =-=[10]-=- have been shown to be an effective way to find solutions close to the global optimum and are less dependent upon the initial guess [11]–[15]. GAs belong to the class of probabilistic algorithms, yet ... |

2243 |
Genetic Algorithms + Data Structures = Evolutionary Programs, 3rd edn
- Michalewicz
- 1996
(Show Context)
Citation Context ... evolutionary computation such as genetic algorithms (GAs) [10] have been shown to be an effective way to find solutions close to the global optimum and are less dependent upon the initial guess [11]–=-=[15]-=-. GAs belong to the class of probabilistic algorithms, yet they are very different from random algorithms as they combine elements of directed and stochastic search. Because of this, GAs are also more... |

433 |
Optimization of Control Parameters for Genetic Algorithms
- Grefenstette
- 1986
(Show Context)
Citation Context ...he course of evolution, are often helpful with respect to the convergence reliability and velocity of a GA. On the other hand, selection of is dependent on the searching dimension. It is suggested in =-=[20]-=- that [20, 100]. In this paper, , , and are used. 2) Step 2—Selection of Chromosomes: A selection process, which is based on applying the roulette wheel rule, is performed. It starts with the calculat... |

237 | Evolutionary computation: comments on the history and current state
- Bäck, Hammel, et al.
- 1997
(Show Context)
Citation Context ... paper, static approach is applied. andsZHANG et al.: DECOUPLED OPTIMIZATION TECHNIQUE 757 Fig. 4. Flowchart of the optimization steps for the PCS. are fixed throughout the evolution. As discussed in =-=[19]-=-, values of [0.75, 0.95] and [0.005, 0.01] are recommended. Recent studies have impressively clarified, however, that much larger mutation rates, decreasing over the course of evolution, are often hel... |

82 | OASYS: a framework for analog circuit synthesis
- Harjani, Rutenbar, et al.
- 1989
(Show Context)
Citation Context ...ponent values for satisfying required specifications. About two decades ago techniques for analog circuit design automation began to emerge. These methods incorporated heuristics [5], knowledge bases =-=[6]-=-, simulated annealing [7], and other algorithms for circuit optimization. Classical optimization techniques such as the gradient methods and Hill-Climbing techniques have been applied [8], [9]. Howeve... |

59 | Synthesis of high-performance analog circuits in ASTRX/OBLX
- Ochotta, Rutenbar, et al.
- 1996
(Show Context)
Citation Context ...ing required specifications. About two decades ago techniques for analog circuit design automation began to emerge. These methods incorporated heuristics [5], knowledge bases [6], simulated annealing =-=[7]-=-, and other algorithms for circuit optimization. Classical optimization techniques such as the gradient methods and Hill-Climbing techniques have been applied [8], [9]. However some methods might subj... |

53 | Adaptation in Evolutionary Computation: A Survey
- Hinterding, Michalewicz, et al.
- 1997
(Show Context)
Citation Context ...e next generation. and are two vital parameters that affect the searching process. Types of adaptation can be classified into static, dynamic deterministic, dynamic adaptive and dynamic self-adaptive =-=[18]-=-. In this paper, static approach is applied. andsZHANG et al.: DECOUPLED OPTIMIZATION TECHNIQUE 757 Fig. 4. Flowchart of the optimization steps for the PCS. are fixed throughout the evolution. As disc... |

25 |
Heuristic techniques in computer-aided circuit analysis
- Sussman, Stallman
- 1975
(Show Context)
Citation Context ...mizes the circuit component values for satisfying required specifications. About two decades ago techniques for analog circuit design automation began to emerge. These methods incorporated heuristics =-=[5]-=-, knowledge bases [6], simulated annealing [7], and other algorithms for circuit optimization. Classical optimization techniques such as the gradient methods and Hill-Climbing techniques have been app... |

24 |
Time-domain analysis of networks with internally controlled switches
- Bedrosian, Vlach
- 1992
(Show Context)
Citation Context ...ntent of will be substituted into and the next GA cycle will be started from step 2). V. DESIGN EXAMPLE The above method is illustrated with the design of a buck regulator with overcurrent protection =-=[21]-=-. The schematic is shown in Fig. 6. It consists of a buck converter and a proportional-plusintegral (PI) controller. The required specifications are as follows. Input voltage range: V V Output load ra... |

17 |
Bakirtzis “Varying Fitness Function in Genetic Algorithm Constrained Optimization: The cutting Stock and Unit Commitment Problems
- Petridis, Kazarlis, et al.
- 1998
(Show Context)
Citation Context ...lving evolutionary computation such as genetic algorithms (GAs) [10] have been shown to be an effective way to find solutions close to the global optimum and are less dependent upon the initial guess =-=[11]-=-–[15]. GAs belong to the class of probabilistic algorithms, yet they are very different from random algorithms as they combine elements of directed and stochastic search. Because of this, GAs are also... |

16 |
Averaged and sampled-data models for current mode control: a re-examination
- Verghese, Bruzos, et al.
- 1989
(Show Context)
Citation Context ...nics. I. INTRODUCTION IN THE last two decades, small-signal models have been widely used in the design of switching regulators. Among various approaches, the state-space averaging and its variant [1]–=-=[4]-=- are the most common ones. By recognizing that a converter has an output filter cutoff frequency much lower than the switching frequency, linear time-invariant models can be derived to approximate the... |

14 |
Modeling current-programmed buck and boost regulators
- Middlebrook
- 1989
(Show Context)
Citation Context ...theories, circuit components in the feedback compensation network can be designed. Although the procedures are simple and elegant, they are usually applicable for specific circuits and control scheme =-=[3]-=-, [4] that require comprehensive knowledge on the circuit operation. In addition, as the circuit has been converted into a mathematical model and its state variables have Manuscript received February ... |

10 | Minimal fuzzy memberships and rules using hierarchical genetic algorithms
- Tang, Man, et al.
- 1998
(Show Context)
Citation Context ...ircuit components, such as resonant converters. In addition, apart from the PI controllers as in the illustration, it is applicable for optimizing complex controllers, like fuzzy logic controllers in =-=[22]-=-–[24]. VI. CONCLUSIONS This paper presents a systematic GA-based, decoupled optimization technique for design of switching regulators. The process entails the selection of the component values in the ... |

6 |
Optimization methods in electronic circuit design
- Massara
- 1991
(Show Context)
Citation Context ...e bases [6], simulated annealing [7], and other algorithms for circuit optimization. Classical optimization techniques such as the gradient methods and Hill-Climbing techniques have been applied [8], =-=[9]-=-. However some methods might subject to becoming trapped into local minima, leading to suboptimal parameter values, and thus, having a limitation of operating in large, multimodal, and noisy spaces. R... |

5 |
A genetic approach to simultaneous parameter space exploration and constraint transformation in analog synthesis
- Dhanwada, Nunez-Aldana, et al.
- 1999
(Show Context)
Citation Context ...s process a single point of the search space [15]. Many GA-based design schemes for analog circuits, like voltage reference circuit [12], transconductance amplifier [13], and analog circuit synthesis =-=[14]-=-, have been proposed. Circuit behaviors are described by well-defined mathematical functions with unknown optimal coefficients. A set of guided stochastic searching procedures that are based loosely o... |

3 |
Optimization - a powerful tool for analysis and design
- Huelsman
- 1993
(Show Context)
Citation Context ...wledge bases [6], simulated annealing [7], and other algorithms for circuit optimization. Classical optimization techniques such as the gradient methods and Hill-Climbing techniques have been applied =-=[8]-=-, [9]. However some methods might subject to becoming trapped into local minima, leading to suboptimal parameter values, and thus, having a limitation of operating in large, multimodal, and noisy spac... |

3 |
Parameter optimization of a reference circuit using EP
- Nam, Seo, et al.
- 1998
(Show Context)
Citation Context ...t they maintain a population of potential solutions—all other methods process a single point of the search space [15]. Many GA-based design schemes for analog circuits, like voltage reference circuit =-=[12]-=-, transconductance amplifier [13], and analog circuit synthesis [14], have been proposed. Circuit behaviors are described by well-defined mathematical functions with unknown optimal coefficients. A se... |

3 |
System for optimization of electronic circuits using genetic algorithm
- Wojcikowski, Glinianowicz, et al.
- 1996
(Show Context)
Citation Context ...otential solutions—all other methods process a single point of the search space [15]. Many GA-based design schemes for analog circuits, like voltage reference circuit [12], transconductance amplifier =-=[13]-=-, and analog circuit synthesis [14], have been proposed. Circuit behaviors are described by well-defined mathematical functions with unknown optimal coefficients. A set of guided stochastic searching ... |

2 |
Computer-Aided-Analysis of Switch-Mode Power Supplies
- Lee
- 1993
(Show Context)
Citation Context ...ation about the exact waveforms and the response profiles can be obtained. Circuit designers would sometimes find it difficult to predict precisely the circuit responses under large-signal conditions =-=[2]-=-. As power electronics technology continues to develop, there is a growing need for automated synthesis that starts with a high-level statement of the desired behavior and optimizes the circuit compon... |

2 |
Steady-state analysis of PWM dc/dc switching regulators using iterative cycle time-domain simulation
- Wong, Chung
- 1998
(Show Context)
Citation Context ...f €gƒ in the population. The implied goal is to find whether there exists a value of in Fig. 1 such that the value of after the signal conditioning of [i.e., ] is same as . An iterative Secant method =-=[16]-=- is applied to determine the steady state waveforms. An integral square error function is defined in the th iteration to estimate the closeness of with in simulated values is obtained by performing a ... |

2 |
Implementation of a fuzzy logic controller for DC–DC converters using an inexpensive 8-b microcontroller
- Gupta, Boudreaux, et al.
- 1997
(Show Context)
Citation Context ...t components, such as resonant converters. In addition, apart from the PI controllers as in the illustration, it is applicable for optimizing complex controllers, like fuzzy logic controllers in [22]–=-=[24]-=-. VI. CONCLUSIONS This paper presents a systematic GA-based, decoupled optimization technique for design of switching regulators. The process entails the selection of the component values in the power... |

1 |
efficient technique for the time-domain simulation of power electronic circuits
- “An
- 1998
(Show Context)
Citation Context ...is less than a tolerance , it is assumed that the system is in the steady state conditions. Otherwise, another guess of and will be iterated by where . is the initial state vector in the th iteration =-=[17]-=-. will be used in the next iteration until a steady state solution is determined. The iteration will also be terminated when is larger than a preset number . Formulation of is based on . If no steady ... |

1 | Fuzzy logic control of a space-vector PWM current regulator for three-phase power converters - Saetieo, Torrey - 1998 |