New Blind Block Synchronization for Transceivers Using Redundant Precoders

This paper studies the blind block synchronization problem in block transmission systems using linear redundant precoders (LRP). Two commonly used LRP systems, namely, zero padding (ZP) and cyclic prefix (CP) systems, are considered in this paper. In particular, the block synchronization problem in CP systems is a broader version of timing synchronization problem in the popular orthogonal frequency division multiplexing (OFDM) systems. The proposed algorithms exploit the rank deficiency property of the matrix composed of received blocks when the block synchronization is perfect and use a parameter called repetition index which can be chosen as any positive integer. Theoretical results suggest advantages in blind block synchronization performances when using a large repetition index. Furthermore, unlike previously reported algorithms, which require a large amount of received data, the proposed methods, with properly chosen repetition indices, guarantee correct block synchronization in absence of noise using only two received blocks in ZP systems and three in CP systems. Computer simulations are conducted to evaluate the performances of the proposed algorithms and compare them with previously reported algorithms. Simulation results not only verify the capability of the proposed algorithms to work with limited received data but also show significant improvements in the block synchronization error rate performance of the proposed algorithms over previously reported algorithms

Blind block synchronization algorithms in cyclic prefix systems

In orthogonal frequency division multiplexing (OFDM) systems, symbol synchronization is a critical step for successful data transmission. While this task is done in most current systems by using training symbols, a few studies have been dedicated to solving the problem blindly, that is, where training symbols are not available. Blind symbol synchronization problem is especially important in many blind channel estimation algorithms in the literature which assume that OFDM symbol synchronization is perfect. In this paper, a broader version of the blind symbol synchronization problem is studied, namely, blind block synchronization in cyclic-prefix (CP) systems. The proposed algorithm for this broader problem covers the blind symbol synchronization problem in OFDM systems. Unlike previously reported algorithms which are based on obtaining sufficient statistics of received samples, the proposed algorithm is capable of identifying the correct block boundaries using much less received data in absence of noise. Simulation results of the proposed algorithm not only verify the declared property but also demonstrate improvement in accuracy of symbol synchronization over previously reported algorithms in presence of noise

Signal Processing Design of Low Probability of Intercept Waveforms

This thesis investigates a modification to Differential Phase Shift Keyed (DPSK) modulation to create a Low Probability of Interception/Exploitation (LPI/LPE) communications signal. A pseudorandom timing offset is applied to each symbol in the communications stream to intentionally create intersymbol interference (ISI) that hinders accurate symbol estimation and bit sequence recovery by a non-cooperative receiver. Two cooperative receiver strategies are proposed to mitigate the ISI due to symbol timing offset: a modified minimum Mean Square Error (MMSE) equalization algorithm and a multiplexed bank of equalizer filters determined by an adaptive Least Mean Square (LMS) algorithm. Both cooperative receivers require some knowledge of the pseudorandom symbol timing dither to successfully demodulate the communications waveform. Numerical Matlab® simulation is used to demonstrate the bit error rate performance of cooperative receivers and notional non-cooperative receivers for binary, 4-ary, and 8-ary DPSK waveforms transmitted through a line-of-sight, additive white Gaussian noise channel. Simulation results suggest that proper selection of pulse shape and probability distribution of symbol timing offsets produces a waveform that is accurately demodulated by the proposed cooperative receivers and significantly degrades non-cooperative receiver symbol estimation accuracy. In typical simulations, non-cooperative receivers required 2-8 dB more signal power than cooperative receivers to achieve a bit error rate of 1.0%. For nearly all reasonable parameter selections, non-cooperative receivers produced bit error rates in excess of 0.1%, even when signal power is unconstrained

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