Block LMS adaptive filter with deterministic reference inputs for event-related signals
Adaptive estimation of the linear coefficient vector in truncated expansions is considered for the purpose of modeling noisy, recurrent signals. The block LMS (BLMS) algorithm, being the solution of the steepest descent strategy for minimizing the mean square error in a complete signal occurrence, i...
Saved in:
| Published in | 2001 Conference Proceedings of the 23rd Annual International Conference of the IEEE Engineering in Medicine and Biology Society Vol. 2; pp. 1828 - 1831 vol.2 |
|---|---|
| Main Authors | , , |
| Format | Conference Proceeding |
| Language | English |
| Published |
IEEE
2001
|
| Subjects | |
| Online Access | Get full text |
| ISBN | 9780780372115 0780372115 |
| ISSN | 1094-687X |
| DOI | 10.1109/IEMBS.2001.1020577 |
Cover
| Summary: | Adaptive estimation of the linear coefficient vector in truncated expansions is considered for the purpose of modeling noisy, recurrent signals. The block LMS (BLMS) algorithm, being the solution of the steepest descent strategy for minimizing the mean square error in a complete signal occurrence, is shown to be steady-state unbiased and with a lower variance than the LMS algorithm. It is demonstrated that BLMS is equivalent to an exponential averager in the subspace spanned by the truncated set of basis functions. The performance of the BLMS algorithm is studied on an ECG signal and the results show that its performance is superior to that of the LMS algorithm. |
|---|---|
| ISBN: | 9780780372115 0780372115 |
| ISSN: | 1094-687X |
| DOI: | 10.1109/IEMBS.2001.1020577 |