1. Home
2. Premium
3. IEEE ICASSP 2020 Virtual Conference May 2020
4. Normalized Least-Mean-Square Algorithms With Minimax Concave Penalty

Normalized Least-Mean-Square Algorithms With Minimax Concave Penalty

Collection:

IEEE ICASSP 2020 Virtual Conference May 2020

We propose a novel problem formulation for sparsity-aware adaptive filtering based on the nonconvex minimax concave (MC) penalty, aiming to obtain a sparse solution with small estimation bias. We present two algorithms: the first algorithm uses a single f

• IEEE MemberUS $11.00
• Society MemberUS $0.00
• IEEE Student MemberUS $11.00
• Non-IEEE MemberUS $15.00

Purchase

Videos in this product

Normalized Least-Mean-Square Algorithms With Minimax Concave Penalty

00:14:52

0 views

We propose a novel problem formulation for sparsity-aware adaptive filtering based on the nonconvex minimax concave (MC) penalty, aiming to obtain a sparse solution with small estimation bias. We present two algorithms: the first algorithm uses a single f