Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/2286
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSowjanya, M-
dc.contributor.authorsahoo, A K-
dc.contributor.authorKumar, S-
dc.date.accessioned2015-04-09T13:07:35Z-
dc.date.available2015-04-09T13:07:35Z-
dc.date.issued2015-04-
dc.identifier.citationICCSP 2015, Melmaruvathur, Chennai, 2-4 April 2015en_US
dc.identifier.urihttp://hdl.handle.net/2080/2286-
dc.descriptionCopyright belongs to the Proceeding of Publisheren_US
dc.description.abstractAdaptive algorithms are applied to distributed networks to endow the network with adaptation capabilities. Incremental Strategy is the simplest mode of cooperation as it needs less amount of communication between the nodes. The adaptive incremental strategy which is developed for distributed networks using LMS algorithm, suffers from drift problem, where the parameter estimate will go unbounded in non ideal or practical implementations. Drift problem or divergence of the parameter estimate occurs due to continuous accumulation of quantization errors, finite precision errors and insufficient spectral excitation or ill conditioning of input sequence. They result in overflow and near singular auto correlation matrix, which provokes slow escape of parameter estimate to go unbound. The proposed method uses the Leaky LMS algorithm, which introduces a leakage factor in the update equation, and so prevents the weights to go unbounded by leaking energy out.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.subjectDistributed processingen_US
dc.subjectFinite precision effectsen_US
dc.subjectIncremental Leaky LMSen_US
dc.subjectNumerical Stabilityen_US
dc.subjectParameter Driften_US
dc.titleDistributed Incremental Leaky LMSen_US
dc.typeArticleen_US
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
6a.pdf620.82 kBAdobe PDFView/Open


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