Low computational complexity family of affine projection algorithms over adaptive distributed incremental networks

This paper presents the problem of distributed estimation in an incremental network based on the family of affine projection (AP) adaptive algorithms. The distributed selective partial update normalized least mean squares (dSPU-NLMS), the distributed SPU-AP algorithm (dSPU-APA), the distributed selective regressor APA (dSR-APA), the distributed dynamic selection of APA (dDS-APA), dSPU-SR-APA and dSPU-DS-APA are introduced in a unified way. These algorithms have low computational complexity feature and close convergence speed to ordinary distributed adaptive algorithms. In dSPU-NLMS and dSPU-APA, the weight coefficients are partially updated at each node during the adaptation. In dSR-APA, the optimum number of input regressors is selected during the weight coefficients update. The dynamic selection of input regressors is used in dDS-APA. dSPU-SR-APA and dSPU-DS-APA combine SPU with SR and DS approaches. In these algorithms, the weight coefficients are partially updated and the input regressors are optimally/dynamically selected at every iteration for each node. In addition, a unified approach for mean-square performance analysis of each individual node is presented. This approach can be used to establish a performance analysis of classical distributed adaptive algorithms as well. The theoretical expressions for stability bounds, transient, and steady-state performance analysis of various distributed APAs are introduced. The validity of the theoretical results and the good performance of dAPAs are demonstrated by several computer simulations. (C) 2013 Elsevier GmbH. All rights reserved.