[Back]


Talks and Poster Presentations (with Proceedings-Entry):

C. Reyes, R. Dallinger, M. Rupp:
"Convergence Analysis of Distributed PAST Based on Consensus Propagation";
Talk: Asilomar Conference on Signals, Systems, and Computers, Pacific Grove (CA), USA (invited); 11-04-2012 - 11-07-2012; in: "Forty-Sixth Asilomar Conference on Signals, Systems, and Computers", (2012), ISBN: 978-1-4673-5050-1; 271 - 275.



English abstract:
In previous work, we have analyzed the convergence properties of the so-called Projection Approximation Subspace Tracking algorithm (PAST) by means of Singular Value Decom- position methods. Based on this, we extend our analysis and study the global convergence properties of two distributed variants of the PAST algorithm based on average consensus. We provide an insight regarding convergence in the mean, and establish step- size bounds that guarantee the stability of the algorithm. Finally, we investigate the algorithms behavior at several step-sizes by means of simulation experiments.

Keywords:
PAST algorithm, distributed subspace tracking, blind source separation, average consensus, step-size bounds


Electronic version of the publication:
http://publik.tuwien.ac.at/files/PubDat_211865.pdf


Created from the Publication Database of the Vienna University of Technology.