Fast communication: A new incremental affine projection-based adaptive algorithm for distributed networks

Authors:
Leilei Li;Jonathon A. Chambers
Affiliations:
Advanced Signal Processing Group, Department of Electronic and Electrical Engineering, Loughborough University, Loughborough, Leicestershire LE11 3TU, UK;Advanced Signal Processing Group, Department of Electronic and Electrical Engineering, Loughborough University, Loughborough, Leicestershire LE11 3TU, UK
Venue:
Signal Processing
Year:
2008

Citing 3
Cited 3

Distributed estimation over an adaptive incremental network based on the affine projection algorithm

IEEE Transactions on Signal Processing
Incremental Adaptive Strategies Over Distributed Networks

IEEE Transactions on Signal Processing
Quantized incremental algorithms for distributed optimization

IEEE Journal on Selected Areas in Communications

Fast communication: Power scheduling of distributed estimation in sensor networks with repetition coding

Signal Processing
Distributed estimation over an adaptive incremental network based on the affine projection algorithm

IEEE Transactions on Signal Processing
Unbiased consensus in wireless networks via collisional random broadcast and its application on distributed optimization

Signal Processing

Quantified Score

Hi-index	0.08

Visualization

Abstract

A new incremental adaptive learning scheme based on the affine projection algorithm (APA), which is developed from Newton's method, is formulated for distributed networks to ameliorate the limited convergence properties of least-mean-square (LMS) type distributed adaptive filters with colored inputs. The simulation results verify that the proposed algorithm provides not only a faster convergence rate but also an improved steady-state performance as compared to an LMS-based scheme. In addition, the new approach attains an acceptable misadjustment performance at the steady-state stage with lower computational cost, provided the number of regressor vectors and filter length parameters are appropriately chosen, and memory cost than a recursive-least-squares (RLS)-based method.