TY - GEN
T1 - Thresholding-based online algorithms of complexity comparable to sparse LMS methods
AU - Kopsinis, Yannis
AU - Slavakis, Konstantinos
AU - Theodoridis, Sergios
AU - McLaughlin, Stephen
PY - 2013
Y1 - 2013
N2 - This paper deals with a novel class of set-theoretic adaptive sparsity promoting algorithms of linear computational complexity. Sparsity is induced via generalized thersholding operators, which correspond to nonconvex penalties such as those used in a number of sparse LMS based schemes. The results demonstrate the significant performance gain of our approach, at comparable computational cost.
AB - This paper deals with a novel class of set-theoretic adaptive sparsity promoting algorithms of linear computational complexity. Sparsity is induced via generalized thersholding operators, which correspond to nonconvex penalties such as those used in a number of sparse LMS based schemes. The results demonstrate the significant performance gain of our approach, at comparable computational cost.
UR - http://www.scopus.com/inward/record.url?scp=84883368131&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84883368131&partnerID=8YFLogxK
U2 - 10.1109/ISCAS.2013.6571893
DO - 10.1109/ISCAS.2013.6571893
M3 - Conference contribution
AN - SCOPUS:84883368131
SN - 9781467357609
T3 - Proceedings - IEEE International Symposium on Circuits and Systems
SP - 513
EP - 516
BT - 2013 IEEE International Symposium on Circuits and Systems, ISCAS 2013
T2 - 2013 IEEE International Symposium on Circuits and Systems, ISCAS 2013
Y2 - 19 May 2013 through 23 May 2013
ER -