paper-with-me

홈 › Papers

A Message Passing Based Average Consensus Algorithm for Decentralized Frequency and Phase Synchronization in Distributed Phased Arrays

2022-04-07 · Mohammed Rashid, Jeffrey A. Nanzer

We consider the problem of decentralized frequency and phase synchronization in distributed phased arrays via local broadcast of the node electrical states. Frequency and phase synchronization between nodes in a distributed array is necessary to support beamforming, but due to the operational dynamics of the local oscillators of the nodes, the frequencies and phases of their output signals undergo the random drift and jitter in between the update intervals. Furthermore, frequency and phase estimation errors contribute to the total phase errors, leading to a residual phase error in the array that degrades coherent operation. Recently, a classical decentralized frequency and phase synchronization algorithm based on consensus averaging was proposed with which the standard deviation of the residual phase errors upon convergence was reduced to $10^{-4}$ degrees for internode update intervals of $0.1$ ms, however this was obtained for arrays with at least $400$ nodes and a high connectivity ratio of $0.9$. In this paper, we propose a message passing based average consensus (MPAC) algorithm to improve the synchronization of the electrical states of the nodes in distributed arrays. Simulation results show that the proposed MPAC algorithm significantly reduces the residual phase errors to about $10^{-11}$ degrees, requiring only $20$ moderately connected nodes in an array. Furthermore, MPAC converges faster than the DFPC-based algorithms, particularly for the larger arrays with a moderate connectivity.

📄 PDF Abstract BibTeX arXiv:2204.03691

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Scalable Average Consensus with Compressed Communications

2021-09-14 · Mohammad Taha Toghani, César A. Uribe

We propose a new decentralized average consensus algorithm with compressed communication that scales linearly with the network size n. We prove that the proposed method converges to the average of the initial values held…

On Arbitrary Compression for Decentralized Consensus and Stochastic Optimization over Directed Networks

2022-04-18 · Mohammad Taha Toghani, César A. Uribe

We study the decentralized consensus and stochastic optimization problems with compressed communications over static directed graphs. We propose an iterative gradient-based algorithm that compresses messages according to…

Stochastic Optimization

Consensus Message Passing for Layered Graphical Models

2014-10-27 · Varun Jampani, S. M. Ali Eslami, Daniel Tarlow, Pushmeet Kohli 외

Generative models provide a powerful framework for probabilistic reasoning. However, in many domains their use has been hampered by the practical difficulties of inference. This is particularly the case in computer visio…

Decentralized Cooperative Stochastic Bandits

2018-10-10 · NeurIPS 2019 12 · David Martínez-Rubio, Varun Kanade, Patrick Rebeschini

We study a decentralized cooperative stochastic multi-armed bandit problem with $K$ arms on a network of $N$ agents. In our model, the reward distribution of each arm is the same for each agent and rewards are drawn inde…

Multi-Armed Bandits

Consensus-based Distributed Variational Multi-object Tracker in Multi-Sensor Network

2023-09-02 · Qing Li, Runze Gan, Simon Godsill

The growing need for accurate and reliable tracking systems has driven significant progress in sensor fusion and object tracking techniques. In this paper, we design two variational Bayesian trackers that effectively tra…

Object TrackingSensor Fusion