Fine-tuning digital FIR filters with gray wolf optimization for peak performance

Anand R1, Sathishkumar Samiappan2, M Prabukumar3

  • 1Department of Electrical and Electronics Engineering, Amrita School of Engineering, Coimbatore, Amrita Vishwa Vidyapeetham, India, 641112. r_anand2@cb.amrita.edu.

Scientific Reports
|June 3, 2024
PubMed
Summary

This study optimized digital filters using evolutionary algorithms. The Gray Wolf algorithm demonstrated superior performance in designing Finite Impulse Response (FIR) filters, achieving better precision and faster execution times.

Related Concept Videos

Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
89
Upsampling01:22

Upsampling

Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...
227
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
305
Reconstruction of Signal using Interpolation01:10

Reconstruction of Signal using Interpolation

Signal processing techniques are essential for accurately converting continuous signals to digital formats and vice versa. When a continuous signal is sampled with a period T, the resulting sampled signal exhibits replicas of the original spectrum in the frequency domain, spaced at intervals equal to the sampling frequency. To handle this sampled signal, a zero-order hold method can be applied, which creates a piecewise constant signal by retaining each sample's value until the next...
194
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
81
Time and frequency -Domain Interpretation of PI Control01:27

Time and frequency -Domain Interpretation of PI Control

Proportional-Integral (PI) controllers are essential in many control systems to improve stability and performance. They are commonly used in everyday devices like thermostats to enhance system damping and reduce steady-state error. When the zero in the controller's transfer function is optimally placed, the system benefits significantly in terms of stability and accuracy.
Acting as a low-pass filter, the PI controller slows the system's response and extends settling times. This requires...
117