It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
For the channel estimation problem under α-stable distributed impulse interference, the traditional fixed-step adaptive filtering cannot satisfy the fast convergence speed and low steady-state error at the same time, whereas the variable-step method is able to effectively solve this contradiction. This paper proposes an improved variable step-size least mean p-power 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 anti-noise performance and large steady-state fluctuations of the fixed-step 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 steady-state error. The simulation results show that the algorithm has better convergence than the traditional fixed step-size algorithm and the existing variable step-size algorithm under the interference of impulsive noise.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer