Normalized Least-Mean-Square Algorithms With Minimax Concave Penalty

This video program is a part of the Premium package:

Normalized Least-Mean-Square Algorithms With Minimax Concave Penalty


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

Normalized Least-Mean-Square Algorithms With Minimax Concave Penalty

0 views
  • Share
Create Account or Sign In to post comments
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
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