DSpace@nitr >
National Institue of Technology- Rourkela >
Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/1684

Title: Efficient adaptive strategies over distributed Networks
Authors: Jyothi, K
Sahoo, A K
Keywords: Distributed strategies
Incremental partial update
sequential partial update
stochastic partial update
Maxpartial update
computational complexity
Issue Date: Mar-2012
Citation: ICCEETS-2012 International Conference on Computing, Electronics and Electrical Technologies, Noorul Islam Centre for Higher Education, Kumaracoil, 21st- 22nd, March 2012
Abstract: In this paper, we review some of the computationally efficient adaptive distributed strategies developed using incremental partial update techniques. The schemes mentioned here solve the problem of linear estimation with less number of computations in a cooperative fashion. In a distributed network each node contains local computing equipment which estimates and shares them with other nodes. The resulting algorithms are less complex in computations and in communication because of Incremental partial update algorithms and each node communicate with immediate node only. Computational complexity analysis is evaluated and performance characteristics of each algorithm are given with computer simulations. Simulation results show that with a small degradation in performance, considerable amount of computational complexity is reduced.
Description: Copyright belongs to proceeding publisher
URI: http://hdl.handle.net/2080/1684
Appears in Collections:Conference Papers

Files in This Item:

File Description SizeFormat
conf_final.pdf202KbAdobe PDFView/Open

Show full item record

All items in DSpace are protected by copyright, with all rights reserved.

 

Powered by DSpace Feedback