File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

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

TitleReply to "Comments on 'A recursive least M-estimate algorithm for robust adaptive filtering in impulsive noise: Fast algorithm and convergence performance analysis'"
Authors
Issue Date2009
Citation
Ieee Transactions On Signal Processing, 2009, v. 57 n. 1, p. 389 How to Cite?
AbstractWe 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. © 2008 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/155504
ISSN
2015 Impact Factor: 2.624
2015 SCImago Journal Rankings: 2.004
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorChan, SCen_US
dc.contributor.authorZou, YXen_US
dc.contributor.authorZhou, Yen_US
dc.date.accessioned2012-08-08T08:33:49Z-
dc.date.available2012-08-08T08:33:49Z-
dc.date.issued2009en_US
dc.identifier.citationIeee Transactions On Signal Processing, 2009, v. 57 n. 1, p. 389en_US
dc.identifier.issn1053-587Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/155504-
dc.description.abstractWe 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. © 2008 IEEE.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Transactions on Signal Processingen_US
dc.titleReply to "Comments on 'A recursive least M-estimate algorithm for robust adaptive filtering in impulsive noise: Fast algorithm and convergence performance analysis'"en_US
dc.typeArticleen_US
dc.identifier.emailChan, SC:scchan@eee.hku.hken_US
dc.identifier.authorityChan, SC=rp00094en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/TSP.2008.2007921en_US
dc.identifier.scopuseid_2-s2.0-58649091995en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-58649091995&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume57en_US
dc.identifier.issue1en_US
dc.identifier.spage389en_US
dc.identifier.isiWOS:000262557500035-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChan, SC=13310287100en_US
dc.identifier.scopusauthoridZou, YX=7402166847en_US
dc.identifier.scopusauthoridZhou, Y=55209660000en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats