1,048 research outputs found
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
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
Subspace-Based Blind Channel Identification for Cyclic Prefix Systems Using Few Received Blocks
In this paper, a novel generalization of subspace-based blind channel identification methods in cyclic prefix (CP) systems is proposed. For the generalization, a new system parameter called repetition index is introduced whose value is unity for previously reported special cases. By choosing a repetition index larger than unity, the number of received blocks needed for blind identification is significantly reduced compared to all previously reported methods. This feature makes the method more realistic especially in wireless environments where the channel state is usually fast-varying. Given the number of received blocks available, the minimum value of repetition index is derived. Theoretical limit allows the proposed method to perform blind identification using only three received blocks in absence of noise. In practice, the number of received blocks needed to yield a satisfactory bit-error-rate (BER) performance is usually on the order of half the block size. Simulation results not only demonstrate the capability of the algorithm to perform blind identification using fewer received blocks, but also show that in some cases system performance can be improved by choosing a repetition index larger than needed. Simulation of the proposed method over time-varying channels clearly demonstrates the improvement over previously reported methods
Blind symbol synchronization based on cyclic prefix for OFDM systems
In this paper, a blind symbol synchronization algorithm is presented for orthogonal frequency-division multiplexing (OFDM) systems, and a new timing function based on the redundancy of the cyclic prefix (CP) is introduced. It proves that the maximum of this function necessarily points to the correct timing offset, irrespective of channel conditions when the signal-to-noise ratio is high. Using the timing function, the timing offset is estimated through a searching algorithm. Channel power profile and channel length information are unnecessary. Simulation results show that the proposed algorithm is robust and outperforms the existing CP-based algorithms, particularly in frequency-selective fading channels. © 2008 IEEE.published_or_final_versio
- …