A piloted adaptive notch filter
In the implementation of an adaptive notch filter using the least mean squares (LMS) algorithm, the zero of the filter is steered toward the input sinusoid based on the gradient information. The convergent may be speeded up if a larger step size is used when the zero of the notch filter is far away...
Saved in:
| Published in: | IEEE transactions on signal processing Vol. 53; no. 4; pp. 1310 - 1323 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York, NY
IEEE
01.04.2005
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 1053-587X, 1941-0476 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In the implementation of an adaptive notch filter using the least mean squares (LMS) algorithm, the zero of the filter is steered toward the input sinusoid based on the gradient information. The convergent may be speeded up if a larger step size is used when the zero of the notch filter is far away from the frequency of the input sinusoid. The gradient provides information on the direction where the zero should be steered but does not provide information on the distance between the zero and the frequency of the sinusoid. Conventional variable step-size algorithms determine the step size based on a (linear/nonlinear) weighted average of the gradient estimate at several sampling instances (time domain averaging). In this paper, we propose a new method for extracting information on the distance between the frequency of the input sinusoid and the zero of the notch. We use three (or more) notches, namely, a main notch and two (or more) pilot notches implemented with minimal additional cost. The pilot notches are used to analyze the gradient estimates at the same sampling instance but at several frequency points as the main notch. Simulation results show that our new piloted notch technique is significantly superior to step-size determination based on a time-averaging technique. Novel theoretical analysis is presented. Our method can be used in conjunction with most existing algorithms to determine the step size. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| ISSN: | 1053-587X 1941-0476 |
| DOI: | 10.1109/TSP.2005.843742 |