Abstract
This paper presents a mathematically rigorous analysis of linearly constrained adaptive filtering algorithms based on the adaptive projected subgradient method. We provide the novel concept of constraint-embedding functions that enables to analyze certain classes of linearly constrained adaptive algorithms in a unified manner. Trajectories of the linearly constrained adaptive filters always lie in the affine constraint set, a translation of a closed subspace. Based on this fact, we translate all the points on the constraint set to its underlying subspace . which we regard as a Hilbert space . thereby making the analysis feasible. Derivations of the linearly constrained adaptive filtering algorithms are finally presented in connection with the analysis.
Original language | English |
---|---|
Pages (from-to) | 131-135 |
Number of pages | 5 |
Journal | European Signal Processing Conference |
Publication status | Published - 2011 Dec 1 |
Externally published | Yes |
Event | 19th European Signal Processing Conference, EUSIPCO 2011 - Barcelona, Spain Duration: 2011 Aug 29 → 2011 Sep 2 |
ASJC Scopus subject areas
- Signal Processing
- Electrical and Electronic Engineering