Fractional order differentiation by integration and error analysis in noisy environment: Part 2 discrete case

In the first part of this work, the differentiation by integration method has been generalized from the integer order to the fractional order so as to estimate the fractional order derivatives of noisy signals. The estimation errors for the proposed fractional order Jacobi differentiators have been studied in continuous case. In this paper, the focus is on the study of these differentiators in discrete case. Firstly, the noise error contribution due to a large class of stochastic processes is studied in discrete case. In particular, it is shown that the differentiator based on the Caputo fractional order derivative can cope with a class of noises, the mean value and variance functions of which are time-variant. Secondly, by using the obtained noise error bound and the error bound for the bias term error obtained in the first part, we analyze the design parameters' influence on the obtained fractional order differentiators. Thirdly, according to the knowledge of the design parameters' influence, the fractional order Jacobi differentiators are significantly improved by admitting a time-delay. In order to reduce the calculation time for on-line applications, a recursive algorithm is proposed. Finally, numerical simulations show their accuracy and robustness with respect to corrupting noises

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

Design of digital differentiators

A digital differentiator simply involves the derivation of an input signal. This work includes the presentation of first-degree and second-degree differentiators, which are designed as both infinite-impulse-response (IIR) filters and finite-impulse-response (FIR) filters. The proposed differentiators have low-pass magnitude response characteristics, thereby rejecting noise frequencies higher than the cut-off frequency. Both steady-state frequency-domain characteristics and Time-domain analyses are given for the proposed differentiators. It is shown that the proposed differentiators perform well when compared to previously proposed filters. When considering the time-domain characteristics of the differentiators, the processing of quantized signals proved especially enlightening, in terms of the filtering effects of the proposed differentiators. The coefficients of the proposed differentiators are obtained using an optimization algorithm, while the optimization objectives include magnitude and phase response. The low-pass characteristic of the proposed differentiators is achieved by minimizing the filter variance. The low-pass differentiators designed show the steep roll-off, as well as having highly accurate magnitude response in the pass-band. While having a history of over three hundred years, the design of fractional differentiator has become a ‘hot topic’ in recent decades. One challenging problem in this area is that there are many different definitions to describe the fractional model, such as the Riemann-Liouville and Caputo definitions. Through use of a feedback structure, based on the Riemann-Liouville definition. It is shown that the performance of the fractional differentiator can be improved in both the frequency-domain and time-domain. Two applications based on the proposed differentiators are described in the thesis. Specifically, the first of these involves the application of second degree differentiators in the estimation of the frequency components of a power system. The second example concerns for an image processing, edge detection application

Discrete-time implementation and experimental validation of a fractional order PD controller for vibration suppression in airplane wings

Vibrations in airplane wings have a negative impact on the quality and safety of a flight. For this reason, active vibration suppression techniques are of extreme importance. In this paper, a smart beam is used as a simulator for the airplane wings and a fractional order PD controller is designed for active vibration mitigation. To implement the ideal fractional order controller on the smart beam unit, its digital approximation is required. In this paper, a new continuous-to-discrete-time operator is used to obtain the discrete-time approximation of the ideal fractional order PD controller. The efficiency and flexibility, as well as some guidelines for using this new operator, are given. The numerical examples show that high accuracy of approximation is obtained and that the proposed method can be considered as a suitable solution for obtaining the digital approximation of fractional order controllers. The experimental results demonstrate that the designed controller can significantly improve the vibration suppression in smart beams

Identification of Linear / Nonlinear Systems via the Coyote Optimization Algorithm (COA)

Classical techniques used in system identification, like the basic least mean square method (LMS) and its other forms; suffer from instability problems and convergence to a locally optimal solution instead of a global solution. These problems can be reduced by applying optimization techniques inspired by nature. This paper applies the Coyote optimization algorithm (COA) to identify linear or nonlinear systems. In the case of linear systems identification, the infinite impulse response (IIR) filter is used to constitute the plants. In this work, COA algorithm is applied to identify different plants, and its performance is investigated and compared to that based on particle swarm optimization algorithm (PSOA), which is considered as one of the simplest and most popular optimization algorithms. The performance is investigated for different cases including same order and reduced-order filter models. The acquired results illustrate the ability of the COA algorithm to obtain the lowest error between the proposed IIR filter and the actual system in most cases. Also, a statistical analysis is performed for the two algorithms. Also, the COA is used to optimize the identification process of nonlinear systems based on Hammerstein models. For this purpose, COA is used to determine the parameters of the Hammerstein models of two different examples, which were identified in the literature using other algorithms. For more investigation, the fulfillment of the COA is compared to that of some other competitive heuristic algorithms. Most of the results prove the effectiveness of COA in system identification problems

A versatile iterative framework for the reconstruction of bandlimited signals from their nonuniform samples

In this paper, we study a versatile iterative framework for the reconstruction of uniform samples from nonuniform samples of bandlimited signals. Assuming the input signal is slightly oversampled, we first show that its uniform and nonuniform samples in the frequency band of interest can be expressed as a system of linear equations using fractional delay digital filters. Then we develop an iterative framework, which enables the development and convergence analysis of efficient iterative reconstruction algorithms. In particular, we study the Richardson iteration in detail to illustrate how the reconstruction problem can be solved iteratively, and show that the iterative method can be efficiently implemented using Farrow-based variable digital filters with few general-purpose multipliers. Under the proposed framework, we also present a completed and systematic convergence analysis to determine the convergence conditions. Simulation results show that the iterative method converges more rapidly and closer to the true solution (i.e. the uniform samples) than conventional iterative methods using truncation of sinc series. © 2010 The Author(s).published_or_final_versionSpringer Open Choice, 21 Feb 201

On Generalized Fractional Differentiator Signals

By employing the generalized fractional differential operator, we introduce a system of fractional order derivative for a uniformly sampled polynomial signal. The calculation of the bring in signal depends on the additive combination of the weighted bring-in of N cascaded digital differentiators. The weights are imposed in a closed formula containing the Stirling numbers of the first kind. The approach taken in this work is to consider that signal function in terms of Newton series. The convergence of the system to a fractional time differentiator is discussed

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

Digital Filters and Signal Processing

Digital filters, together with signal processing, are being employed in the new technologies and information systems, and are implemented in different areas and applications. Digital filters and signal processing are used with no costs and they can be adapted to different cases with great flexibility and reliability. This book presents advanced developments in digital filters and signal process methods covering different cases studies. They present the main essence of the subject, with the principal approaches to the most recent mathematical models that are being employed worldwide