Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userDistributed Radio Frequency Cooperation at the Wavelength Level Using Wireless Phase Synchronization
53
0
0.0
(
0
)
Added by
Serge Mghabghab
Publication date
2020
fields
Electronic Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Coordinating the operations of separate wireless systems at the wavelength level can lead to significant improvements in wireless capabilities. We address a fundamental challenge in distributed radio frequency system cooperation - inter-node phase alignment - which must be accomplished wirelessly, and is particularly challenging when the nodes are in relative motion. We present a solution to this problem that is based on a novel combined high-accuracy ranging and frequency transfer technique. Using this approach, we present the design of the first fully wireless distributed system operating at the wavelength level. We demonstrate the system in the first open-loop coherent distributed beamforming experiment. Internode range estimation to support phase alignment was performed using a two-tone stepped frequency waveform with a single pulse, while a two-tone waveform was used for frequency synchronization, where the oscillator of a secondary node was disciplined to the primary node. In this concept, secondary nodes are equipped with an adjunct self-mixing circuit that is able to extract the reference frequency from the captured synchronization waveform. The approach was implemented on a two-node dynamic system using Ettus X310 software-defined radios, with coherent beamforming at 1.5 GHz. We demonstrate distributed beamforming with greater than 90% of the maximum possible coherent gain throughout the displacement of the secondary node over one full cycle of the beamforming frequency.
rate research
Read More
We present a method for precisely time-synchronizing the capture of image sequences from a collection of smartphone cameras connected over WiFi. Our method is entirely software-based, has only modest hardware requirements, and achieves an accuracy of less than 250 microseconds on unmodified commodity hardware. It does not use image content and synchronizes cameras prior to capture. The algorithm operates in two stages. In the first stage, we designate one device as the leader and synchronize each client devices clock to it by estimating network delay. Once clocks are synchronized, the second stage initiates continuous image streaming, estimates the relative phase of image timestamps between each client and the leader, and shifts the streams into alignment. We quantitatively validate our results on a multi-camera rig imaging a high-precision LED array and qualitatively demonstrate significant improvements to multi-view stereo depth estimation and stitching of dynamic scenes. We release as open source libsoftwaresync, an Android implementation of our system, to inspire new types of collective capture applications.
We propose a novel formulation for phase synchronization -- the statistical problem of jointly estimating alignment angles from noisy pairwise comparisons -- as a nonconvex optimization problem that enforces consistency among the pairwise comparisons in multiple frequency channels. Inspired by harmonic retrieval in signal processing, we develop a simple yet efficient two-stage algorithm that leverages the multi-frequency information. We demonstrate in theory and practice that the proposed algorithm significantly outperforms state-of-the-art phase synchronization algorithms, at a mild computational costs incurred by using the extra frequency channels. We also extend our algorithmic framework to general synchronization problems over compact Lie groups.
Mobile edge learning is an emerging technique that enables distributed edge devices to collaborate in training shared machine learning models by exploiting their local data samples and communication and computation resources. To deal with the straggler dilemma issue faced in this technique, this paper proposes a new device to device enabled data sharing approach, in which different edge devices share their data samples among each other over communication links, in order to properly adjust their computation loads for increasing the training speed. Under this setup, we optimize the radio resource allocation for both data sharing and distributed training, with the objective of minimizing the total training delay under fixed numbers of local and global iterations. Numerical results show that the proposed data sharing design significantly reduces the training delay, and also enhances the training accuracy when the data samples are non independent and identically distributed among edge devices.
Clock synchronization has become a key design objective in wireless networks for its essential importance in many applications. However, as the wireless link is prone to random network delays due to unreliable channel conditions, it is in general difficult to achieve accurate clock synchronization among wireless nodes. This letter proposes robust clock synchronization algorithms based on low rank matrix approximation, which are able to correct timestamps in the presence of random network delays. We design a low rank approximation based maximum likelihood estimator (MLE) to jointly estimate the clock offset and clock skew under the two-way message exchange mechanism assuming Gaussian delay distribution. By formulating the timestamp correction problem into a low rank approximation problem, we can solve the problem in the singular value decomposition (SVD) domain and also via nuclear norm minimization. Numerical results show that the proposed schemes can correct noisy timestamps and thus achieve more robust synchronization performance than the MLE.
Cooperative transmission can greatly improve communication system performance by taking advantage of the broadcast nature of wireless channels. Most previous work on resource allocation for cooperation transmission is based on centralized control. In this paper, we propose two share auction mechanisms, the SNR auction and the power auction, to distributively coordinate the resource allocation among users. We prove the existence, uniqueness and effectiveness of the auction results. In particular, the SNR auction leads to a fair resource allocation among users, and the power auction achieves a solution that is close to the efficient allocation.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
