Convergence of a Class of Decentralized Beamforming Algorithms

  • Authors:
  • James A. Bucklew;William A. Sethares

  • Affiliations:
  • Department of Electrical and Computer Engineering, University of Wisconsin-Madison;Department of Electrical and Computer Engineering, University of Wisconsin-Madison

  • Venue:
  • SSP '07 Proceedings of the 2007 IEEE/SP 14th Workshop on Statistical Signal Processing
  • Year:
  • 2007

Quantified Score

Hi-index 0.07

Visualization

Abstract

One of the key issues in decentralized beamforming is the need to phase-align the carriers of all the sensors in the network. Recent work in this area has shown the viability of certain methods that incorporate single-bit feedback from a beacon. This paper analyzes the behavior of the method (showing conditions for convergence in distribution and also giving a concrete way to calculate the final distribution of the convergent ball) and then generalizes the method in three ways. First, by incorporating both negative and positive feedback it is possible to double the convergence rate of the algorithm without adversely effecting the final variance. Second, a way of reducing the amount of energy required (by reducing the number of transmissions needed for convergence) is shown; its convergence and final variance can also be conveniently described. Finally, a wideband analog is proposed that operates in a decentralized manner to align the time delay (rather than the phase) between sensors.