Fast Sparse Subspace Tracking Algorithm based on Shear and Givens Rotations - Archive ouverte HAL
Communication Dans Un Congrès Année : 2019

Fast Sparse Subspace Tracking Algorithm based on Shear and Givens Rotations

Résumé

In this paper, we consider the problem of tracking the signal subspace under a sparsity constraint on the weight basis matrix. In the same spirit of our previous work, we propose a new low cost algorithm based on a two stages approach. First, an orthogonal basis of the signal subspace is estimated adaptively. Then, a sparsity criterion is minimized using the Shear and Givens rotations. Compared to [3], we propose to use Taylor expansion and Newton descent method to accelerate the optimization. The proposed algorithm has approximately the same estimation and tracking performance as compared to our previous propositions [2], [3] but with the advantage of a lower computational cost.
Fichier non déposé

Dates et versions

hal-02276912 , version 1 (03-09-2019)

Identifiants

Citer

Nacerredine Lassami, Abdeldjalil Aissa El Bey, Karim Abed-Meraim. Fast Sparse Subspace Tracking Algorithm based on Shear and Givens Rotations. 2019 53rd Asilomar Conference on Signals, Systems, and Computers, Nov 2019, Pacific Grove, United States. ⟨10.1109/IEEECONF44664.2019.9048883⟩. ⟨hal-02276912⟩
70 Consultations
0 Téléchargements

Altmetric

Partager

More