Reply to "Comments on 'A recursive least M-estimate algorithm for robust adaptive filtering in impulsive noise: fast algorithm and convergence performance analysis'"

Authors:
S. C. Chan;Y. X. Zou;Y. Zhou
Affiliations:
; ;
Venue:
IEEE Transactions on Signal Processing
Year:
2009

Citing 2
Cited 0

Comments on "A recursive least M-estimate algorithm for robust adaptive filtering in impulsive noise: fast algorithm and convergence performance analysis"

IEEE Transactions on Signal Processing
A recursive least M-estimate algorithm for robust adaptive filtering in impulsive noise: fast algorithm and convergence performance analysis

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	35.68

Visualization

Abstract

We appreciate the comments by Bershad ["Comments on 'A Recursive Least M-Estimate Algorithm for Robust Adaptive Filtering in Impulsive Noise: Fast Algorithm and Convergence Performance Analysis," IEEE TRANSACTIONS ON SIGNAL PROCESSING, vol. 57, no. 1, January 2009] on an assumption of our paper ["A Recursive Least M-Estimate Algorithm for Robust Adaptive Filtering in Impulsive Noise: Fast Algorithm and Convergence Performance Analysis," IEEE TRANSACTIONS ON SIGNAL PROCESSING, Vol. 52, no. 4, April 2004]. In this reply, we elaborate further on this assumption, which was originally introduced as an approximation to simplify the performance analysis. Modifications and references to a related extension of Price's theorem for independent mixtures are outlined. We wish this will clarify the issues raised.