Adaptive algorithms for sparse system identification
From MaRDI portal
Publication:553728
DOI10.1016/j.sigpro.2011.02.013zbMath1217.93162OpenAlexW2089770920MaRDI QIDQ553728
Gerasimos Mileounis, Nicholas Kalouptsidis, Behtash Babadi, Vahid Tarokh
Publication date: 27 July 2011
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sigpro.2011.02.013
Related Items
Subband adaptive filtering with \(l_1\)-norm constraint for sparse system identification, Sparse system identification for stochastic systems with general observation sequences, How entropic regression beats the outliers problem in nonlinear system identification, Sparse System Identification in Pairs of Pulse and Takenaka--Malmquist Bases, Sparse parameter identification of stochastic dynamical systems, A new subband adaptive filtering algorithm for sparse system identification with impulsive noise
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Efficient algorithms for Volterra system identification
- Numerically stable fast transversal filters for recursive least squares adaptive filtering
- An EM algorithm for wavelet-based image restoration
- Just relax: convex programming methods for identifying sparse signals in noise
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- A fast sequential algorithm for least-squares filtering and prediction
- Atomic Decomposition by Basis Pursuit
- Methods for Sparse Signal Recovery Using Kalman Filtering With Embedded Pseudo-Measurement Norms and Quasi-Norms
- Asymptotic Achievability of the CramÉr–Rao Bound for Noisy Compressive Sampling
- Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
- Convex Analysis
- Adaptive filtering
