American Journal of Signal Processing

p-ISSN: 2165-9354    e-ISSN: 2165-9362

2015;  5(2A): 9-15

doi:10.5923/s.ajsp.201501.02

An Adaptive Incremental Algorithm for Distributed Filtering of Hypercomplex Processes

Reza G. Rahmati, Azam Khalili, Amir Rastegarnia, Hossein Mohammadi

Department of Electrical Engineering, Malayer University, Malayer, Iran

Correspondence to: Azam Khalili, Department of Electrical Engineering, Malayer University, Malayer, Iran.

Email:

Copyright © 2015 Scientific & Academic Publishing. All Rights Reserved.

Abstract

An adaptive network is a collection of agents (nodes) that collaborate with each other through in-network local processing rules in order to perform distributed information processing tasks. In this paper we propose an adaptive incremental network (algorithm) for distributed adaptive filtering of three- and four-dimensional processes. The proposed algorithm exploits spatiotemporal diversity. Moreover, the proposed algorithm employs both the covariance and pseudocovariance terms within its update and can therefore cater for noncircularly symmetric quaternion data. We show that the distributed widely linear (equivalent to augmented term) model outperforms the distributed standard linear model and non-cooperative case. Simulations in the prediction setting on benchmark 4D and 3D signals show the results.

Keywords: Multidimensional adaptive filters, Widely linear model, Quadrivariate processes, Incremental network

Cite this paper: Reza G. Rahmati, Azam Khalili, Amir Rastegarnia, Hossein Mohammadi, An Adaptive Incremental Algorithm for Distributed Filtering of Hypercomplex Processes, American Journal of Signal Processing, Vol. 5 No. 2A, 2015, pp. 9-15. doi: 10.5923/s.ajsp.201501.02.

1. Introduction

Complex-valued random signals appear in great number of applications such as communications, radar, sonar, geophysics oceanography, optics, and electromagnetic [1]. The complex domain is adequate to process two dimensional signals. A common assumption in complex signal processing is that they are proper or circular. A proper complex random signal is uncorrelated with its complex conjugate, and a circular complex random variable has a probability distribution that is rotationally invariant in the complex plane [2]. Although assumptions are convenient because and simplify many computations, however, there are also many situations where proper and circular signals are very poor models of the underlying physics [3]. To exploit the improper or noncircular nature of complex signals, we need to utilize the complete statistical characterization of complex-valued random signals. For example, to completely extract the second-order information available within the general complex signals we need to consider both the covariance and pseudo-covariance matrices.
To access the information contained in this correlation, we can employ widely linear model that take the full second order statistics into account. Widely linear model suitable for processing of general complex signals, both circular and noncircular, is introduced by Picinbono [4]. The augmented representation, i.e., , is required to fully model the second order statistical information within the complex domain, that is, and respectively the covariance and pseudo-covariance matrices of complex-valued vector x.
Complex-valued adaptive filtering algorithms have been used in a wide range of application. Different complex-valued adaptive filtering algorithms based on the augmented complex statistics have been introduced in the literature [3]. These algorithms are usually termed widely linear or augmented, such as the widely linear LMS (WL-LMS) augmented CLMS (ACLMS) [5,6,7], augmented affine projection (AAPA) [8], widely linear Recursive Least Squares (WL-RLS) algorithms [9], regularized normalized augmented complex LMS (RN-ACLMS) algorithm [10].
To deal with three and four-dimensional processes, Quaternion domain introduces a natural framework for a unified treatment of them. The quaternion algorithms have been developed in the signal processing community, consist of Kalman filtering [11], MUSIC spectrum estimation [12], singular value decomposition for vector sensing [13], and the least-mean-square estimation [14]. The quaternion domain can be significantly used in many multivariate problems based on vector sensors (motion body sensors, seismic, wind modeling). It is therefore natural to extend the so-called augmented complex statistics and widely linear modeling in the complex domain to the quaternion domain. Such widely linear models, include AQLMS [14], widely linear QLMS (WL-QLMS) [15] and WLIQLMS [16].
Distributed information processing tasks appear in many practical applications [17]. There are already several useful strategies for estimation over distributed networks. An example of a distributed method is the consensus strategy [18] in which each node performs a local estimation and fuses its estimate with those of its neighbors so that all nodes converge to the same estimate as the number of iterations increases.
The main problem of mentioned methods is that the framework does not allow the network to undertake a continuous learning and optimization which motivated the development of adaptive networks. An adaptive network is a collection of agents (nodes) that collaborate with each other through in-network local processing rules in order to estimate and track parameters of interest [19]. Two major classes of adaptive networks are incremental strategy [20-22] and diffusion strategy [23-25]. In the incremental mode, nodes passing updates to each other in a Hamiltonian cycle in the network, while in diffusion mode, each node can communicate with a subset of neighboring nodes.
Adaptive networks based on the widely linear models have been considered in some recent works such as [26-30]. In this paper, we propose an incremental based adaptive network for distributed adaptive filtering of three- and four-dimensional processes, such as those observed in atmospheric modeling (wind, vector fields). The proposed algorithm has the advantage that exploits spatiotemporal diversity to improve the filtering performance. Moreover, it accounts for complex nonlinear dynamics and coupling between the dimensions, which are the main problems of mentioned multidimensional processes. The proposed algorithm employs both the covariance and pseudocovariance terms within its update and can therefore cater for noncircularly symmetric quaternion data. We evaluate the performance of the proposed algorithm with some simulation results.
The organization of the paper is as follows: in Section 2 we briefly review the elements of quaternion algebra. In section 3 we derive the proposed algorithm. In section 4 simulations will be presented and finally we conclude our work in section 5.
For convenience, a summary of notations is given in Table 1.
Table 1. Summary of notations
     

2. Quaternion Domain

A quaternion variable consists of a real part (denoted by subscript) and a vector part also known as a pure quaternion, consisting of three imaginary components, and can be expressed as
(1)
the relationships between imaginary numbers, (also known as orthogonal unit vectors) are described as follows
(2)
multiplication for every quaternion, is defined as
where
(3)
due to , the noncommutativity of the quaternion multiplication can be observed. The quaternion conjugate is also defined as
(4)

2.1. Quaternion Involutions and Augmented Basis Vector

In the complex domain , elements of a complex number in can be described using `augmented' basis vector as and . In the quaternion domain , we seek an `augmented' basis vector to relate its components to those of a quaternion valued variable in . For this reason, we define three perpendicular quaternion involutions as
(5)
whose conjugates and are described as
(6)
Now, the elements of a quaternion valued variable can be computed as
(7)
Notice that the quaternion conjugate is also an involution, and is given by
(8)
We can use a combination of to define an augmented quaternion vector. One augmented basis vector is and will be used in this work.

2.2. Second Order Circularity in and -Properness

For a complex-valued variable to be second order circular (or -proper), its probability distribution should be rotation-invariant in complex plane, and therefore have two conditions
(9)
that is, the real and imaginary parts should be uncorrelated and have equal power, which leads to a vanishingpseudo-covariance matrix 1. Second order circularity is established for a quaternion variable when its probability distribution be rotation-invariant with respect to the six pairs of axes: and , where ‘1’ denotes the real axis and denote the corresponding imaginary axes. In other words, the probability distribution of a -proper variable is rotation-invariant with respect to all these six pairs of axes. Despite for a -proper signal, the scalar/real part and the vector/imaginary part have equal power and are uncorrelated, but the pseudo-covariance does not vanish, that is,
(10)

3. I-AQLMS Algorithm

3.1. The Augmented QLMS (AQLMS)

For the Quaternion LMS, where the output , with and denoting respectively the filter input and the adaptive weight vectors, the update of the adaptive weight vector of QLMS can be obtained as [14]
(11)
where the error , with denoting the desired signal. Following the augmented CLMS, augmented CRTRL, and augmented statistics for wind profile [14, 15], we can employ a quaternion-valued widely linear model to cater for both circular and noncircular quaternion processes, given by
(12)
This model contains the information in both covariance and pseudocovariance . Similarly to update for vector , that for vectorin (12) can be obtained as follows
(13)
the non-commutativity of the quaternion products has been taken into account during the derivation of the updates. Finally, (11) and (13) can be expressed into a compact `augmented' form as
(14)
and the weight update of the Augmented QLMS (AQLMS), can be obtained as
(15)
where the augmented input vector and error .

3.2. Derivation of I-AQLMS Algorithm

Consider a network with N distributed nodes over an area, as shown in Figure 3. Each node has access to local measurement and a regressor vector , at time instant n. the flow of data in a sequential manner from one node to the adjacent node by an incremental protocol can be described as follows: assume that denotes the local estimate of optimum weight vector at node at time n, and node has access to local estimate at previous node in the defined cycle. by starting with the initial condition in node 1, and going across the network, then at the end of cycle, the local estimate at node N, , will be considered as for next iteration. This algorithm for AQLMS is summarized in Table 2, where and .
Table 2. Incremental AQLMS algorithm
     
Figure 1. Incremental mode of cooperation structure
Figure 2. Comparison of MSEs of non-cooperative AQLMS and Incremental AQLMS algorithms for prediction of (a) circular 4D AR(4) process with , and (b) noncircular 3D Lorenz signal with
Figure 3. Comparison of MSEs of I-AQLMS and I-QLMS algorithms for prediction of noncircular 3D Lorenz signal with

4. Simulation

The one step ahead prediction performance of proposed algorithms I-AQLMS is compared with its standard linear counterpart (I-QLMS) and non-cooperative case. The network consist of N = 10 nodes, and filter order is set to M = 5. For evaluating the algorithms performance, we employ two signals, one is a three-dimensional nonlinear system known as the Lorenz attractor used originally to model atmospheric turbulence, but also to model lasers, dynamos, and the motion of waterwheel [5]. Mathematically, the Lorenz system can be expressed as a system of coupled differential equations:
(16)
where , and the other signal is generated by a linear AR(4) model as follows
(17)
where denotes the quaternion-valued circular white Gaussian noise. Figure 2 illustrates the evaluation of mean square error (MSE) of proposed algorithm in analogy to non-cooperative case for one step ahead prediction of the mentioned signals. Observe that as expected the proposed cooperative algorithm outperforms the non-cooperative case. Figure 3 shows the evaluation of MSE for one step ahead prediction of the noncircular Lorenz signal for comparing the proposed algorithm with its standard linear counterpart. It is worth noting that due to non-circular nature of the Lorenz signal, the widely linear distributed algorithm has better performance than standard linear distributed one.

5. Conclusions

We have proposed an Incremental Augmented QLMS (I-AQLMS) algorithm for processing of both circular and noncircular quaternion-valued signals collaboratively. The advantage of the widely linear incremental algorithm over standard linear incremental and noncooperative case in terms of convergence speed and steady state performance has been shown in simulations on synthetic signals.

Note

1. For a -proper signal, the pseudo-covariance vanishes, that is, , this is because for a -proper signal, the real part and the imaginary part have the same power and are uncorrelated.

References

[1]  T. Adali, P. J. Schreier, and L. L. Scharf, Complex-valued signal processing: The proper way to deal with impropriety, IEEE Trans. Signal Processing, 59(11), 5101-5123, 2011.
[2]  T. Adali, and P. J. Schreier, Optimization and Estimation of Complex-Valued Signals: Theory and applications in filtering and blind source separation. IEEE Signal Process. Mag. 31(5), 112-128, 2014.
[3]  D. Mandic and S. L. Goh, Complex Valued Nonlinear Adaptive Filters: Noncircularity, Widely Linear and Neural Models. Wiley Publishing, 2009.
[4]  B. Picinbono and P. Chevalier, Widely linear estimation with complex data,” IEEE Trans. Signal Process., 43(8), 2030–2033, 1995.
[5]  S. Javidi SLGMP, Mandic DP. The augmented complex least mean square algorithm with application to adaptive prediction problems. 1st IARP Workshop Cogn. Inform. Process., 2008.
[6]  A. Khalili, A. Rastegarnia, S. Sanei, Quantized Augmented Complex Least-mean Square Algorithm: Derivation and Performance Analysis, submitted to Signal Processing, in revision.
[7]  A. Khalili, A. Rastegarnia, Tracking analysis of augmented complex least mean square algorithm, International Journal of Adaptive Control and Signal Processing, to appear, doi: 10.1002/acs.2594.
[8]  Y. Xia, CC Took, D Mandic, An augmented affine projection algorithm for the filtering of noncircular complex signals. Signal Processing 90(6), 1788 – 1799, 2010.
[9]  Douglas S. Widely-linear recursive least-squares algorithm for adaptive beamforming. Acoustics, Speech and Signal Processing, IEEE International Conference on, 2041–2044, 2009.
[10]  Y. Xia, S. Javidi, D Mandic. A regularised normalised augmented complex least mean square algorithm. Wireless Communication Systems (ISWCS), 2010 7th International Symposium on, 2010; 355–359.
[11]  D. Choukroun, I. Bar-Itzhack, Y. Oshman, Novel quaternion kalman filter, IEEE Transactions on Aerospace and Electronic Systems, 42 (2006) 174-190.
[12]  S. Miron, N. Le Bihan, J. Mars, Quaternion-music for vector- sensor array processing, IEEE Transactions on Signal Processing, 54 (2006) 1218-1229.
[13]  N. Le Bihan, J. Mars, Singular value decomposition of quaternion matrices: a new tool for vector-sensor signal processing, Signal Processing, 84 (2004) 1177-1199.
[14]  C. Took, D. Mandic, The quaternion LMS algorithm for adaptive filtering of hypercomplex processes, IEEE Transactions on Signal Processing, 57 (2009) 1316-1327.
[15]  C. Took, D. Mandic, A quaternion widely linear adaptive filter, IEEE Transactions on Signal Processing, 58 (2010) 4427-4431.
[16]  C. Took, C. Jahanchahi, D. Mandic, A unifying framework for the analysis of quaternion valued adaptive _lters, in: Signals, Systems and Computers (ASILOMAR), 2011 Conference Record of the Forty Fifth Asilomar Conference on, pp. 1771-1774.
[17]  D. Estrin and L. Girod, Instrumenting the world with wireless sensor networks, Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP’01), 2001.
[18]  I.D. Schizas, G. Mateos, and G.B. Giannakis, Distributed LMS for consensus-based in-network adaptive processing, Signal Processing, IEEE Transactions on, vol. 57, no. 6, pp. 2365–2382, 2009.
[19]  A. H. Sayed, S.-Y. Tu, J. Chen, X. Zhao, and Z. Towfic, “Diffusion strategies for adaptation and learning over networks,” IEEE Signal Processing Magazine, vol. 30, no. 3, pp. 155–171, May 2013.
[20]  C. G. Lopes and A. H. Sayed, “Incremental adaptive strategies over distributed networks,” IEEE Trans. Signal Processing, vol. 55, no. 8, pp. 4064–4077, August 2007.
[21]  A. Rastegarnia, M. A. Tinati, and A. Khalili, Performance analysis of quantized incremental LMS algorithm for distributed adaptive estimation, Signal Processing, vol. 90, no. 8, pp. 2621 – 2627, 2010.
[22]  M.A. Tinati, a. Rastegarnia, and a. Khalili, “An incremental least-mean square algorithm with adaptive combiner,” IET 3rd International Conference on Wireless, Mobile and Multimedia Networks (ICWMMN 2010), pp. 266–269, 2010.
[23]  C. G. Lopes and A. H. Sayed, “Diffusion least-mean squares over adaptive networks: Formulation and performance analysis,” IEEE Trans. on Signal Process., vol. 56, no. 7, pp. 3122–3136, July 2008.
[24]  F. S. Cattivelli, C. G. Lopes, and A. H. Sayed, “Diffusion recursive least-squares for distributed estimation over adaptive networks,” IEEE Trans. on Signal Process., vol. 56, no. 5, pp. 1865–1877, May 2008.
[25]  P. Di Lorenzo and S. Barbarossa, Distributed least mean squares strategies for sparsity-aware estimation over Gaussian markov random fields, in Acoustics, Speech and Signal Processing (ICASSP), 2014 IEEE International Conference on, May 2014, pp. 5472–5476.
[26]  A. Khalili, A. Rastegarnia, and W. Bazzi, “A collaborative adaptive algorithm for the filtering of noncircular complex signals,” in Telecommunications (IST), 2014 7th International Symposium on, Sept 2014, pp. 96–99.
[27]  A. Khalili, A. Rastegarnia, W. M. Bazzi, and Z. Yang, “Derivation and analysis of incremental augmented complex lms algorithm,” IET Signal Processing, 9 (4), 312-319.
[28]  A Khalili, A Rastegarnia, WM Bazzi, Incremental augmented affine projection algorithm for collaborative processing of complex signals, 2015 International Conference on Information and Communication Technology Research (ICTRC), 60-63, 2015.
[29]  Azam Khalili, Wael Bazzi, Amir Rastegarnia, Analysis of incremental augmented affine projection algorithm for distributed estimation of complex signals, available at http://arxiv.org/abs/1410.4477.
[30]  Y. Xia, D. Mandic, and A. Sayed, “An adaptive diffusion augmented CLMS algorithm for distributed filtering of noncircular complex signals,” Signal Processing Letters, IEEE, vol. 18, no. 11, pp. 659–662, Nov 2011.