File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Appears in Collections:
Conference Paper: Fast Least Mean M-Estimate Algorithms for Robust Adaptive Filtering in Impulse Noise
Title | Fast Least Mean M-Estimate Algorithms for Robust Adaptive Filtering in Impulse Noise |
---|---|
Authors | |
Issue Date | 2000 |
Citation | X European Signal Processing Conference, Tampere, Finland, 4-8 September 2000 How to Cite? |
Abstract | Adaptive filters with suitable nonlinear devices are very effective in suppressing the adverse
effect due to impulse noise. In a previous work, the authors have proposed a new class of
nonlinear adaptive filters using the concept of robust statistics [1, 2]. The robust M-estimator is
used as the objective function, instead of the mean square errors, to suppress the impulse noise.
The optimal coefficient vector for such nonlinear filter is governed by a normal equation which
can be solved by a recursive least squares like algorithm with O(N^2) arithmetic complexity,
where N is the length of the adaptive filter. In this paper, we generalize the robust statistic
concept to least mean square (LMS) and transform domain LMS algorithms. The new fast
nonlinear adaptive filtering algorithms called the least mean M-estimate (LMM) and transform
domain LMM (TLMM) algorithms are derived. Simulation results show that they are robust to
impulsive noise in the desired and input signals with an arithmetic complexity of order O(N). |
Persistent Identifier | http://hdl.handle.net/10722/98945 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zou, YX | en_HK |
dc.contributor.author | Chan, SC | en_HK |
dc.contributor.author | Ng, TS | en_HK |
dc.date.accessioned | 2010-09-25T18:09:08Z | - |
dc.date.available | 2010-09-25T18:09:08Z | - |
dc.date.issued | 2000 | en_HK |
dc.identifier.citation | X European Signal Processing Conference, Tampere, Finland, 4-8 September 2000 | - |
dc.identifier.uri | http://hdl.handle.net/10722/98945 | - |
dc.description.abstract | Adaptive filters with suitable nonlinear devices are very effective in suppressing the adverse effect due to impulse noise. In a previous work, the authors have proposed a new class of nonlinear adaptive filters using the concept of robust statistics [1, 2]. The robust M-estimator is used as the objective function, instead of the mean square errors, to suppress the impulse noise. The optimal coefficient vector for such nonlinear filter is governed by a normal equation which can be solved by a recursive least squares like algorithm with O(N^2) arithmetic complexity, where N is the length of the adaptive filter. In this paper, we generalize the robust statistic concept to least mean square (LMS) and transform domain LMS algorithms. The new fast nonlinear adaptive filtering algorithms called the least mean M-estimate (LMM) and transform domain LMM (TLMM) algorithms are derived. Simulation results show that they are robust to impulsive noise in the desired and input signals with an arithmetic complexity of order O(N). | - |
dc.language | eng | en_HK |
dc.relation.ispartof | Eusipco 2000 CD-ROM Proceedings | en_HK |
dc.title | Fast Least Mean M-Estimate Algorithms for Robust Adaptive Filtering in Impulse Noise | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Chan, SC: scchan@eee.hku.hk | en_HK |
dc.identifier.email | Ho, KL: klho@eee.hku.hk | en_HK |
dc.identifier.authority | Chan, SC=rp00094 | en_HK |
dc.identifier.authority | Ho, KL=rp00117 | en_HK |
dc.identifier.hkuros | 50915 | en_HK |