Adaptive notch filtering for tracking multiple complex sinusoid signals

This thesis is related to the field of digital signal processing; where the aim of this research is to develop features of an infinite impulse response adaptive notch filter capable of tracking multiple complex sinusoid signals. Adaptive notch filters are commonly used in: Radar, Sonar, and Communication systems, and have the ability to track the frequencies of real or complex sinusoid signals; thus removing noise from an estimate, and enhancing the performance of a system. This research programme began by implementing four currently proposed adaptive notch structures. These structures were simulated and compared: for tracking between two and four signals; however, in their current form they are only capable of tracking real sinusoid signals. Next, one of these structures is developed further, to facilitate the ability to track complex sinusoid signals. This original structure gives superior performance over Regalia's comparable structure under certain conditions, which has been proven by simulations and results. Complex adaptive notch filter structures generally contain two parameters: the first tracks a target frequency, then the second controls the adaptive notch filter's bandwidth. This thesis develops the notch filter, so that the bandwidth parameter can be adapted via a method of steepest ascent; and also investigates tracking complex-valued chirp signals. Lastly, stochastic search methods are considered; and particle swarm optimisation has been applied to reinitialise an adaptive notch filter, when tracking two signals; thus more quickly locating an unknown frequency, after the frequency of the complex sinusoid signal jumps

Chaotic multi-objective optimization based design of fractional order PI{\lambda}D{\mu} controller in AVR system

In this paper, a fractional order (FO) PI{\lambda}D\mu controller is designed to take care of various contradictory objective functions for an Automatic Voltage Regulator (AVR) system. An improved evolutionary Non-dominated Sorting Genetic Algorithm II (NSGA II), which is augmented with a chaotic map for greater effectiveness, is used for the multi-objective optimization problem. The Pareto fronts showing the trade-off between different design criteria are obtained for the PI{\lambda}D\mu and PID controller. A comparative analysis is done with respect to the standard PID controller to demonstrate the merits and demerits of the fractional order PI{\lambda}D\mu controller.Comment: 30 pages, 14 figure

Particle swarming of sensor correction filters

Reducing the impact of seismic activity on the motion of suspended optics is essential for the operation of ground-based gravitational wave detectors. During periods of increased seismic activity, low-frequency ground translation and tilt cause the Advanced LIGO observatories to lose 'lock', reducing their duty cycles. This paper applies modern global-optimisation algorithms to aid in the design of the 'sensor correction' filter, used in the control of the active platforms. It is shown that a particle swarm algorithm that minimises a cost-function approximating the differential root mean squared velocity between platforms can produce control filters that perform better across most frequencies in the control bandwidth than those currently installed. These tests were conducted using training data from the LIGO Hanford Observatory seismic instruments and simulations of the Horizontal Access Module Internal Seismic Isolation platforms. These results show that new methods of producing control filters are ready for use at LIGO. The filters were implemented at LIGO's Hanford Observatory, and use the resulting data to refine the cost function. © 2020 IOP Publishing Ltd Printed in the U

Digital Filter Design Using Improved Teaching-Learning-Based Optimization

Digital filters are an important part of digital signal processing systems. Digital filters are divided into finite impulse response (FIR) digital filters and infinite impulse response (IIR) digital filters according to the length of their impulse responses. An FIR digital filter is easier to implement than an IIR digital filter because of its linear phase and stability properties. In terms of the stability of an IIR digital filter, the poles generated in the denominator are subject to stability constraints. In addition, a digital filter can be categorized as one-dimensional or multi-dimensional digital filters according to the dimensions of the signal to be processed. However, for the design of IIR digital filters, traditional design methods have the disadvantages of easy to fall into a local optimum and slow convergence. The Teaching-Learning-Based optimization (TLBO) algorithm has been proven beneficial in a wide range of engineering applications. To this end, this dissertation focusses on using TLBO and its improved algorithms to design five types of digital filters, which include linear phase FIR digital filters, multiobjective general FIR digital filters, multiobjective IIR digital filters, two-dimensional (2-D) linear phase FIR digital filters, and 2-D nonlinear phase FIR digital filters. Among them, linear phase FIR digital filters, 2-D linear phase FIR digital filters, and 2-D nonlinear phase FIR digital filters use single-objective type of TLBO algorithms to optimize; multiobjective general FIR digital filters use multiobjective non-dominated TLBO (MOTLBO) algorithm to optimize; and multiobjective IIR digital filters use MOTLBO with Euclidean distance to optimize. The design results of the five types of filter designs are compared to those obtained by other state-of-the-art design methods. In this dissertation, two major improvements are proposed to enhance the performance of the standard TLBO algorithm. The first improvement is to apply a gradient-based learning to replace the TLBO learner phase to reduce approximation error(s) and CPU time without sacrificing design accuracy for linear phase FIR digital filter design. The second improvement is to incorporate Manhattan distance to simplify the procedure of the multiobjective non-dominated TLBO (MOTLBO) algorithm for general FIR digital filter design. The design results obtained by the two improvements have demonstrated their efficiency and effectiveness

Applications of gravitational search algorithm in engineering

Gravitational search algorithm (GSA) is a nature-inspired conceptual framework with roots in gravitational kinematics, a branch of physics that models the motion of masses moving under the influence of gravity. In a recent article the authors reviewed the principles of GSA. This article presents a review of applications of GSA in engineering including combinatorial optimization problems, economic load dispatch problem, economic and emission dispatch problem, optimal power flow problem, optimal reactive power dispatch problem, energy management system problem, clustering and classification problem, feature subset selection problem, parameter identification, training neural networks, traveling salesman problem, filter design and communication systems, unit commitment problem and multiobjective optimization problems

A Genetic algorithm for the optimal design of a multistage amplifier

The optimal sizing of analog circuits is one of the most complicated processes, because of the number of variables taken into, to the number of required objectives to be optimized and to the constraint functions restrictions. The aim is to automate this activity in order to accelerate the circuits design and sizing. In this paper, we deal with the optimization of the three stage bipolar transistor amplifier performances namely the voltage gain (AV), the input impedance (ZIN), the output impedance (ZOUT), the power consumption (P) and the low and the high cutoff frequency (FL,FH), through the Genetic Algorithm (GA). The presented optimization problem is of multi-dimensional parameters, and the trade-off of all parameters. In fact, the passive components (Resistors and Capacitors) are selected from manufactured constant values (E12, E24, E48, E96, E192) for the purpose of reduce the cost of design; also, the intrinsic parameters of transistors (hybrid parameters and the junction capacitances) are considered variables in order not to be limited in design. SPICE simulation is used to validate the obtained result/performances

Designs of Digital Filters and Neural Networks using Firefly Algorithm

Firefly algorithm is an evolutionary algorithm that can be used to solve complex multi-parameter problems in less time. The algorithm was applied to design digital filters of different orders as well as to determine the parameters of complex neural network designs. Digital filters have several applications in the fields of control systems, aerospace, telecommunication, medical equipment and applications, digital appliances, audio recognition processes etc. An Artificial Neural Network (ANN) is an information processing paradigm that is inspired by the way biological nervous systems, such as the brain, processes information and can be simulated using a computer to perform certain specific tasks like clustering, classification, and pattern recognition etc. The results of the designs using Firefly algorithm was compared to the state of the art algorithms and found that the digital filter designs produce results close to the Parks McClellan method which shows the algorithm’s capability of handling complex problems. Also, for the neural network designs, Firefly algorithm was able to efficiently optimize a number of parameter values. The performance of the algorithm was tested by introducing various input noise levels to the training inputs of the neural network designs and it produced the desired output with negligible error in a time-efficient manner. Overall, Firefly algorithm was found to be competitive in solving the complex design optimization problems like other popular optimization algorithms such as Differential Evolution, Particle Swarm Optimization and Genetic Algorithm. It provides a number of adjustable parameters which can be tuned according to the specified problem so that it can be applied to a number of optimization problems and is capable of producing quality results in a reasonable amount of time

Digital Filter Design Using Multiobjective Cuckoo Search Algorithm

Digital filters can be divided into finite impulse response (FIR) digital filters and infinite impulse response (IIR) digital filters. Evolutionary algorithms are effective techniques in digital filter designs. One such evolutionary algorithm is Cuckoo Search Algorithm (CSA). The CSA is a heuristic algorithm which emulates a special parasitic hatching habit of some species of cuckoos and have been proved to be an effective method with various applications. This thesis compares CSA with Park-McClellan algorithm on linear-phase FIR Type-1 lowpass, highpass, bandpass and bandstop digital filter design. Furthermore, a multiobjective Cuckoo Search Algorithm (MOCSA) is applied on general FIR digital design with a comparison to Non-dominated Sorting Genetic Algorithm III (NSGA-III). Finally, a constrained multiobjective Cuckoo Search Algorithm is presented and used for IIR digital filter design. The design results of the constrained MOCSA approach compares favorably with other state-of-the-art optimization methods. CSA utilizes Levy flight with wide-range step length for the global walk to assure reaching the global optimum and the approach of local walk to orientate the direction toward the local minima. Furthermore, MOCSA incorporates a method of Euclidean distance combing objective-based equilibrating operations and the searching for the optimal solution into one step and simplifies the procedure of comparison

Digital Filter Design Using Improved Artificial Bee Colony Algorithms

Digital filters are often used in digital signal processing applications. The design objective of a digital filter is to find the optimal set of filter coefficients, which satisfies the desired specifications of magnitude and group delay responses. Evolutionary algorithms are population-based meta-heuristic algorithms inspired by the biological behaviors of species. Compared to gradient-based optimization algorithms such as steepest descent and Newton’s like methods, these bio-inspired algorithms have the advantages of not getting stuck at local optima and being independent of the starting point in the solution space. The limitations of evolutionary algorithms include the presence of control parameters, problem specific tuning procedure, premature convergence and slower convergence rate. The artificial bee colony (ABC) algorithm is a swarm-based search meta-heuristic algorithm inspired by the foraging behaviors of honey bee colonies, with the benefit of a relatively fewer control parameters. In its original form, the ABC algorithm has certain limitations such as low convergence rate, and insufficient balance between exploration and exploitation in the search equations. In this dissertation, an ABC-AMR algorithm is proposed by incorporating an adaptive modification rate (AMR) into the original ABC algorithm to increase convergence rate by adjusting the balance between exploration and exploitation in the search equations through an adaptive determination of the number of parameters to be updated in every iteration. A constrained ABC-AMR algorithm is also developed for solving constrained optimization problems.There are many real-world problems requiring simultaneous optimizations of more than one conflicting objectives. Multiobjective (MO) optimization produces a set of feasible solutions called the Pareto front instead of a single optimum solution. For multiobjective optimization, if a decision maker’s preferences can be incorporated during the optimization process, the search process can be confined to the region of interest instead of searching the entire region. In this dissertation, two algorithms are developed for such incorporation. The first one is a reference-point-based MOABC algorithm in which a decision maker’s preferences are included in the optimization process as the reference point. The second one is a physical-programming-based MOABC algorithm in which physical programming is used for setting the region of interest of a decision maker. In this dissertation, the four developed algorithms are applied to solve digital filter design problems. The ABC-AMR algorithm is used to design Types 3 and 4 linear phase FIR differentiators, and the results are compared to those obtained by the original ABC algorithm, three improved ABC algorithms, and the Parks-McClellan algorithm. The constrained ABC-AMR algorithm is applied to the design of sparse Type 1 linear phase FIR filters of filter orders 60, 70 and 80, and the results are compared to three state-of-the-art design methods. The reference-point-based multiobjective ABC algorithm is used to design of asymmetric lowpass, highpass, bandpass and bandstop FIR filters, and the results are compared to those obtained by the preference-based multiobjective differential evolution algorithm. The physical-programming-based multiobjective ABC algorithm is used to design IIR lowpass, highpass and bandpass filters, and the results are compared to three state-of-the-art design methods. Based on the obtained design results, the four design algorithms are shown to be competitive as compared to the state-of-the-art design methods