Adaptive sparsity tradeoff for ℓ1-constraint NLMS algorithm.
Abdullah Al-ShabiliLuis WeruagaShihab JimaaPublished in: ICASSP (2016)
Keyphrases
- computational complexity
- experimental evaluation
- preprocessing
- matching algorithm
- computational cost
- learning algorithm
- constrained minimization
- detection algorithm
- optimization algorithm
- worst case
- dynamic programming
- np hard
- k means
- objective function
- search space
- cost function
- significant improvement
- simulated annealing
- particle swarm optimization
- gray level
- optimal solution
- clustering method
- kalman filter
- noisy data
- clustering algorithm