Distributed signal subspace estimation based on local generalized eigenvector matrix inversion

  • Hassani A
  • Bertrand A
  • Moonen M
  • 7


    Mendeley users who have this article in their library.
  • 4


    Citations of this article.


Many array-processing algorithms or applications require the estimation of a target signal subspace, e.g., for source local- ization or for signal enhancement. In wireless sensor net- works, the straightforward estimation of a network-wide sig- nal subspace would require a centralization of all the sensor signals to compute network-wide covariance matrices. In this paper, we present a distributed algorithm for network-wide signal subspace estimation in which such data centralization is avoided. The algorithm relies on a generalized eigenvalue decomposition (GEVD), which allows to estimate a target sig- nal subspace in spatially correlated noise. We show that the network-wide signal subspace can be found from the inver- sion of the matrices containing the generalized eigenvectors of a pair of reduced-dimension sensor signal covariance ma- trices at each node. The resulting distributed algorithm re- duces the per-node communication and computational cost, while converging to the centralized solution. Numerical sim- ulations reveal a faster convergence speed compared to a pre- viously proposed algorithm.

Author-supplied keywords

  • Wireless sensor network (WSN)
  • distributed estimation
  • generalized eigenvalue decomposition (GEVD)
  • signal subspace estimation

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free