REDUCING THE COMPUTATIONAL COMPLEXITY OF FINITE IMPULSE RESPONSE FILTERS IN INTEGRATED SYSTEMS

Received: February 20, 2025
Revised: February 25, 2025
Accepted: March 28, 2025
1
Lviv Polytechnic National University
2
Lviv Polytechnic National University

The problem of optimizing finite impulse response (FIR) digital filters is relevant in the context of limited computational resources of embedded systems. Existing methods for implementing FIR filters often lead to significant energy consumption and processing time, which limits their application in real-world conditions. The objective of this work is to develop methods for optimizing FIR filters to reduce computational complexity and ensure efficient operation on embedded systems with limited resources. The research methodology includes the analysis of structurally optimized filter circuits, in particular multi-stage and block configurations, as well as the use of algorithms to reduce the bit depth of coefficients. The results of the study show that the proposed approaches can significantly reduce computational cost and power consumption without sacrificing filter quality. The novelty of the work lies in the combination of structural optimization methods with algorithmic techniques that consider the peculiarities of hardware implementation on embedded systems. The practical significance of the work lies in the possibility of using optimized filters for real-time signal processing on devices with limited resources. Directions for further research include studying the effectiveness of the optimization methods on different platforms, such as FPGAs and microcontrollers, as well as adaptation to different types of signals.

[1] T. Dutta, R. M. Aich, S. Dhabal and P. Venkateswaran, "Finite Impulse Response Filter Design using Grasshopper Optimization Algorithm and Implementation on FPGA," 2020 IEEE Applied Signal Processing Conference (ASPCON), Kolkata, India, 2020, pp. 313-317, https://doi.org/10.1109/ASPCON49795.2020.9276711.

[2] D. Kalaiyarasi and T. K. Reddy, "A hybrid window function to design finite impulse response low pass filter with an improved frequency response," 2017 International Conference on Energy, Communication, Data Analytics and Soft Computing (ICECDS), Chennai, India, 2017, pp. 138-143, https://doi.org/10.1109/ICECDS.2017.8389684.

[3] N. Singh and A. Potnis, "A review of different optimization algorithms for a linear phase FIR filter," 2017 International Conference on Recent Innovations in Signal processing and Embedded Systems (RISE), Bhopal, India, 2017, pp. 44-48, https://doi.org/10.1109/RISE.2017.8378122.

[4] N. Sajwan, A. Kumar, I. Sharma and L. K. Balyan, "Performance of Multiplierless FIR Filter based on CSD and Binary: A Comparative Study," 2019 International Conference on Signal Processing and Communication (ICSC), NOIDA, India, 2019, pp. 217-222, https://doi.org/10.1109/ICSC45622.2019.8938282.

[5] K. Loubna, B. Bachir and Z. Izeddine, "Optimal digital IIR filter design using ant colony optimization," 2018 4th International Conference on Optimization and Applications (ICOA), Mohammedia, Morocco, 2018, pp. 1-5, https://doi.org/10.1109/ICOA.2018.8370500.

[6] M. T. Khan and R. A. Shaik, "Analysis and Implementation of Block Least Mean Square Adaptive Filter using Offset Binary Coding," 2018 IEEE International Symposium on Circuits and Systems (ISCAS), Florence, Italy, 2018, pp. 1-5, https://doi.org/10.1109/ISCAS.2018.8350946.

[7] A. Wahbi, A. Roukhe and L. Hlou, "Enhancing the quality of voice communications by acoustic noise cancellation (ANC) using a low cost adaptive algorithm based Fast Fourier Transform (FFT) and circular convolution," 2014 9th International Conference on Intelligent Systems: Theories and Applications (SITA-14), Rabat, Morocco, 2014, pp. 1-7, https://doi.org/10.1109/SITA.2014.6847310.

[8] Z. Shang, "Recursive Algorithm FIR Filter Quantization and Low-Cost Structure Optimization Design Based on MATLAB and Simulink," 2023 IEEE 16th International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC), Singapore, 2023, pp. 530-535, https://doi.org/10.1109/MCSoC60832.2023.00084.