Fast communication: Performance analysis of quantized incremental LMS algorithm for distributed adaptive estimation

Authors:
Amir Rastegarnia;Mohammad Ali Tinati;Azam Khalili
Affiliations:
Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz 51664, Iran;Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz 51664, Iran;Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz 51664, Iran
Venue:
Signal Processing
Year:
2010

Citing 5
Cited 0

Introduction to signal processing

Introduction to signal processing
Diffusion Least-Mean Squares Over Adaptive Networks: Formulation and Performance Analysis

IEEE Transactions on Signal Processing - Part II
Incremental Adaptive Strategies Over Distributed Networks

IEEE Transactions on Signal Processing
A nonlinear analytical model for the quantized LMS algorithm-thepower-of-two step size case

IEEE Transactions on Signal Processing
Diffusion Recursive Least-Squares for Distributed Estimation Over Adaptive Networks

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.08

Visualization

Abstract

Recently distributed adaptive estimation algorithms have been proposed as a solution to the issue of linear estimation over distributed networks. In all previous works, the performance of such algorithms is considered only for infinite-precision arithmetic implementation. In this paper we study the performance of distributed incremental least mean square (DILMS) estimation algorithm when it is implemented in finite-precision arithmetic. To this aim, we first derive the quantized version of the DILMS algorithm. Then a spatial-temporal energy conservation argument is used to derive theoretical expressions that evaluate the steady-state performance of individual nodes in the network. Simulation results show that there is a good match between the theory and simulation.