On bounds and algorithms for frequency synchronization for collaborative communication systems

Cooperative diversity systems are wireless communication systems designed to exploit cooperation among users to mitigate the effects of multipath fading. In fairly general conditions, it has been shown that these systems can achieve the diversity order of an equivalent MISO channel and, if the node geometry permits, virtually the same outage probability can be achieved as that of the equivalent MISO channel for a wide range of applicable SNR. However, much of the prior analysis has been performed under the assumption of perfect timing and frequency offset synchronization. In this paper, we derive the estimation bounds and associated maximum likelihood estimators for frequency offset estimation in a cooperative communication system. We show the benefit of adaptively tuning the frequency of the relay node in order to reduce estimation error at the destination. We also derive an efficient estimation algorithm, based on the correlation sequence of the data, which has mean squared error close to the Cramer-Rao Bound.Comment: Submitted to IEEE Transaction on Signal Processin

Bayesian CFO estimation in OFDM systems

This paper addresses the problem of carrier frequency offset (CFO) estimation in orthogonal frequency division multiplexing (OFDM) systems using Bayesian method. Depending on the availability of the noise variance, two general CFO estimators are derived. Furthermore, the two general maximum a posteriori (MAP) estimators are developed into several special cases based on different degrees of prior information on parameters. The relationships between the proposed estimators and existing estimators are comprehensively investigated. Finally, numerical results demonstrate the effects of employing different prior information on the estimation performances. © 2009 IEEE.published_or_final_versionThe IEEE Conference on Wireless Communications and Networking (WCNC 2009), Budapest, Hungary, 5-8 April 2009. In Proceedings of IEEE WCNC, 2009, p. 1-

Distributed synchronization algorithms for wireless sensor networks

The ability to distribute time and frequency among a large population of interacting agents is of interest for diverse disciplines, inasmuch as it enables to carry out complex cooperative tasks. In a wireless sensor network (WSN), time/frequency synchronization allows the implementation of distributed signal processing and coding techniques, and the realization of coordinated access to the shared wireless medium. Large multi-hop WSN\u27s constitute a new regime for network synchronization, as they call for the development of scalable, fully distributed synchronization algorithms. While most of previous research focused on synchronization at the application layer, this thesis considers synchronization at the lowest layers of the communication protocol stack of a WSN, namely the physical and the medium access control (MAC) layer. At the physical layer, the focus is on the compensation of carrier frequency offsets (CFO), while time synchronization is studied for application at the MAC layer. In both cases, the problem of realizing network-wide synchronization is approached by employing distributed clock control algorithms based on the classical concept of coupled phase and frequency locked loops (PLL and FLL). The analysis takes into account communication, signaling and energy consumption constraints arising in the novel context of multi-hop WSN\u27s. In particular, the robustness of the algorithms is checked against packet collision events, infrequent sync updates, and errors introduced by different noise sources, such as transmission delays and clock frequency instabilities. By observing that WSN\u27s allow for greater flexibility in the design of the synchronization network architecture, this work examines also the relative merits of both peer-to-peer (mutually coupled - MC) and hierarchical (master-slave - MS) architectures. With both MC and MS architectures, synchronization accuracy degrades smoothly with the network size, provided that loop parameters are conveniently chosen. In particular, MS topologies guarantee faster synchronization, but they are hindered by higher noise accumulation, while MC topologies allow for an almost uniform error distribution at the price of much slower convergence. For all the considered cases, synchronization algorithms based on adaptive PLL and FLL designs are shown to provide robust and scalable network-wide time and frequency distribution in a WSN