Non-data-aided frequency offset and symbol timing estimation for binary CPM: performance bounds

The use of (spectrally efficient) CPM modulations may lead to a serious performance degradation of the classical non-data-aided (NDA) frequency and timing estimators due to the presence of self noise. The actual performance of these estimators is usually much worse than that predicted by the classical modified Cramer-Rao bound. We apply some well known results in the field of signal processing to these two important problems of synchronization. In particular we propose and explain the meaning of the unconditional CRB in the synchronization task. Simulation results for MSK and GMSK, along with the performance of some classical and previously proposed synchronizers, show that the proposed bound (along with the MCRB) is useful for a better prediction of the ultimate performance of the NDA estimators.Peer ReviewedPostprint (published version

Near Optimum Low Complexity Smoothing Loops for Dynamical Phase Estimation—Application to BPSK Modulated Signals

International audience—This correspondence provides and analyzes a low complexity, near optimum, fixed-interval smoothing algorithm that approaches the performance of an optimal smoother for the price of two low complexity sequential estimators, i.e., two phase-locked loops (PLLs). Based on a linear approximation of the problem, a theoretical performance evaluation is given. The theoretical results are compared to some simulation results and to the Bayesian and hybrid Cramér–Rao bounds. They illustrate the good performance of the proposed smoothing PLL (S-PLL) algorithm. Index Terms—Dynamical phase estimation, phase-locked loop (PLL), smoothing algorithm

Blind Estimation of Multiple Carrier Frequency Offsets

Multiple carrier-frequency offsets (CFO) arise in a distributed antenna system, where data are transmitted simultaneously from multiple antennas. In such systems the received signal contains multiple CFOs due to mismatch between the local oscillators of transmitters and receiver. This results in a time-varying rotation of the data constellation, which needs to be compensated for at the receiver before symbol recovery. This paper proposes a new approach for blind CFO estimation and symbol recovery. The received base-band signal is over-sampled, and its polyphase components are used to formulate a virtual Multiple-Input Multiple-Output (MIMO) problem. By applying blind MIMO system estimation techniques, the system response is estimated and used to subsequently transform the multiple CFOs estimation problem into many independent single CFO estimation problems. Furthermore, an initial estimate of the CFO is obtained from the phase of the MIMO system response. The Cramer-Rao Lower bound is also derived, and the large sample performance of the proposed estimator is compared to the bound.Comment: To appear in the Proceedings of the 18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), Athens, Greece, September 3-7, 200

Synchronization in digital communication systems: performance bounds and practical algorithms

Communication channels often transfer signals from different transmitters. To avoid interference the available frequency spectrum is divided into non-overlapping frequency bands (bandpass channels) and each transmitter is assigned to a different bandpass channel. The transmission of a signal over a bandpass channel requires a shift of its frequency-content to a frequency range that is compatible with the designated frequency band (modulation). At the receiver, the modulated signal is demodulated (frequency shifted back to the original frequency band) in order to recover the original signal. The modulation/demodulation process requires the presence of a locally generated sinusoidal signal at both the transmitter and the receiver. To enable a reliable information transfer, it is imperative that these two sinusoids are accurately synchronized. Recently, several powerful channel codes have been developed which enable reliable communication at a very low signal-to-noise ratio (SNR). A by-product of these developments is that synchronization must now be performed at a SNR that is lower than ever before. Of course, this imposes high requirements on the synchronizer design. This doctoral thesis investigates to what extent (performance bounds) and in what way (practical algorithms) the structure that the channel code enforces upon the transmitted signal can be exploited to improve the synchronization accuracy at low SNR

A comparison of soft and hard decision-directed feedforward phase estimators

Publication in the conference proceedings of EUSIPCO, Florence, Italy, 200

Improved timing recovery in wireless mobile receivers

The problem of timing recovery in wireless mobile receiver systems is critical. This is partly because timing recovery functions must follow rapid parameter changes inherent in mobile systems and partly because both bandwidth and power must be conserved in low signal to noise ratio communication channels. The ultimate goal is therefore to achieve a low bit error rate on the recovered information for improving QoS provisioning to terminal mobile users. Traditional timing recovery methods have over-relied on phase-locked loops for timing information adjustment. However, associated schemes do not exploit code properties. This leads to synchronization difficulties in digital receivers separated from transmitters by lossy channels. In this paper we present a soft timing phase estimation algorithm for wireless mobile receivers in low signal to noise ratios. In order to develop a bandwidth and power efficient timing recovery method for wireless mobile receivers, a raised cosine filter and a multilevel phase shift keying modulation scheme are implemented and no clock signals are transmitted to the receiver. In the proposed method, the receiver exploits the soft decisions computed at each turbo decoding iteration to provide reliable estimates of a soft timing signal, which in turn, improves the decoding time. The derived method, based on sequential minimization techniques, approaches the theoretical Cramer-Rao bound with unbiased estimates within a few iterations.Key Words: discrete polyphase matched filters, maximum likelihood estimators, iterative turbo receivers, log-MAP b