Timing and Carrier Synchronization in Wireless Communication Systems: A Survey and Classification of Research in the Last 5 Years

Timing and carrier synchronization is a fundamental requirement for any wireless communication system to work properly. Timing synchronization is the process by which a receiver node determines the correct instants of time at which to sample the incoming signal. Carrier synchronization is the process by which a receiver adapts the frequency and phase of its local carrier oscillator with those of the received signal. In this paper, we survey the literature over the last 5 years (2010–2014) and present a comprehensive literature review and classification of the recent research progress in achieving timing and carrier synchronization in single-input single-output (SISO), multiple-input multiple-output (MIMO), cooperative relaying, and multiuser/multicell interference networks. Considering both single-carrier and multi-carrier communication systems, we survey and categorize the timing and carrier synchronization techniques proposed for the different communication systems focusing on the system model assumptions for synchronization, the synchronization challenges, and the state-of-the-art synchronization solutions and their limitations. Finally, we envision some future research directions

Scattered Pilots and Virtual Carriers Based Frequency Offset Tracking for OFDM Systems: Algorithms, Identifiability, and Performance Analysis

In this paper, we propose a novel carrier frequency offset (CFO) tracking algorithm for orthogonal frequency division multiplexing (OFDM) systems by exploiting scattered pilot carriers and virtual carriers embedded in the existing OFDM standards. Assuming that the channel remains constant during two consecutive OFDM blocks and perfect timing, a CFO tracking algorithm is proposed using the limited number of pilot carriers in each OFDM block. Identifiability of this pilot based algorithm is fully discussed under the noise free environment, and a constellation rotation strategy is proposed to eliminate the c-ambiguity for arbitrary constellations. A weighted algorithm is then proposed by considering both scattered pilots and virtual carriers. We find that, the pilots increase the performance accuracy of the algorithm, while the virtual carriers reduce the chance of CFO outlier. Therefore, the proposed tracking algorithm is able to achieve full range CFO estimation, can be used before channel estimation, and could provide improved performance compared to existing algorithms. The asymptotic mean square error (MSE) of the proposed algorithm is derived and simulation results agree with the theoretical analysis

Dispensing with channel estimation: differentially modulated cooperative wireless communications

As a benefit of bypassing the potentially excessive complexity and yet inaccurate channel estimation, differentially encoded modulation in conjunction with low-complexity noncoherent detection constitutes a viable candidate for user-cooperative systems, where estimating all the links by the relays is unrealistic. In order to stimulate further research on differentially modulated cooperative systems, a number of fundamental challenges encountered in their practical implementations are addressed, including the time-variant-channel-induced performance erosion, flexible cooperative protocol designs, resource allocation as well as its high-spectral-efficiency transceiver design. Our investigations demonstrate the quantitative benefits of cooperative wireless networks both from a pure capacity perspective as well as from a practical system design perspective

The Practical Challenges of Interference Alignment

Interference alignment (IA) is a revolutionary wireless transmission strategy that reduces the impact of interference. The idea of interference alignment is to coordinate multiple transmitters so that their mutual interference aligns at the receivers, facilitating simple interference cancellation techniques. Since IA's inception, researchers have investigated its performance and proposed improvements, verifying IA's ability to achieve the maximum degrees of freedom (an approximation of sum capacity) in a variety of settings, developing algorithms for determining alignment solutions, and generalizing transmission strategies that relax the need for perfect alignment but yield better performance. This article provides an overview of the concept of interference alignment as well as an assessment of practical issues including performance in realistic propagation environments, the role of channel state information at the transmitter, and the practicality of interference alignment in large networks.Comment: submitted to IEEE Wireless Communications Magazin

Synchronization in Cooperative Communication Systems

Cooperative communication is an attractive solution to combat fading in wireless communication systems. Achieving synchronization is a fundamental requirement in such systems. In cooperative networks, multiple single antenna relay terminals receive and cooperatively transmit the source information to the destination. The multiple distributed nodes, each with its own local oscillator, give rise to multiple timing offsets (MTOs) and multiple carrier frequency offsets (MCFOs). Particularly, the received signal at the destination is the superposition of the relays' transmitted signals that are attenuated differently, are no longer aligned with each other in time, and experience phase rotations at different rates due to different channels, MTOs, and MCFOs, respectively. The loss of synchronization due to the presence of MTOs and MCFOs sets up the recovery of the source signal at the destination to be a very challenging task. This thesis seeks to develop estimation and compensation algorithms that can achieve synchronization and enable cooperative communication for both decode-and-forward (DF) and amplify-and-forward (AF) relaying networks in the presence of multiple impairments, i.e., unknown channel gains, MTOs, and MCFOs. In the first part of the thesis, a training-based transmission scheme is considered, in which training symbols are transmitted first in order to assist the joint estimation of multiple impairments at the destination node in DF and AF cooperative relaying networks. New transceiver structure at the relays and novel receiver design at the destination are proposed which allow for the decoding of the received signal in the presence of unknown channel gains, MTOs, and MCFOs. Different estimation algorithms, e.g., least squares (LS), expectation conditional maximization (ECM), space-alternating generalized expectation-maximization (SAGE), and differential evolution (DE), are proposed and analyzed for joint estimation of multiple impairments. In order to compare the estimation accuracy of the proposed estimators, Cramer-Rao lower bounds (CRLBs) for the multi-parameter estimation are derived. Next, in order to detect the signal from multiple relays in the presence of multiple impairments, novel optimal and sub-optimal minimum mean-square error (MMSE) compensation and maximum likelihood (ML) decoding algorithm are proposed for the destination receiver. It has been evidenced by numerical simulations that application of the proposed estimation and compensation methods in conjunction with space-time block codes achieve full diversity gain in the presence of channel and synchronization impairments. Considering training-based transmission scheme, this thesis also addresses the design of optimal training sequences for efficient and joint estimation of MTOs and multiple channel parameters. In the second part of the thesis, the problem of joint estimation and compensation of multiple impairments in non-data-aided (NDA) DF cooperative systems is addressed. The use of blind source separation is proposed at the destination to convert the difficult problem of jointly estimating the multiple synchronization parameters in the relaying phase into more tractable sub-problems of estimating many individual timing offsets and carrier frequency offsets for the independent relays. Next, a criteria for best relay selection is proposed at the destination. Applying the relay selection algorithm, simulation results demonstrate promising bit-error rate (BER) performance and realise the achievable maximum diversity order at the destination