Name
Abstract | ||
|---|---|---|
Recently, a Sparsity-aware Set-Membership Affine Projection (SSM-AP) algorithm has been developed, which presents lower Mean-Squared Error (MSE), lower misalignment, and lower computational complexity, as compared to other sparsity-aware algorithms under the same conditions. The SSM-AP updating rule is governed by a vector parameter, called the Constraint Vector (CV). Currently, there are two main choices for the CV: one leads to faster convergence, whereas the other yields lower MSE and complexity. This paper proposes an alternative to those choices, which can improve both convergence speed and steady-state MSE of the SSM-AP algorithm with a given CV, while also decreasing the overall number of updates. |
Year | Venue | Keywords |
|---|---|---|
2015 | 2015 IEEE INTERNATIONAL CONFERENCE ON DIGITAL SIGNAL PROCESSING (DSP) | adaptive filtering, sparsity, set-membership, set-membership affine projection |
Field | DocType | Citations |
Convergence (routing),Mathematical optimization,Computer science,Affine projection,Adaptive filter,Affine projection algorithm,Computational complexity theory | Conference | 0 |
PageRank | References | Authors |
0.34 | 9 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tadeu N. Ferreira | 1 | 48 | 7.41 |
| Markus V. S. Lima | 2 | 57 | 11.75 |
| Wallace Alves Martins | 3 | 122 | 14.99 |
| Paulo S. R. Diniz | 4 | 247 | 38.72 |