Research Article  Open Access
Optimization of DCDC Converters via Geometric Programming
Abstract
The paper presents a new methodology for optimizing the design of DCDC converters. The magnitudes that we take into account are efficiency, ripples, bandwidth, and RHP zero placement. We apply a geometric programming approach, because the variables are positives and the constraints can be expressed in a posynomial form. This approach has all the advantages of convex optimization. We apply the proposed methodology to a boost converter. The paper also describes the optimum designs of a buck converter and a synchronous buck converter, and the method can be easily extended to other converters. The last example allows us to compare the efficiency and bandwidth between these optimaldesigned topologies.
1. Introduction
Methods of mathematical programming are useful in the processes of design in engineering when these processes have to maximize a certain magnitude and when at the same time there are certain design or operating constraints. The optimal design of DCDC converters has been studied by several authors. Some of them use graphical methods, but these cannot deal with more than two variables simultaneously, and the variables are rarely constrained. Examples of these methods are the efficiency optimization of a monolithic DCDC converter [1] and the losses optimization in a switching power converter for envelope tracking in RF amplifiers [2].
The fact that the expressions used are nonlinear has prompted some authors to use nonlinear programming methods, particularly algorithms based on Lagrangian functions. Important related studies are those of Seeman and Sanders [3], who optimized a switchedcapacitor converter design by means of Lagrangian functions, and those of Balachandran and Lee [4] and Wu et al. [5], which describe the optimization of DCDC converters by means of augmented Lagrangian functions with penalty functions. Other nonlinear programming methods such as the sequential quadratic programming method have also been used for designing of DCDC converters. For example, BusquetsMonge et al. [6] designed a boost powerfactorcorrector converter using this method.
In addition to nonlinear programming techniques, other optimizing methods have been used in converter optimization such as genetic algorithms or probabilistic methods. A genetic algorithm was used to optimize harmonic noise in AC/AC converters in [7], and the Monte Carlo search method has been used to optimize the cost, the weight, and the volume of converters for automotive applications in [8].
Nevertheless, neither general purpose nonlinear programming methods nor the other aforementioned nonlinear optimization techniques ensure that the global optimum is reached because of a local optimum can stop the searching process. Moreover, in some cases, these methods fail to detect the unfeasibility of the problem.
In contrast, unlike other methods that accept any nonlinear function, geometric programming (GP) is able to globally optimize a problem when the objective function and the constraint have a given form. GP ensures that the global solution is readily found or that the unfeasibility is detected very quickly. GP has never been used in the design of DCDC converters, but it has proved successful in other electrical fields [9–11]. The technique has been used for designing CMOS opamp [9], electrical transformers [10], and synchronous motors [11].
Although researchers in optimization methods have been interested in GP since the 1960s [12], the real advantages of this technique are only starting to be appreciated now. The reason for this is the significant development of interior point methods for solving convex optimization problems in the last fifteen years [13]. GP methods are now extremely efficient and reliable. GP uses the concepts of monomial function and posynomial function as the form to express objective function and constraints; we review these concepts in the following section.
In the present paper, we apply GP to the task of sizing DCDC converter components. Specifically, we impose constraints on voltage ripples, current ripples, bandwidth, RHP zero locations, conduction operation mode, and efficiency. First, we choose efficiency as the objective function, then we do the same for the bandwidth. We apply the technique to a boost converter. Also, in subsequent sections, we apply the technique to a buck converter and a synchronous buck converter, then we compare the performances of them to demonstrate the versatility of the procedure.
The paper is organized as follows: we review the GP concepts in Section 2. Section 3 describes the designing magnitudes of a boost converter, the optimization program, and the verification of the solution. Section 4 compares the optimal design of a buck converter with that of a synchronous buck converter. Finally, Section 5 summarizes the main conclusions.
2. Basics on Geometric Programming
The most wellknown optimization method is surely the simplex method. This method readily provides a solution to linear programming problems, that is, problems with a linear objective function subject to linear constraints that limit the selection of variable values. On the other hand, general purpose nonlinear optimization methods deliver a solution for nonlinear problems, but they depend on the starting point, since general purpose nonlinear optimization methods are only able to reach a local optimum. In addition, these optimization methods find it difficult to detect the infeasibility of a problem.
In 1984, Narendra Karmarkar [14] developed an algorithm for linear programming which, in contrast to the simplex method, reaches an optimal solution by traversing the interior of the feasible region. Interior point methods readily solve not only linear optimization problems but also convex problems, that is, problems with a convex objective function and convex constraints. Therefore, any optimization problem that can be modeled as a convex problem can be readily solved by interior point algorithms. There is a great deal of software as MATLAB that has coded interior point methods. We review the concepts of convex set and convex function in the following paragraphs.
A set is convex if the line segment between any two points in lies in ; that is, if for any and any with , we have
Obviously, a generic finitedimensional real vector space is convex, and a set of with entirely positives coordinates is also a convex set.
A function is convex if the domain of is a convex set and if for all points belonging to the domain of , and given a certain with , we have
Obviously, both linear and affine functions are convex. Another example of convex function is on , for any . Also, and are convex functions in [12].
There are certain kinds of nonlinear optimization problems, known as geometric programs, that can be transformed into convex optimization problems by means of a logarithmic change of variables. Such problems can be modeled using the concepts of monomial and posynomial function.
Given a vector , a monomial function is defined as where is a positive real constant called the monomial coefficient and are real constants that are referred to as the exponents of the monomial.
The sum of monomial functions is named a posynomial function; that is,
Using these concepts, a geometric program is defined as where are posynomial functions and are monomial functions.
The geometric program (2.5) is not convex; however, it can be made convex by means of the change of variables or () and replacing with and with . Once transformed, the geometric program is written as
The geometric program (2.6) can be readily solved using interior point algorithms because it is convex. Thus, modeling an engineering optimization problem as a geometric program solves the problem in a quick and reliable manner. This approach has been used in several engineering problems. In the next section, we analyze design magnitudes in DCDC converters and confirm that they can be written in posynomial form.
3. Optimal Design in Boost Converters
In this section, we revisit losses, ripples, and other magnitudes that appear in the boost converter design process. On the basis of these expressions, we provide an optimal design and evaluate the influence of converter parameters. Specifically, we optimize the efficiency when the current ripple, voltage ripple, the bandwidth, and the RHP zero location are limited. Afterwards, we optimize the bandwidth when efficiency is constrained.
3.1. The Design Magnitudes in Boost Converters
Although the expressions are well known, we revisit the expressions for the sake of completeness.
Figure 1 depicts the boost topology. We consider the following state vector: where is the inductor current and is the output voltage. State equations (3.2) model the converter dynamic behaviour in mode ON (when is ON and is inactive) which corresponds to a value of the control signal , and in mode OFF (when is OFF and is active), which corresponds to . Thus, where , , and stand for the inductor value, the capacitor value, and the load value, respectively and represents the input voltage. The expressions of the converter model (3.2) are valid only when it works in continuous conduction mode, as restriction (3.5) imposes.
A consequence of expression (3.2) is that under the hypothesis of low voltage variation in the capacitor, the current ripple is a triangular waveform whose amplitude depends on its slope during and the time that it remains in ; namely, where is the steadystate output voltage, stands for the switching frequency, and is the switch dutycycle which corresponds to .
Voltage ripple can be expressed, according to [15], as
In addition to ripple constraints, we impose the following restriction to make the boost converter operate in continuous conduction mode (CCM):
Another important property that should satisfy a design is to have a good enough bandwidth. The following expression binds the minimal required bandwidth : where is a percentage of the switching frequency.
Given that the boost converter has an RHP zero, we take into account its placement. A design should ensure that the RHP zero location is greater than the crossover frequency; otherwise, the converter will have bad gain and phase margins. The following constraint ensures that the boost converter has good robust margins [16]. This constraint reduces the limitations on dynamical performances caused by the RHP zero
One of the most important magnitudes in the design of a boost converter is its power consumption, which is made up of conduction losses caused by parasitic resistances, and switching losses caused by parasitic capacitances.
We have used a model of losses that consider only parasitic resistances and capacitances. Nevertheless, parasitic inductances related to layout could be taken into account according to expression of [15], but they are usually much less significant than resistive and capacitive parasitic losses.
In the following analysis, we consider the MOSFET losses, the diode losses, and the ohmic losses in the inductor and the capacitor.
3.1.1. Dissipated Power in the Switches
In this subsection, we first revisit the power losses in the transistor and then those induced by the diode.
The total power consumption of MOSFET consists of conduction losses and switching losses .
Quantities , and can be approximated by where where stands for the MOSFET average current and and represent the transition time to on and to off, respectively. Times and depend on the gate drive and MOSFET features, stands for the onresistance of MOSFET, and represents the forward voltage drop in the body diode.
The total power dissipated by the diode can be expressed as where is the reverse recovery charge in the diode. We have considered that the diode is implemented in Schottky technology. For the sake of clarity, we have not taken into account ohmic losses in the diode. Nevertheless, the procedure would allow to consider them adding to expression (3.10) the term , where is diode dynamic resistance and is the mean square diode current.
3.1.2. Losses at Passive Elements
The inductor is responsible for a substantial portion of the converter’s energy consumption. The losses in this passive element consist of winding losses and core losses, but these can approximately be characterized by a constant equivalent series resistance . Consequently, the power dissipated by the inductive element is expressed as
Similarly, the capacitor losses can be approximated by where is the equivalent series resistance in the capacitive element. The waveform of the capacitor current is shown in Figure 2, and its rms value corresponds to
3.1.3. Total Power Losses and Efficiency in a Boost Converter
Given the expressions (3.1), (3.2), (3.3), and (3.4), the total power losses in the boost converter are written as
The terms on the right contribute unevenly depending on the operating conditions of the converter.
Efficiency is defined as where is the averaged power at the load.
3.2. Geometric Programming for Boost Converter Optimal Design
In this section, we describe an optimization program that can be solved using geometric programming, because the magnitudes are posynomial. Also, we give an example of the procedure for a realistic set of parameters, and finally, we show that the optimum has been reached. Furthermore, we show the influence of small variations around the optimal point on the performance.
3.2.1. Optimization Program for Boost Converters
In this subsection, we minimize the converter power consumption which is equivalent to maximize the efficiency. Our optimization variables are the size of the storing elements and the switching frequency. In addition, we constrain the ripples, the bandwidth, and the RHP zero location and impose the continuous conduction mode. Thus, the following geometric program allows us to optimally design a boost converter:
3.2.2. Example of Optimal Design of a Boost Converter
We show the input values used in the example. The input values are the voltage ratio, the MOSFET and diode parameters, and the variable bounds and the ripple bounds.
The values for the voltage ratio, MOSFET, and diode parameters are shown in Table 1.

Table 2 indicates the bounds imposed on the optimization variables. Some of these limits do not constrain performance; however, others do, and it is particularly important to determine which values these are.

The optimum obtained corresponds to
In order to illustrate the versatility of the procedure, next, we show the result when the purpose is to maximize the bandwidth when the efficiency is constrained to be greater than 85%
It can be seen that solution (3.2.2) has a much better bandwidth than (3.17) but that this is at the expense of an efficiency decrease.
3.2.3. Verification of the Optimal Solution in a Boost Converter
In this subsection, we analyze some plots to verify the optimality of solution (3.17) and to evaluate which constraint limits the efficiency. The plots indicate that any variation that fulfils the constraints around the optimal values (3.16) causes an efficiency decrease. The optimal values of certain variables corresponds to limits of an active restriction, this implies that the relaxation of the limits will increase the efficiency.
Figure 3 depicts the efficiency with respect to frequency values. Red squares correspond to switching frequency values that do not satisfy the current ripple constraint, and black circles are admissible values. The optimal switching frequency value corresponds to the highest black circle. Therefore, the relaxation of the current ripple constraint will increase the efficiency.
Figure 4 depicts the variation of inductance value around the optimum. Red squares represent inductance values that do not comply with the current ripple constraint, and black circles represent the admissible values. The minimum inductance that satisfies the restrictions corresponds to the highest black circle.
(a)
(b)
(a)
(b)
(a)
(b)
(a)
(b)
We proceed similarly for the capacitor design variable . The next plot shows that a variation around the optimal capacitor has very little influence on the efficiency.
This graphical process shows that (3.16) is the optimum result and allows us to determine which variables are limited by the design specifications. Finally, the slope of the lines gives an insight into the efficiency increase when a certain constraint is relaxed. Next, we extend this procedure to the buck converter and the synchronous buck converter.
4. A Comparison between Optimal Designs of Buck Converters and Synchronous Buck Converters
The object of this subsection is to show that the proposed procedure can be used to compare different alternatives once we have ensured that they are optimal. Again, we review the magnitudes of the buck and synchronous buck converter. Figure 1 shows these topologies.
4.1. The Design Magnitudes
The state equation corresponds, in both cases, to
Therefore, in the buck and synchronous buck converters, the current and voltage ripples corresponds, respectively, to
The continuous conduction mode constraint is
And the bandwidth can be expressed by
As in the boost converter, the buck converter’s losses occur in the MOSFET, diode, inductor, and capacitor. In the following subsection, we present each of these losses in detail.
4.1.1. Dissipated Power in Buck Converter Switches
MOSFET losses correspond to
And diode losses are described by
4.1.2. Losses in Passive Elements
The power dissipated by the inductor is
Similarly, the capacitor losses can be described by
4.1.3. Total Power Losses and Efficiency in the Buck Converter
Given the expressions (4.6)–(4.9), the total power losses in the buck converter are written as
4.1.4. Dissipated Power at Switches in Synchronous Buck Converter
Losses in the high side MOSFET in synchronous buck converter are the same as in the buck converter. Losses in the low side MOSFET corresponds to where represents the forward voltage drop in the body diode, and are the dead times introduced by the synchronous rectification, and corresponds to the body diode charge.
In addition, losses in the storage element are the same in both the buck and synchronous buck converter. Hence, the total power losses in the synchronous buck converter are written as
4.2. Optimization Program for Buck Converters and Synchronous Buck Converters
According to expressions (4.10) for the buck converters and (4.12) for the synchronous buck converters, the optimization program is expressed as
In the following section, we instantiate the objective function and the ripple constraints for both converters, and we provide and verify the solution.
4.2.1. Example of Optimal Design
Table 3 shows the input values for the buck converter and for the synchronous buck converter.

The parameters and of the synchronous buck converter are equal to 200 ns. The remaining of values are those in Tables 1 and 2.
Thus, the optimal values for each case are
As in the boost converter, we try also to optimize the bandwidth when the efficiency greater than 85%. The results are as follows: Again, there is a bandwidth increment at the expense of an efficiency decrease.
4.3. Verification of the Optimal Solution in Buck and Synchronous Buck Converters
The following plots verify that the optimum (4.14) has been reached and show the sensitivity to optimization variables.
It can be seen that the synchronous buck converter is more efficient than the buck converter and that the size of storing elements differs greatly.
5. Conclusions
The present paper describes a reliable and efficient procedure for optimizing DCDC converter design that is based on geometric programming. In order to illustrate the procedure, we apply it to a boost converter to show how it optimizes efficiency and bandwidth. Then, we compare optimal designs for a buck converter and a synchronous buck converter, considering both efficiency and bandwidth as optimization functions. We have used plots that show that the optimum has been reached, and they also give an insight into sensitivity to constraint bounds. Proposals to extend the procedure to ACDC and DCAC converters are being studied.
Acknowledgment
This work was partially supported by the Spanish Ministerio de Educación y Ciencia under Grants nos. DPI201016481 and DPI200914713C0302.
References
 V. Kursun, S. G. Narendra, V. K. De, and E. G. Friedman, “Lowvoltageswing monolithic DCDC conversion,” IEEE Transactions on Circuits and Systems II, vol. 51, no. 5, pp. 241–248, 2004. View at: Publisher Site  Google Scholar
 V. Yousefzadeh, E. Alarcón, and D. Maksimovic, “Efficiency optimization in linearassisted switching power converters for envelope tracking in RF power amplifiers,” in Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS '05), pp. 1302–1305, May 2005. View at: Publisher Site  Google Scholar
 M. D. Seeman and S. R. Sanders, “Analysis and optimization of switchedcapacitor DCDC converters,” in Proceedings of the 10th IEEE Workshop on Computers in Power Electronics (COMPEL '06), pp. 216–224, September 2006. View at: Publisher Site  Google Scholar
 S. Balachandran and F. C. Y. Lee, “Algorithms for power converter design optimization,” IEEE Transactions on Aerospace and Electronic Systems, vol. 17, no. 3, pp. 422–432, 1981. View at: Google Scholar
 C. J. Wu, F. C. Y. Lee, H. L. Goin, and S. Balachandran, “Design optimization for a halfbridge DCDC converter,” IEEE Transactions on Aerospace and Electronic Systems, vol. 18, no. 4, pp. 497–508, 1982. View at: Google Scholar
 S. BusquetsMonge, J. C. Crebier, S. Ragon et al., “Design of a boost power factor correction converter using optimization techniques,” IEEE Transactions on Power Electronics, vol. 19, no. 6, pp. 1388–1396, 2004. View at: Publisher Site  Google Scholar
 K. Sundareswaran and A. P. Kumar, “Voltage harmonic elimination in PWM AC chopper using genetic algorithm,” IEE Proceedings: Electric Power Applications, vol. 151, no. 1, pp. 26–31, 2004. View at: Publisher Site  Google Scholar
 T. C. Neugebauer and D. J. Perreault, “Computeraided optimization of DC/DC converters for automotive applications,” IEEE Transactions on Power Electronics, vol. 18, no. 3, pp. 775–783, 2003. View at: Publisher Site  Google Scholar
 M. Del Mar Hershenson, S. P. Boyd, and T. H. Lee, “Optimal design of a CMOS opamp via geometric programming,” IEEE Transactions on ComputerAided Design of Integrated Circuits and Systems, vol. 20, no. 1, pp. 1–21, 2001. View at: Publisher Site  Google Scholar
 R. A. Jabr, “Application of geometric programming to transformer design,” IEEE Transactions on Magnetics, vol. 41, no. 11, pp. 4261–4269, 2005. View at: Publisher Site  Google Scholar
 C. Candela, M. Morín, F. Blázquez, and C. A. Platero, “Optimal design of a salient poles permanent magnet synchronous motor using geometric programming and finite element method,” in Proceedings of the International Conference on Electrical Machines (ICEM '08), pp. 1–5, September 2008. View at: Publisher Site  Google Scholar
 S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, Cambridge, UK, 2004. View at: Zentralblatt MATH
 Y. Nesterov and A. Nemirovsky, InteriorPoint Polynomial Methods in Convex Programming, vol. 13 of Studies in Applied Mathematics, SIAM, Philadelphia, Pa, USA, 1994.
 N. Karmarkar, “A new polynomialtime algorithm for linear programming,” Combinatorica, vol. 4, no. 4, pp. 373–395, 1984. View at: Google Scholar
 R. W. Erickson, Fundamentals of Power Electronics, Kluwer Academic, Norwell, Mass, USA, 1999.
 S. Skogestad and I. Postlethwaite, Multivariable Feedback Control: Analysis and Design, John Wiley & Sons, New York, NY, USA, 2nd edition, 2005.
Copyright
Copyright © 2011 U. RibesMallada et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.