 Research
 Open access
 Published:
A variable step size least mean ppower adaptive filtering algorithm based on multimoment error fusion
EURASIP Journal on Advances in Signal Processing volume 2023, Article number: 77 (2023)
Abstract
For the channel estimation problem under αstable distributed impulse interference, the traditional fixedstep adaptive filtering cannot satisfy the fast convergence speed and low steadystate error at the same time, whereas the variablestep method is able to effectively solve this contradiction. This paper proposes an improved variable stepsize least mean ppower adaptive algorithm that offers good robustness against impulsive noise. The proposed algorithm takes into account the linkage between the errors and uses the adjustment of the step size based on the errors of the current moment and the previous k moments, thus overcoming the problems of poor antinoise performance and large steadystate fluctuations of the fixedstep size algorithm. This algorithm ensures that the step size does not change abruptly when the system is disturbed by impulse noise and can achieve a lower steadystate error. The simulation results show that the algorithm has better convergence than the traditional fixed stepsize algorithm and the existing variable stepsize algorithm under the interference of impulsive noise.
1 Introduction
In many cases where adaptive algorithms are used for channel estimation, fixed step sizes are often designed to facilitate engineering applications. Under this case, a compromise is often required between fast adaptation to overcome input variations and slow adaptation to cope with system noise in order to obtain the best performance [1]. For this problem, a large strand of research has made improvements on the basis of the traditional fixed stepsize least mean square (LMS) adaptive algorithm, so that the algorithm can change the step size with the change of the mean square error, thus solving the problem faced previously and achieving better results [2, 3]. However, the above methods are applied in the environment of Gaussian noise, but in practical engineering applications the system is often disturbed by a large amount of nonGaussian noise. The literature has shown that the most coastal areas around the world are flooded with impulsive interference in the hydroacoustic channel due to the presence of a large number of drum shrimp family organisms (which emit strong pulses by opening and closing the knuckles of their large cheeks) [4]. The traditional LMS algorithm only takes into account the secondorder statistics of data, and so it works well under Gaussian noise interference but performs generally when it encounters nonGaussian noise such as impulse noise [5]. To overcome this problem, researchers have proposed the least mean ppower (LMP) algorithm by using lowerorder statistics of the data to replace the secondorder statistics [6, 7]. LMP algorithm is a nonlinear filtering algorithm that uses generalized correntropy as the cost function. Compared with traditional adaptive filtering algorithms, LMP algorithm has better robustness in dealing with impulsive interference, sparse channels or abrupt channel changes. Therefore, this paper improves the LMP algorithm when estimating the underwater acoustic channel under impulse interference. The system block diagram of the general adaptive filtering algorithm to implement channel estimation is shown in Fig. 1.
2 Proposed algorithm
The step size of the traditional LMP algorithm is a fixed value, which cannot meet the requirements of faster convergence speed and lower steadystate error at the same time. Therefore, it is necessary to speed up convergence speed in the initial stage of adaptation and reduce system error after reaching a steady state. Variable step size is an effective method to solve the algorithm’s convergence speed and steadystate error, but the traditional variable stepsize algorithm only considers the current update error and ignores the influence of errors at other moments. In an actual simulation, it is found that although the convergence effect is better than those of other algorithms, it does not meet expectations. Therefore, based on the traditional variable stepsize LMP (VSSLMP) algorithm, this paper considers the influence of the error of the previous several times on the current state and constructs the error function about the previous k times as the stepsize update basis of the adaptive algorithm. The block diagram of proposed algorithm appears in Fig. 2.
One effective way to improve the convergence speed is to design a formula with variable step size. The error can be used to update the step size. Thus, a larger step size can be given by the variable stepsize function when the error between the desired signal and the output signal is large, which can accelerate the convergence process. In the presence of impulsive noise disturbance that produces results far from the actual situation, the connection between the previous and the generated step size is hard to establish because of the large error signal.
As such, some scholars construct a deformation Gaussian function to resolve the effect of convergence due to the sudden change of error [8]. The formula is:
This is a stepupdate function, thus achieving antipulse interference. However, when studying the algorithm, it is found that the effect is not ideal in the case of large impulsive noise. To further improve its conversion effect, we enhance the algorithm and propose an Improved Variable StepSize Least Mean pPower (IVSSLMP) algorithm, by introducing the equation:
where \(k_{{{\text{ap}}}} > 0\). We use this formula to correct the step size, which makes the algorithm give a better convergence effect. Since the error of the previous k terms is introduced, the value of the parameter k cannot be large in order to ensure a realtime update. Hence, choosing a suitable value of the parameter k is crucial for this algorithm.
The weighted moving average method is often used in mathematics to predict future values. Considering the correlation between steps, we also use the weighted moving average method to build the performance stable. The formula is
This weighs the steadystate misalignment and convergence speed. The pseudocode process of proposed algorithm is shown in Table 1.
3 Convergence analysis
To prove the stability of the algorithm, it is necessary to analyze the convergence score of the algorithm by first defining the initial conditions, \(f_{e} \left( 0 \right) = 0\) and \(\mu \left( 0 \right) = 0\). We modify Eqs. (2) and (3) to:
Here,
We constructing the function g(y):
By calculating the derivative of this function, we can see that the function has a maximum value \(e^{  1}\) at \(y = 1\). Therefore, Eq. (6) can be written as:
Bringing Eq. (8) into (4), we get:
When \(0 < \theta < 1\), we get the following inequality:
The formula for updating the weights of the IVSSLMP algorithm is:
Here, \(\mu [f_{e} (n)]\left {e\left( n \right)} \right^{{\left( {p  1} \right)}}\) can be considered as the total step length of the LMS algorithm, The algorithm converges only when the step size in the LMS algorithm satisfies \(0 < \mu < \frac{2}{{3{\text{tr}}\left( R \right)}}\) [9]. Therefore, the IVSSLMP algorithm step size should satisfy:
Here, \({\text{tr}}\left( \cdot \right)\) denotes the trace of the matrix, \(R = E\left[ {x^{T} \left( n \right)x\left( n \right)} \right]\) is the autocorrelation matrix of the input signal, and \(0 < p < \alpha\) (α is the parameter of impulsive noise). Thus, \(\left {e\left( n \right)} \right^{p  2} \le 1\).
Bringing Eq. (9) into (12) yields the inequality:
Therefore, the proposed LMP algorithm converges when the parameters satisfy the above formula.
4 Simulation analysis
This study applies the proposed IVSSLMP algorithm to channel estimation under αstable distributed impulsive noise interference, where the input signal x(n) obeys a Gaussian distribution with mean 0 and variance 1. The weight vector w_{0} of the unknown system also obeys a Gaussian distribution with mean 0. The filter order is M = 128, and the number of sampling points performed is 20,000 points each time. In order to reflect the performance of the algorithm in the case of abrupt changes in the system, the system is abruptly changed at 10,000 iterations (using the method of changing the weight vector to the opposite of the original). The final simulation results are then averaged over 20 Monte Carlo simulations to obtain a more easily comparable simulation [10].
To better measure the performance of the algorithm in channel estimation, this paper applies Normalized Mean Square Deviation (NMSD) of the weights to reflect the effect of the algorithm. The estimated channel parameters are compared with the original simulated channel parameters by normalizing the difference, so as to reflect the effectiveness of the algorithm more intuitively and accurately. A smaller NMSD value indicates that the convergence of the algorithm is better. The expression is:
In the simulation experiments, αstable distribution is used as the impulsive noise model. The steadystate distribution noise is a class of random noise with linear spikes and trailing effect. It does not have a uniform probability density function, but rather a unified characteristic function [11], which can be expressed as:
Here, \({\text{sgn}} \left( \cdot \right)\) is the sign function:
Since impulsive noise does not have secondorder statistics such as variance and correlation functions, the traditional signaltonoise ratio function is ineffective under the αstable distributed noise. Hence, the following equation can be used to measure the signaltonoise ratio of impulsive noise to the useful signal [12]:
Here, σ_{s}^{2} is the variance of the input signal, and γ is the dispersion coefficient of the αstable distribution.
4.1 Comparison with unimproved algorithm
By comparing the error functions before and after the improvement, we can visually analyze the difference between the improved algorithm and the one before the improvement. The following involves parameter θ taking the value of 0.98, parameter k_{ap} taking the value of 1, parameter α taking the value of 0.0007, parameter β taking the value of 0.004, and parameter k taking the value of 3. In order to compare the effect of two error functions more intuitively, the error function is treated logarithmically, as shown in Fig. 3.
In this figure the variance of the error function of VSSLMP is 543.4234, and the variance of the error function of IVSSLMP is 191.2481. From the figure we also find in the face of impulsive noise that the error function constructed by IVSSLMP has smaller fluctuations than the direct use of error; i.e., better robustness against impulsive noise. Using this property, the algorithm can achieve a lower normalized mean square error at convergence.
From a comparison with the algorithm before the improvement, the following is the result of the simulation with the same parameters except for the newly added variables. Here, 123 represents the three parameter cases respectively, as shown in Table 2.
The simulation of VSSLMP and the improved IVSSLMP are compared according to the parameters in the table. The comparison results appear in Fig. 4.
A comparison of the performance under random parameters shows that the errors at convergence of the IVSSLMP algorithm are lower than those of the VSSLMP algorithm before the improvement. The remaining parameters are guaranteed to be unchanged except for the newly added parameters.
4.2 Parameter analysis
To investigate the effect of parameter k on the performance of the algorithm, parameter k_{ap} is taken as 1, smoothing factor θ is taken as 0.97, parameter α is taken as 0.001, parameter β is taken as 0.0038, and algorithm parametric number p is taken as 1.15, The above parameters are selected by trialanderror method under the condition of step stability to obtain the best value [13]. Parameter k is taken as 2, 3, 4, and 5 respectively, in order to compare the effect of parameter k on the algorithm more intuitively. The algorithm before improvement is also added as a reference. The simulation pulsive noise parameters are N = [1.5, 0, 0.04, 0], and the noise signal is shown in Fig. 5.
Under the simulation pulse noise, the algorithm performance curve is shown in Fig. 6.
Analysis of the graph shows that the NMSD values when the algorithm converges are − 26.82 dB, − 23.33 dB, − 22.08 dB, and − 20.14 dB when the values of k are taken as 1, 2, 3, 4, and 5, respectively. Compared to VSSLMP (i.e., when no forward multiple error correction is made, with an increasing value of k, the convergence rate gradually decreases. However, after convergence in order to achieve a lower NMSD, for the variable hydroacoustic channel environment, a low error is particularly important, and from the simulation it can be seen that the algorithm with forward error correction has a significant improvement in the convergence effect. The difference in the steady state achieved for values of k greater than 3 is not significant. Moreover, the performance of the improved algorithm decreases compared to the original algorithm for values of parameter k greater than or equal to 5. Combining the time required to reach steady state with the value of NMSD, the simulation is relatively better at parameter k = 3.
To research the effect of parameter θ on the performance of the algorithm, the value of parameter k is taken as 3, the value of θ is taken as 0.86, 0.87, 0.88, 0.89, 0.96, 0.97, 0.98, and 0.99, and other parameters remain constant. The performance of the algorithm is shown in Fig. 7.
By analyzing the graph, we see that as the value of θ becomes larger, the time required to reach steady state increases while still being able to reach a lower steady state. The simulation figure shows that θ of the algorithm can affect system convergence. With all other parameters being the same, the convergence is better when θ is close to 1. In the case of changing only θ, the better the convergence effect is, the more times it takes to reach steadystate convergence. At θ = 0.98, the fluctuation of NMSD after reaching steady state is smaller, and so the value of parameter θ is taken as 0.98.
To study the effect of parameter α on the performance of the algorithm, the value of parameter θ is taken as 0.98, the value of parameter α is taken as 0.0004, 0.0005, 0.0006, 0.0007, 0.0008, and 0.0009, and other parameters remain constant. The performance of the algorithm appears as the Fig. 8.
Analyzing this figure, the value of parameter α affects convergence speed as well as the convergence effect when the steady state is reached. As the value of α increases from 0.0004 to 0.0009, the number of algorithm convergence steps are respectively 5467, 4399, 3940, 3520, 3043, and 2621, and the convergence speed keeps getting faster. After convergence of the algorithm, NMSD values are − 27.43 dB, − 26.11 dB, − 25.45 dB, − 24.71 dB, − 24.08 dB, and − 23.18 dB, respectively. From the data, we see that the gain is very high at the beginning when the value of α decreases; i.e., sacrificing less convergence speed in exchange for better convergence. However, as α decreases further, the gains start to decline, even sacrificing more than double the previous number of steps while gaining the same convergence effect. Therefore, considering the two factors, parameter α is taken as 0.0006.
To study the effect of parameter β on the performance of the algorithm, the value of parameter α is taken as 0.0007 and the value of parameter β is taken as 0.001, 0.003, 0.004, 0.005, 0.007, and 0.01. The simulation results appear as the Fig. 9.
Analyzing this figure, the steadystate fluctuation is larger when β is small. As β increases, the convergence speed decreases, but the steadystate error turns higher. The magnitude of fluctuation after reaching the steady state is integrated, and parameter β at 0.004 in this algorithm is better.
To analyze the effect of parameter k_{ap} on the algorithm, the parameter β value is 0.004 and the parameter k_{ap} values are set to 0.8, 0.9, 1.0, 1.1, 1.2, and 1.3. The simulation yields in Fig. 10.
The figure shows that as the k_{ap} value increases, the convergence speed becomes faster, the convergence error increases, and better gains can be obtained by increasing the k_{ap} value when the k_{ap} value is low (getting faster at the expense of the same NMSD). We also find when the parameter k_{ap} value is greater than 1 that the ratio of convergence speed to the number of iterations changes rapidly. In the case of k_{ap} values of 1.1 and 1.2, the convergence effect is similar, but in the case of k_{ap} value of 1.1, there is less fluctuation after convergence. Taking this into account, the value of k_{ap} in this algorithm is 1.1.
4.3 Comparison of simulated channel algorithms
We now introduce the improved sigmoid functionbased [14] into the LMP algorithm to form the sigmoid variable stepsize least mean ppower (SVSLMP) algorithm. We then add the improved inverse hyperbolic tangent function [15] into the LMP algorithm to form the inverse hyperbolic tangent variable stepsize LMP (IHTVSLMP) algorithm. Lastly, we present a normal distribution curve [16] to construct a normal distribution curve stepsize LMP (NDCSLMP) algorithm. Here, each algorithmic parameter is adjusted to the appropriate value, as shown in Table 3.
The simulation is shown in Fig. 11.
Comparing the simulation plots of different algorithms in the literature with a signaltonoise ratio of 24 dB, the LMS algorithm suffers from poor convergence performance when faced with impulse interference. Therefore, we adopt the LMP algorithm to improve the convergence performance under impulse interference. Through comparison of the convergence performance, we show that the proposed algorithm achieves better convergence performance with the same number of iterations, and has lower steadystate error than the existing algorithms. Moreover, the proposed algorithm exhibits significant improvement in scenarios where the channel undergoes abrupt changes.
4.4 Comparison of actual channel algorithms
To further investigate the performance of each algorithm, this section applies IVSSLMP to an actual channel for comparison. Under impulsive noise, the measured hydroacoustic channel impulse response is identified as a weight vector in this section, and the estimation performance of each algorithm is simulated. The actual measured channel impact response at a given moment in Norwegian waters [17] is shown in Fig. 12.
The impulse response of the actual hydroacoustic channel is sampled at 1 kHz, and the length of the channel is 256 ms. Thus, this section selects it as the unknown system response to be identified. The number of sampling points is 2 × 10^{4}, and at 1 × 10^{4} sampling moments, the system undergoes a sudden change; i.e., the channel impulse response is inverted, where the parameters of the comparison signal are shown in Table 4.
The convergence curves of each algorithm are shown in Figs. 13 and 14.
The data in Fig. 13 shows that the LMS algorithm fails to converge in the presence of impulse interference in a realistic underwater acoustic channel. By contrast, the experimental data we find in Fig. 14 demonstrates that the proposed algorithm can obtain better convergence in channel estimation of real hydroacoustic channels under impulsive interference with the same number of iterations when comparing the algorithm before improvement and the LMP algorithm using other criteria.
5 Conclusion
Under the background of αstable impulsive noise, this paper considers the influence of the error of the current moment and several previous moments on the convergence effect of the algorithm. The study then optimizes the algorithm on the basis of the improved Gaussian function, constructs a variablestep function by using the moving average method, and proposes an improved variablestep LMP adaptive filtering algorithm with robustness to impulse noise. Simulation experiments show that the IVSSLMP algorithm has faster convergence and better system tracking capability than the fixedstep LMP algorithm and existing variablestep algorithms. The proposed IVSSLMP algorithm also achieves faster convergence while guaranteeing low steadystate error through actual hydroacoustic channel identification experiments.
Availability of data and materials
Publicly available dataset were analyzed in this study. This data can be found here: https://www.ffi.no/forskning/prosjekter/watermark.
Abbreviations
 LMS:

Least mean square
 LMP:

Least mean ppower
 VSSLMP:

Variable stepsize least mean ppower
 IVSSLMP:

Improved variable stepsize least mean ppower
 NMSD:

Normalized mean square deviation
 SVSLMP:

Sigmoid variable stepsize least mean ppower
 IHTVSLMP:

Inverse hyperbolic tangent variable stepsize least mean ppower
 NDCSLMP:

Normal distribution curve stepsize least mean ppower
References
B. Widrow, J.M. McCool, M.G. Larimore, C.R. Johnson, Stationary and nonstationary learning characteristics of the LMS adaptive filter. Proc. IEEE 64(8), 1151–1162 (1976). https://doi.org/10.1109/PROC.1976.10286
R.H. Kwong, E.W. Johnston, A variable step size LMS algorithm. IEEE Trans. Signal Process. 40(7), 1633–1642 (1992). https://doi.org/10.1109/78.143435
M.T. Akhtar, M. Abe, M. Kawamata, A new variable step size LMS algorithmbased method for improved online secondary path modeling in active noise control systems. IEEE Trans. Audio Speech Lang. Process. 14(2), 720–726 (2006). https://doi.org/10.1109/TSA.2005.855829
W.W.L. Au, K. Banks, The acoustics of the snapping shrimp Synalpheus parneomeris in Kaneohe Bay. J. Acoust. Soc. Am. 103(1), 41–47 (1998). https://doi.org/10.1121/1.423234
H. Zhao, B. Liu, P. Song, Variable stepsize affine projection maximum correntropy criterion adaptive filter with correntropy induced metric for sparse system identification. IEEE Trans. Circuits Syst. II Express Briefs 67(11), 2782–2786 (2020). https://doi.org/10.1109/TCSII.2020.2973764
M. Shao, C.L. Nikias, Signal processing with fractional lower order moments: stable processes and their applications. Proc. IEEE 81(7), 986–1010 (1993). https://doi.org/10.1109/5.231338
O. Arikan, A. Enis Cetin, E. Erzin, Adaptive filtering for nonGaussian stable processes. IEEE Signal Process. Lett. 1(11), 163–165 (1994). https://doi.org/10.1109/97.335063
B. Wang, H. Li, C. Wu, C. Xu, M. Zhang, Variable stepsize correntropybased affine projection algorithm with compound inverse proportional function for sparse system identification. IEEJ Transactions Elec Engng 17(3), 416–424 (2022). https://doi.org/10.1002/tee.23533
S.B. Gelfand, Y. Wei, J.V. Krogmeier, The stability of variable stepsize LMS algorithms. IEEE Trans. Signal Process. 47(12), 3277–3288 (1999). https://doi.org/10.1109/78.806072
N.J. Bershad, On error saturation nonlinearities for LMS adaptation in impulsive noise. IEEE Trans. Signal Process. 56(9), 4526–4530 (2008). https://doi.org/10.1109/TSP.2008.926103
Z. Yinbing, Z. Junwei, G. Yecai, L. Jinming, A constant modulus algorithm for blind equalization in αstable noise. Appl. Acoust. 71(7), 653–660 (2010). https://doi.org/10.1016/j.apacoust.2010.02.007
X. Zhu, W.P. Zhu, B. Champagne, Spectrum sensing based on fractional lower order moments for cognitive radios in αstable distributed noise. Signal Process 111, 94–105 (2015). https://doi.org/10.1016/j.sigpro.2014.12.022
W. Yang, H. Liu, Y. Li, Y. Zhou, Joint estimation algorithms based on LMS and RLS in the presence of impulsive noise. Xi’an Dianzi Keji Daxue Xuebao 44, 165–170 (2017). https://doi.org/10.3969/j.issn.10012400.2017.02.028
F. Huang, J. Zhang, S. Zhang, A family of robust adaptive filtering algorithms based on sigmoid cost. Signal Process. 149, 179–192 (2018). https://doi.org/10.1016/j.sigpro.2018.03.013
J. Sun, X. Li, K. Chen, W. Cui, M. Chu, A novel CMA+DD_LMS blind equalization algorithm for underwater acoustic communication. Comput. J. 63(6), 974–981 (2020). https://doi.org/10.1093/comjnl/bxaa013
W. Pingbo, M.A. Kai, W.U. Cai, Segmented variablestepsize LMS algorithm based on normal distribution curve. J. Natl. Univ. Def. Technol. 42(5), 16–22 (2020)
P. van Walree, R. Otnes, and T. Jenserud, Watermark: a realistic benchmark for underwater acoustic modems, in 2016 IEEE Third Underwater Communications and Networking Conference (UComms), (2016), pp. 1–4. https://doi.org/10.1109/UComms.2016.7583423.
Acknowledgements
This work was supported in part by the National Natural Science Foundation of China under Grant 52071164 and in part by the Postgraduate Research & Practice Innovation Program of Jiangsu Province under Grant KYCX23_3877.
Funding
This research received no external funding.
Author information
Authors and Affiliations
Contributions
Methodology, BYZ, BGC, PC; software, BYZ, ZDF, PC; formal analysis, BYZ, BGC, BW, YNZ; data curation, BYZ, BW, YNZ; writing—original draft preparation, BYZ, BW; writing—review and editing, BYZ, BW; funding acquisition, BW. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Zhu, B., Wang, B., Cai, B. et al. A variable step size least mean ppower adaptive filtering algorithm based on multimoment error fusion. EURASIP J. Adv. Signal Process. 2023, 77 (2023). https://doi.org/10.1186/s1363402301042x
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s1363402301042x