Greedy Sparse RLS

Starting from the orthogonal (greedy) least squares method, we build an adaptive algorithm for finding online sparse solutions to linear systems. The algorithm belongs to the exponentially windowed recursive least squares (RLS) family and maintains a partial orthogonal factorization with pivoting of...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on signal processing Jg. 60; H. 5; S. 2194 - 2207
Hauptverfasser:	Dumitrescu, B., Onose, A., Helin, P., Tabus, I.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY IEEE 01.05.2012 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Adaptive algorithms Algorithms Applied sciences Approximation algorithms audio coding channel identification Channels Coding, codes Computation Construction Criteria Detection, estimation, filtering, equalization, prediction Exact sciences and technology Factorization Information theory Information, signal and communications theory Least squares approximation Least squares method Matching pursuit algorithms Mathematical models Miscellaneous orthogonal least squares Signal and communications theory Signal processing Signal processing algorithms Signal, noise sparse filters Studies Telecommunications and information theory Vectors channel identification Time variable channel Lossless circuit Audio signal processing Adaptive algorithm Adaptive algorithms Acoustic signal processing Recursive algorithm Factorization Linear prediction Audio coding Linear system Simulation sparse filters Least squares method On line processing orthogonal least squares Greedy algorithm Recursive method Signal processing Least mean squares methods Information theory
ISSN:	1053-587X, 1941-0476
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!