Selective Harmonic Elimination In Cascaded

H-Bridge Multilevel Inverter

Using Genetic Algorithm Approach
Mohammad Ali Hosseinzadeh1 , Maryam Sarbanzadeh1 , Yamisleydi Salgueiro1 , Marco Rivera1 and Patrick Wheeler2
1
Faculty of Engineering, Universidad de Talca, Curico, Chile
m.a hosseinzadeh@yahoo.com; maryam sarbanzadeh@yahoo.com; ysalgueiro@utalca.cl; marcoriv@utalca.cl
2
Faculty of Engineering, University of Nottingham, Nottingham, UK
pat.wheeler@nottingham.ac.uk

Abstract—Multilevel inverters are worked on medium-voltage
and high-power applications due to their ability to supply high
power quality output voltage. Hence, a low switching frequency
strategy is applied in high power applications since it generates
lower magnitudes of harmonics than high switching frequency.
In this paper, to eliminate high selective harmonic in a 15-
level cascaded multilevel inverter, a genetic algorithm approach
is proposed. Genetic algorithm is an evolutionary algorithm to
determine switching angles 15-level cascaded multilevel inverters
in order to eliminate selective harmonic. This paper calculates
the optimum angles as offline to eliminate harmonics 3rd , 5th ,7th ,
9th , 11th , 13th , 15th and 17th along with their multiples. Then,
the obtained angles are applied to simulation results to validate
the approach performance.
Index Terms—Genetic algorithm, cascaded multilevel inverter,
selective harmonic elimination (SHE).
I. I NTRODUCTION
Multi-level inverters (MLI) are among the most selected
power conversion devices in industrial applications. These
applications mostly comprise motor drives for all voltage
and power ratings. Multilevel inverters are also finding
their applications in grid-connected systems, uninterrupted
power supply (UPS), electric vehicles and FACTS devices.
All these applications are possible due to the ability of
the MLI to provide a superior output voltage with a more
sinusoidal shaped waveform, improved efficiency due to lower
switching frequency operation of switches, lower blocking
voltage requirement with reduced dv/dt and improved
electromagnetic compatibility [1], [2].
Multi-level inverters are suitable configurations for
achieving high voltage and high-quality waveform at the
output. Among different configurations, such as natural diode
clamped and flying capacitors multi-level inverters, cascaded
multilevel inverters due to the low number of components and
simple control are highly more considered than other types of
inverters in industrial applications. Performance principles of
multi-level inverters are based on the combination of dc input
supplies to achieve any desired voltage levels at the output.
In multi-level inverters, by increasing levels at the output can
reduce the magnitude of total harmonic distortions (THD)
compared to the two-level inverters [3].
Several researchers have used the selective harmonic
method to fix the main component of the output voltage and
reduce its harmonics by extracting mathematical equations.
Analytical solutions to solve this problem are presented
using the symmetric polynomial theory in reference [4]–[6].
The most important problem with this method is, finding an
analytic solution for nonlinear equations. These nonlinear
equations can be solved by repetitive methods such as the
Newton-Raphson method [7], [8]. Repeat-based methods
require an accurate initial guess. On the other hand, these
methods only find one category that depends on the initial
guess.
Today, evolutionary algorithms such as genetic algorithm
(GA), imperialist competitive algorithm, harmony search al-
gorithms, and particle swarm optimization are highly popular
[9], [10]. An important feature of these algorithms is that a
wide range of them do not possess an analytical response.
They will find the closest response to the problem [11].
In this paper, to find the optimal switching angles in order
to eliminate selective harmonics, a genetic algorithm approach
is proposed for a 15-level cascaded multi-level inverter. The
simulation results are presented to prove the efficiency and
performance of the proposed approach on a 15-level cascaded
multilevel inverter. This approach can be applied quite merely
on other multi-level inverters.
II. C ASCADED H-B RIDGE M ULTILEVEL I NVERTER
C ONFIGURATION
Fig. 1 shows the power topology of a single CHB inverter.
This configuration includes n CHBs as the cascaded connec-
tion. If the magnitudes of dc voltage sources are similarly
chosen, each CHB generates three similar voltage levels of ±

l-))) 

Authorized licensed use limited to: Universidad de Talca. Downloaded on August 07,2020 at 01:48:02 UTC from IEEE Xplore. Restrictions apply.
Vdc and 0 these configurations are called symmetric. There-
fore, the total number of voltage levels is as follows:

NL = 2n + 1 (1)
If the magnitudes of input dc voltage sources are chosen
differently, this topology called asymmetrical topology and
each CHB generates three different voltage levels of±V1dc ,
±V2dc , ±V3dc and 0.
Therefore, the total number of voltage levels is as follows:

NL = 2n+1 − 1 (2)

Fig. 1: CHB configurations: a) symmetrical topology; b) asymmetrical topology.

III. S ELECTIVE H ARMONIC E LEMINATION P ROBLEM

In this paper, an asymmetrical cascaded topology is investi-
gated which includes three CHBs and it generates 15 voltage
levels based on equation (2). The 15-level CHB topology is
shown in Fig. 2 along with the output voltage waveform. Table
II gives the switching pattern of the 15-level CHB inverter. Fig. 2: a) 15-level asymmetrical CHB; b) output voltage waveform.

The switching angles are θ1 , θ2 , θ3 , θ4 , θ5 , θ6 , θ7 . The output

voltage is the sum of each CHB output voltage. The output
waveform of the 15-level CHB inverter can be expressed as a
Fourier series as follows:

∞
 4
Vo (ωt) = (Vdc cos(nθ1 ) + (Vdc cos(nθ2 )+
n=1,3,5,7,...
nπ
· · · + (Vdc cos(nθ7 ))sin(ωt)
(3)
4
The nπ represents the maximum value of the main compo-
Fig. 3: Harmonic Spectrum of 15-Level based on staircase optimization Harmonic
nent of the output voltage of an H-bridge, and the creation of technique.
an adjustable modulation index can be used as follows:
V1 πV1
ma = = (4)
Vmax 4Vdc 15th and 17th and as well as their multiples. To eliminate the
Where ma is modulation is the index and V1 is the main mentioned harmonic orders, the relation of (6) should solve it
component of the output voltage of the proposed inveter. in order to achieve θ1 , to θ7 , with the condition as follows:
For the proposed topology, six switching angles should
come as a result. The selective harmonics that were considered π
in the proposed topology are the 3rd , 5th , 7th , 9th , 11th , 13th , θ1 < θ2 < θ3 < θ4 < θ5 < θ6 < θ7 < (5)
2



Authorized licensed use limited to: Universidad de Talca. Downloaded on August 07,2020 at 01:48:02 UTC from IEEE Xplore. Restrictions apply.
 TABLE I: Switching States of 15-Level Cascaded H-Bridge Inverter

Vo S11 S21 S31 S41 S12 S22 S32 S42 S13 S23 S33 S43
V1dc + V2dc + V3dc 1 0 0 1 1 0 0 1 1 0 0 1
V2dc + V3dc 1 0 1 0 1 0 0 1 1 0 0 1
V1dc + V3dc 1 0 0 1 1 0 1 0 1 0 0 1
V3dc 1 0 1 0 1 0 1 0 1 0 0 1
V1dc + V2dc 1 0 0 1 1 0 0 1 1 0 1 0
V2dc 1 0 1 0 1 0 0 1 1 0 1 0
V1dc 1 0 0 1 1 0 1 0 1 0 1 0
0 1 0 1 0 1 0 1 0 1 0 1 0
−V1dc 0 1 1 0 1 0 1 0 1 0 1 0
−V2dc 1 0 1 0 0 1 1 0 0 1 1 0
−(V1dc + V2dc ) 0 1 1 0 0 1 1 0 1 0 1 0
−V3dc 1 0 1 0 1 0 1 0 1 1 0 0
−(V1dc + V3dc ) 0 1 1 0 1 0 1 0 0 1 1 0
−(V2dc + V3dc ) 1 0 1 0 0 1 1 0 0 1 1 0
−(V1dc + V2dc + V3dc ) 0 1 1 0 0 1 1 0 0 1 1 0

that results from the combination and mutation in the chro-

mosomes.
4V1
cos(θ1 ) + cos(θ2 ) + cos(θ3 ) + · · · + cos(θ7 ) =
π A. Variables
cos(3θ1 ) + cos(3θ2 ) + cos(3θ3 ) + · · · + cos(3θ7 ) = 0 The purpose of applying genetic algorithm is to solve non-
cos(5θ1 ) + cos(5θ2 ) + cos(5θ3 ) + · · · + cos(5θ7 ) = 0 linear transcendental selective harmonics elimination equation
cos(7θ1 ) + cos(7θ2 ) + cos(7θ3 ) + · · · + cos(7θ7 ) = 0 set for switching angles. After calculating the switching an-
gles, they control of proposed topology to reduce of THD.
cos(9θ1 ) + cos(9θ2 ) + cos(9θ3 ) + · · · + cos(9θ7 ) = 0
Chromosomes are used as a solution for this kind of problem.
cos(11θ1 ) + cos(11θ2 ) + cos(11θ3 ) + · · · + cos(11θ7 ) = 0 Then each chromosome is defined as an array of variable
cos(13θ1 ) + cos(13θ2 ) + cos(13θ3 ) + · · · + cos(13θ7 ) = 0 values to be optimized. If the chromosome has Nv variables
cos(15θ1 ) + cos(15θ2 ) + cos(15θ3 ) + · · · + cos(15θ7 ) = 0 given by P1 , P2 .P3 , · · · , Nv then the chromosome is written
as an array with 1 × n elements so that:
cos(17θ1 ) + cos(17θ2 ) + cos(17θ3 ) + · · · + cos(17θ7 ) = 0
(6)
Ch = [P1 , P2 .P3 , · · · , Nv ] (7)
IV. G ENETIC A LGORITHM A PPROACH In case of reducing THD, variables are switching angles
Genetic algorithms are one of the random searching algo- that for a 15-level CHB inverter are equal to seven. So, the
rithms, whose idea is derived from nature. Genetic algorithms variable values are represented as a floating-point number.
have been highly successful for classical optimization methods
in solving linear, convex, and some similar problems, but
genetic algorithms are superiorly more efficient for solving dis-
crete and nonlinear problems. In nature, stronger generations
of superior chromosomes are formed. In the meantime, there
are some mutations that occur in the chromosomes, which may
lead to the next generation. The genetic algorithm also solves
the problem using this idea. The process of using genetic
algorithms is as follows:
a) Coding the problem solutions as chromosomes,
b) Introducing the value function,
c) Collecting the first population,
d) Introducing selection operators,
e) Introducing reproduction operators,
In genetic algorithms, first randomly or algorithmically, we Fig. 4: GA approach flowchart.
can generate several solutions for the problem. This set of
response is called primitive population. Each response is called
a chromosome. Then use the genetic algorithm’s operators, B. First Populations
after selecting the most suitable chromosomes, it combines First populations are necessary in order to start the contin-
the chromosomes, and it creates a leak in them. Eventually, uous genetic algorithm. The first population is often selected
it combines the current population with the new population randomly. The population size is defined by conserving the



Authorized licensed use limited to: Universidad de Talca. Downloaded on August 07,2020 at 01:48:02 UTC from IEEE Xplore. Restrictions apply.
nature of the problem, time complexity, and the search space of GA that applied to simulation results are shown in Table II
measure.In this paper, the population size is set to 100. in two different approaches.
C. Fitness Function TABLE II: GA Parameters

After following the definition of variables (switching an-

Parameters GA-I GA-II
gles), they should act so that the magnitude of selective Migration direction Forward Both
harmonics reached is close to zero in order to reduce the Population Size 50 100
percentage of THD. Therefore, for this kind of problem the Fitness Scaling Function Proportional Rank
Selection Function Uniform Tournament
fitness function is defined as follows: Elite Count 1.0 5.0
7
Crossover Fraction 0.3 0.5
 4V1 Mutation Function Uniform Constraint Dependent
f = min{ cos(θi ) = } (8) Crossover Function Single Point Two Point
i=1
π Hybrid Function None Fminsearch
D. Selection Operators
In order to cross, selection is a process that chooses two In this case, the variables are seven switching angles but the
parents from the population. The selection’s goal is to empha- voltage levels are considered constant, fifteen voltage levels
size fitter individuals in the population so that the offspring have a same height. First, the fitness function (FF) is defined
produced inherits higher fitness. The general idea is choosing as:
the appropriate chromosomes and produce generations. Ac-
cording to Darwins theory of evolution only the strongest and
the best individuals survive to participate in reproduction [12]. F F = cos(θ1 ) + cos(θ2 ) + cos(θ3 ) + · · · + cos(θ7 ) − 1 (9)
There are different selection processes in genetic algorithm: The total number of variables that correspond to the number
stochastic, ranking, roulette-wheel, and tournament selection. of switching angles are Nv = 7.
E. Crossover The relation between switching angles or linear inequalities
are as follows:
One of the most important is the one-point crossover. This
means that for each chromosome that is selected as parent, ⎡ ⎤ ⎡ ⎤
a cut is created randomly, and the new child includes the 1 −1 0 0 0 0 0 θ1
⎢0 1 −1 0 0 0 0⎥ ⎢θ1 ⎥
elemental chromosome from the parent first and the end ⎢ ⎥ ⎢ ⎥
⎢0 0 1 −1 0 0 0⎥ ⎢θ3 ⎥
portion of the parent second. ⎢ ⎥ ⎢ ⎥ π
L=⎢
⎢0 0 0 1 −1 0 0⎥⎥
⎢θ4 ⎥ 
⎢ ⎥ (10)
⎢0 0 2
F. Mutation
⎢ 0 0 1 −1 0 ⎥
⎥
⎢θ5 ⎥
⎢ ⎥
A mutation is a random jump that results in a new child and ⎣0 0 0 0 0 1 −1⎦ ⎣θ6 ⎦
it works after crossover. They change a specific percentage 0 0 0 0 0 0 1 θ7
in the chromosome list and named rate of mutation. The The amount of lower bound (LB) and upper bound (UB)
mutation is created by multiple variables that muted in the are defined as follows:
population. The procedure is repeated unit the minimizing
objective function is obtained. LB = 0 0 0 0 0 0 0 (11)
G. Replacement New Generation
Each replication of the algorithm that leads to the cre- UB = π π π π π π π
(12)
2 2 2 2 2 2 2
ation of a new population is called a generation. The new
generations created by selections such as a roulette-wheel The output voltage of a 15-level CHB based on switching
selection, stochastic universal selection, ranking selection and angles presented in Table III is shown in Fig. 4. The FFT
tournament selection), recombination, and mutation replaces analysis of the output voltage is shown in Fig. 5, It can
the original parental population. Finally, these steps are re- be can seen that, the magnitude of selected harmonics has
peated until one or more stopping criteria are met. been eliminated as a result of a GA approach which confirms
the validation of the GA algorithm for solving this kind of
V. S IMULATION R ESULTS problem. Some magnitude of harmonic order is shown in
In order to apply the proposed genetic algorithm approach Table. IV.
to solve the fitness function of selective harmonics elimina- In additional, the proposed GA approaches are run during
tion problem, MATLAB programming software is used for feasible solution region, during modulation index of values
calculation of seven switching angles of an asymmetrical 15- from 0.3 to 1.0 in steps of 0.1 has been presented in Table V.
level cascaded H-bridge inverter. Additionally, the simulation The feasible switching angles which produces minimum THD
results of the percentage of THD and fast Fourier Transform at that instant are represented and all switching angles are
(FFT) analysis of the 15-level CHB inverter were applied by expressed in degrees. It is observed that THD value gradually
use in MATLAB/Simulink software is applied. The parameters decreases and has the same value with first case study.



Authorized licensed use limited to: Universidad de Talca. Downloaded on August 07,2020 at 01:48:02 UTC from IEEE Xplore. Restrictions apply.
 TABLE III: Switching Angles Based On GA Parameters

States GA-I GA-II

θi◦ θ1◦ θ2◦ θ3◦ θ4◦ θ5◦ θ6◦ θ7◦ THD-I θ1◦ θ2◦ θ3◦ θ4◦ θ5◦ θ6◦ θ7◦ THD-II
1 28.99 10.48 23.43 40.85 07.04 49.61 63.65 3.22% 01.26 14.89 19.82 32.20 40.90 56.32 73.91 3.52%
2 01.60 14.89 19.99 32.25 40.96 56.32 73.91 3.47% 08.25 08.25 22.40 28.13 39.59 49.67 63.99 3.48%
3 07.04 10.94 24.46 63.42 449.15 40.56 28.41 3.34% 01.20 14.95 19.82 32.20 40.90 56.26 73.85 3.53%
4 10.31 06.70 40.56 29.16 23.09 63.94 49.79 3.12% 05.38 07.73 09.05 20.05 26.81 36.38 84.45 9.16%
5 08.53 23.20 88.86 36.26 67.15 89.32 50.64 6.40% 06.18 17.76 31.79 48.75 66.11 89.20 90.35 4.39%

TABLE IV: Harmonic Orders by obtained GA

Nh 1st 2nd 3rd 4th 5th 6th 7th

Percentage 100 0.690 0.006 1.553 0.003 0.001 0.074

TABLE V: Switching Angles Versus Modulation Index with GA Approaches

GA-I GA-II
M &θi◦ θ1◦ θ2◦ θ3◦ θ4◦ θ5◦ θ6◦ θ7◦ THD-I θ1◦ θ2◦ θ3◦ θ4◦ θ5◦ θ6◦ θ7◦ THD-II
M=0.3 09.39 28.18 46.98 68.14 89.38 89.49 89.49 7.96% 10.31 06.70 40.56 29.16 23.09 63.94 49.79 3.12%
M=0.4 01.37 14.89 19.88 32.20 40.90 56.32 73.91 3.51% 10.31 06.70 40.56 29.16 23.09 63.94 49.79 3.12%
M=0.5 05.21 13.92 24.80 35.00 49.33 66.23 66.23 3.52% 01.26 14.89 19.82 32.20 49.90 56.32 73.91 3.52%
M=0.6 08.30 06.70 40.56 29.16 23.09 63.94 49.79 3.13% 08.25 06.70 40.56 29.16 23.09 63.94 49.79 3.12%
M=0.7 08.25 06.70 40.56 29.16 23.09 63.94 49.79 3.12% 08.25 06.70 40.56 29.16 23.09 63.94 49.79 3.12%
M=0.8 08.25 06.70 40.56 29.16 23.09 63.94 49.79 3.12% 08.25 06.70 40.56 29.16 23.09 63.94 49.79 3.12%
M=0.9 08.25 06.70 40.56 29.16 23.09 63.94 49.79 3.12% 08.25 06.70 40.56 29.16 23.09 63.94 49.79 3.12%
M=1.0 08.25 06.70 40.56 29.16 23.09 63.94 49.79 3.12% 08.25 06.70 40.56 29.16 23.09 63.94 49.79 3.12%

Fig. 5: 15-level output voltage.

Fig. 7: switching angles versus modulation index

their multiples. The genetic algorithm approach was applied

Fig. 6: THD of output voltage of 15-level CHB.
Fig. 7 shows the variation between the modulation index and
switching angles with different approaches that are presented
based on Table V.
to a 15-level CHB inverter, in order to find optimum switching
angles, which corresponded to seven switching angles. Genetic
algorithm solved the problem of elimination of harmonic order
and reducing of the magnitude of THD. Consequently to
solving the problem by MATLAB GA optimization toolbox,
the simulation results of the 15-level CHB inverter were
proposed by MATLAB/Simulink to validate the performance
of the proposed approach.

VI. C ONCLUSION ACKNOWLEDGMENT

In this paper, a genetic algorithm approach was presented The authors wish to acknowledge the financial support of
for the elimination of the harmonics of 3rd to 17th order and FONDECYT Regular 1160690 Research Project.



Authorized licensed use limited to: Universidad de Talca. Downloaded on August 07,2020 at 01:48:02 UTC from IEEE Xplore. Restrictions apply.
 R EFERENCES
[1] Y. Li and Z. Quan, “Derivation of multilevel voltage source converter
topologies for medium voltage drives,” Chinese Journal of Electrical
Engineering, vol. 3, no. 2, pp. 24–31, September 2017.
[2] H. Samsami, A. Taheri, and R. Samanbakhsh, “New bidirectional
multilevel inverter topology with staircase cascading for symmetric and
asymmetric structures,” IET Power Electronics, vol. 10, no. 11, pp.
1315–1323, 2017.
[3] E. Babaei, M. Sarbanzadeh, M. A. Hosseinzadeh, and C. Cecati, “A new
basic unit for symmetric and asymmetric cascaded multilevel inverter
with reduced number of components,” pp. 3147–3152, Oct 2016.
[4] K. Yang, Q. Zhang, R. Yuan, W. Yu, J. Yuan, and J. Wang, “Selective
harmonic elimination with groebner bases and symmetric polynomials,”
IEEE Transactions on Power Electronics, vol. 31, no. 4, pp. 2742–2752,
April 2016.
[5] K. Yang, X. Lan, Q. Zhang, and X. Tang, “Unified selective harmonic
elimination for cascaded h-bridge asymmetric multilevel inverter,” IEEE
Journal of Emerging and Selected Topics in Power Electronics, pp. 1–1,
2018.
[6] P. L. Kamani and M. A. Mulla, “Middle-level she pulse-amplitude
modulation for cascaded multilevel inverters,” IEEE Transactions on
Industrial Electronics, vol. 65, no. 3, pp. 2828–2833, March 2018.
[7] S. Ahmad, I. Ashraf, A. Iqbal, and M. A. A. Fatimi, “She pwm for
multilevel inverter using modified nr and pattern generation for wide
range of solutions,” pp. 1–6, April 2018.
[8] P. B. Petrovi and D. Rozgi, “Computational effective modified newton
8211;raphson algorithm for power harmonics parameters estimation,”
IET Signal Processing, vol. 12, no. 5, pp. 590–598, 2018.
[9] M. H. Etesami, N. Farokhnia, and S. H. Fathi, “Colonial competitive
algorithm development toward harmonic minimization in multilevel
inverters,” IEEE Transactions on Industrial Informatics, vol. 11, no. 2,
pp. 459–466, April 2015.
[10] K. P. Panda and G. Panda, “Application of swarm optimisation-based
modified algorithm for selective harmonic elimination in reduced switch
count multilevel inverter,” IET Power Electronics, vol. 11, no. 8, pp.
1472–1482, 2018.
[11] K. T. Eddine, R. Abdelhadi, B. Omar, and O. Hassan, “A new multilevel
inverter with genetic algorithm optimization for hybrid power station
application,” in 2018 4th International Conference on Optimization and
Applications (ICOA), April 2018, pp. 1–6.
[12] A. Shukla, H. M. Pandey, and D. Mehrotra, “Comparative review of
selection techniques in genetic algorithm,” in 2015 International Con-
ference on Futuristic Trends on Computational Analysis and Knowledge
Management (ABLAZE), Feb 2015, pp. 515–519.



Authorized licensed use limited to: Universidad de Talca. Downloaded on August 07,2020 at 01:48:02 UTC from IEEE Xplore. Restrictions apply.