Please use this identifier to cite or link to this item: https://dspace.iiti.ac.in/handle/123456789/5392
Title: The diffusion-KLMS algorithm
Authors: Bhatia, Vimal
Keywords: Algorithms;Diffusion LMS;Distributed networks;Faster convergence;Least mean square(LMS);Linearly separable;LMS algorithms;Mercer Kernel;Non linear;Diffusion
Issue Date: 2014
Publisher: Institute of Electrical and Electronics Engineers Inc.
Citation: Mitra, R., & Bhatia, V. (2014). The diffusion-KLMS algorithm. Paper presented at the Proceedings - 2014 13th International Conference on Information Technology, ICIT 2014, 256-259. doi:10.1109/ICIT.2014.33
Abstract: The diffusion least mean squares (LMS) [1] algorithm gives faster convergence than the original LMS in a distributed network. Also, it outperforms other distributed LMS algorithms like spatial LMS and incremental LMS [2]. However, both LMS and diffusion-LMS are not applicable in non-linear environments where data may not be linearly separable [3]. A variant of LMS called kernel-LMS (KLMS) has been proposed in [3] for such non-linearities. We intend to propose the kernelised version of diffusion-LMS in this paper. © 2014 IEEE.
URI: https://doi.org/10.1109/ICIT.2014.33
https://dspace.iiti.ac.in/handle/123456789/5392
ISBN: 9781479980840
Type of Material: Conference Paper
Appears in Collections:Department of Electrical Engineering

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Altmetric Badge: