抄録
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.
| 本文言語 | English |
|---|---|
| ページ(範囲) | 131-135 |
| ページ数 | 5 |
| ジャーナル | European Signal Processing Conference |
| 出版ステータス | Published - 2011 12月 1 |
| 外部発表 | はい |
| イベント | 19th European Signal Processing Conference, EUSIPCO 2011 - Barcelona, Spain 継続期間: 2011 8月 29 → 2011 9月 2 |
ASJC Scopus subject areas
- 信号処理
- 電子工学および電気工学
フィンガープリント
「A deterministic analysis of linearly constrained adaptive filtering algorithms」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。引用スタイル
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS