Adaptive Algorithms and Variable Structures for Distributed Estimation (2009)
Abstract / truncated to 115 words
The analysis and design of new non-centralized learning algorithms for potential application in distributed adaptive estimation is the focus of this thesis. Such algorithms should be designed to have low processing requirement and to need minimal communication between the nodes which would form a distributed network. They ought, moreover, to have acceptable performance when the nodal input measurements are coloured and the environment is dynamic. Least mean square (LMS) and recursive least squares (RLS) type incremental distributed adaptive learning algorithms are first introduced on the basis of a Hamiltonian cycle through all of the nodes of a distributed network. These schemes require each node to communicate only with one of its neighbours during the learning ...
adaptive filtering – distributed adaptive estimation – energy conservation relation – affine projection – variable tap-length – fractional tap-length
Information
- Author
- Li, Leilei
- Institution
- Loughborough University
- Supervisor
- Publication Year
- 2009
- Upload Date
- March 26, 2009
The current layout is optimized for mobile phones. Page previews, thumbnails, and full abstracts will remain hidden until the browser window grows in width.
The current layout is optimized for tablet devices. Page previews and some thumbnails will remain hidden until the browser window grows in width.