Blind Carrier Phase Recovery for General 2{\pi}/M-rotationally Symmetric Constellations

This paper introduces a novel blind carrier phase recovery estimator for general 2{\Pi}/M-rotationally symmetric constellations. This estimation method is a generalization of the non-data-aided (NDA) nonlinear Phase Metric Method (PMM) estimator already designed for general quadrature amplitude constellations. This unbiased estimator is seen here as a fourth order PMM then generalized to Mth order (Mth PMM) in such manner that it covers general 2{\Pi}/M-rotationally symmetric constellations such as PAM, QAM, PSK. Simulation results demonstrate the good performance of this Mth PMM estimation algorithm against competitive blind phase estimators already published for various modulation systems of practical interest.Comment: 14 pages, 12 figures, International Journal of Wireless & Mobile Networks (IJWMN

Synchronization Techniques for Burst-Mode Continuous Phase Modulation

Synchronization is a critical operation in digital communication systems, which establishes and maintains an operational link between transmitter and the receiver. As the advancement of digital modulation and coding schemes continues, the synchronization task becomes more and more challenging since the new standards require high-throughput functionality at low signal-to-noise ratios (SNRs). In this work, we address feedforward synchronization of continuous phase modulations (CPMs) using data-aided (DA) methods, which are best suited for burst-mode communications. In our transmission model, a known training sequence is appended to the beginning of each burst, which is then affected by additive white Gaussian noise (AWGN), and unknown frequency, phase, and timing offsets. Based on our transmission model, we derive the Cramer-Rao bound (CRB) for DA joint estimation of synchronization parameters. Using the CRB expressions, the optimum training sequence for CPM signals is proposed. It is shown that the proposed sequence minimizes the CRB for all three synchronization parameters asymptotically, and can be applied to the entire CPM family. We take advantage of the simple structure of the optimized training sequence in order to design a practical synchronization algorithm based on the maximum likelihood (ML) principles. The proposed DA algorithm jointly estimates frequency offset, carrier phase and symbol timing in a feedforward manner. The frequency offset estimate is first found by means of maximizing a one dimensional function. It is then followed by symbol timing and carrier phase estimation, which are carried out using simple closed-form expressions. We show that the proposed algorithm attains the theoretical CRBs for all synchronization parameters for moderate training sequence lengths and all SNR regions. Moreover, a frame synchronization algorithm is developed, which detects the training sequence boundaries in burst-mode CPM signals. The proposed training sequence and synchronization algorithm are extended to shaped-offset quadrature phase-shift keying (SOQPSK) modulation, which is considered for next generation aeronautical telemetry systems. Here, it is shown that the optimized training sequence outperforms the one that is defined in the draft telemetry standard as long as estimation error variances are considered. The overall bit error rate (BER) plots suggest that the optimized preamble with a shorter length can be utilized such that the performance loss is less than 0.5 dB of an ideal synchronization scenario

Carrier-phase and frequency-estimation bounds for transmissions with embedded reference symbols

Copyright © 2006 IEEEThe true Crame/spl acute/r-Rao lower bound (CRLB) for the joint estimation of carrier phase and frequency is derived for transmission bursts with interleaved reference and phase-shift keying/quadrature amplitude modulated data symbols. Results are presented for the special cases of midamble, and preamble and postamble, pilot-symbol insertion. The derivation reveals that the CRLB is a function of the location of the reference symbols in the burst, the number of reference symbols, the number of data symbols, the signal-to-noise ratio and the data-modulation scheme. By distributing the reference symbols symmetrically about the center of the burst and analyzing relative to the middle of the signal vector, the joint frequency and phase estimation can be decoupled, and the optimal phase estimation is achieved. In the decoupled case, the phase CRLB is independent of the location of reference symbols in the burst. In a symmetrical burst, the use of a preamble and postamble is found to provide a lower frequency-estimation CRLB than that with a midamble. It appears that the frequency CRLB is reduced as the reference symbols are symmetrically distributed closer to the ends of the burst.Feng Ric

New advances in synchronization of digital communication receivers

Synchronization is a challenging but very important task in communications. In digital communication systems, a hierarchy of synchronization problems has to be considered: carrier synchronization, symbol timing synchronization and frame synchronization. For bandwidth efficiency and burst transmission reasons, the former two synchronization steps tend to favor non-data aided (NDA or blind) techniques, while in general, the last one is usually solved by inserting repetitively known bits or words into the data sequence, and is referred to as a data-aided (DA) approach. Over the last two decades, extensive research work has been carried out to design nondata-aided timing recovery and carrier synchronization algorithms. Despite their importance and spread use, most of the existing blind synchronization algorithms are derived in an ad-hoc manner without exploiting optimally the entire available statistical information. In most cases their performance is evaluated by computer simulations, rigorous and complete performance analysis has not been performed yet. It turns out that a theoretical oriented approach is indispensable for studying the limit or bound of algorithms and comparing different methods. The main goal of this dissertation is to develop several novel signal processing frameworks that enable to analyze and improve the performance of the existing timing recovery and carrier synchronization algorithms. As byproducts of this analysis, unified methods for designing new computationally and statistically efficient (i.e., minimum variance estimators) blind feedforward synchronizers are developed. Our work consists of three tightly coupled research directions. First, a general and unified framework is proposed to develop optimal nonlinear least-squares (NLS) carrier recovery scheme for burst transmissions. A family of blind constellation-dependent optimal "matched" NLS carrier estimators is proposed for synchronization of burst transmissions fully modulated by PSK and QAM-constellations in additive white Gaussian noise channels. Second, a cyclostationary statistics based framework is proposed for designing computationally and statistically efficient robust blind symbol timing recovery for time-selective flat-fading channels. Lastly, dealing with the problem of frame synchronization, a simple and efficient data-aided approach is proposed for jointly estimating the frame boundary, the frequency-selective channel and the carrier frequency offset

Efficient Maximum-Likelihood Based Clock and Phase Estimators for OQPSK Signals

In this paper we propose an algorithm for joint carrier phase and timing estimation with OQPSK modulations. The derivation is based on the maximum-likelihood criterion, and exploits a very efficient algorithm for the detection of differentially encoded $M$-PSK symbols already described in literature. Though we are mainly interested in measuring the phase and clock parameters, estimates of the transmitted symbols are also obtained as by-products. The resulting scheme has a feedforward structure and provides phase and timing information in a fixed time, differently from closed-loop architectures. It can be implemented in digital form and is particularly suitable for burst mode transmissions. Its performance is investigated by simulation and the results are compared with Cramér-Rao bounds. It turns out that the estimation accuracy is very close to the theoretical limits, even with short observation intervals and small values of the excess bandwidth. In such conditions, the proposed estimators largely outperform other schemes already known in literature. Their superiority becomes less significant as the signal bandwidth increases

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

GPU-Accelerated Demodulation for a Satellite Ground Station

One consequence of the increasing number of small satellite missions is an increasing demand for high data rate downlinks. As the satellites transmit at high data rates, ground-side receivers need to demodulate the transmitted data as quickly as possible. While application specific hardware can be designed, software defined radio solutions for ground stations are attractive for their flexibility, adaptability, and portability. Another industry trend is the increasing use of Graphics Processing Units (GPUs) in general-purpose processing. By performing many operations simultaneously, GPUs are capable of accelerating processing when given a problem that can be implemented in a parallel manner. Furthermore, once a parallel algorithm is implemented, further speedups are possible by increasing hardware resources without need for any revision in the algorithm. This project combines the above ideas by implementing a software defined radio algorithm to quickly demodulate high-speed data on a GPU. It demonstrates the viability of the GPU in software defined radio applications and particularly in the area of fast demodulation