Beruflich Dokumente
Kultur Dokumente
Outline
I. II. Introduction System Model
III. Symbol Timing Synchronization IV. Various Symbol Timing Estimators V. Simulation Results
VI. Conclusion
Introduction OFDM
Orthogonal Frequency Division Multiplexing (OFDM)
Widely used in many wireless systems such as WLAN, DAB, DVB, etc. Combats inter-symbol interference using computationally efficient fast Fourier transform (FFT) and cyclic prefix. Symbol timing synchronization is necessary.
This paper derives the optimal symbol timing estimators with various performance measures.
Outline
I. II. Introduction System Model
III. Symbol Timing Synchronization IV. Various Symbol Timing Estimators V. Simulation Results
VI. Conclusion
Objective
Estimation of with the observation of M received samples y[n] .
Outline
I. II. Introduction System Model
III. Symbol Timing Synchronization IV. Various Symbol Timing Estimators V. Simulation Results
VI. Conclusion
FFT window
OFDM Symbol 1 OFDM Symbol 2
cyclic prefix
N g + 1 N g + N / 2 1 FFT window
OFDM Symbol 0 OFDM Symbol 1 OFDM Symbol 2
1 N / 2
OFDM Symbol 0
FFT window
OFDM Symbol 1 OFDM Symbol 2
0 N g
OFDM Symbol 0
FFT window
OFDM Symbol 1 OFDM Symbol 2
cyclic prefix
10
N g + 1 N g + N / 2 1 FFT window
OFDM Symbol 0 OFDM Symbol 1 OFDM Symbol 2
1 N / 2
OFDM Symbol 0
FFT window
OFDM Symbol 1 OFDM Symbol 2
11
ICI and ISI gradually increases as the symbol timing error increases.
It may not be a good idea to treat all the symbol timing errors equally regardless of their magnitudes. In some cases, it may be preferable to have frequent small errors rather than infrequent large errors.
The goal of symbol timing synchronization can be different depending on OFDM systems considered.
12
Outline
I. II. Introduction System Model
III. Symbol Timing Synchronization IV. Various Symbol Timing Estimators V. Simulation Results
VI. Conclusion
13
= arg max{p( | y )}
MAP estimator becomes the maximum likelihood (ML) estimator for uniformly distributed . ML estimator was derived by Van de Beek et al.
14
15
E[c( )]
c ( ) = [min{(( )) N , N t (( )) N }]2 t t
cyclic prefix
16
E[c( )]
( c( ) = [max{min{( ))N , Nt (( ))N },0}]
t t
cyclic prefix
17
18
0, (( )) N t = 0 c( ) = 1, otherwise
0, (( )) N t N g c( ) = otherwise 1,
FFT window
FFT window
cyclic prefix
19
cyclic prefix
The estimators for maximum SNR and minimum average BER can be found as a special case of a general Bayesian estimator. No analytic expressions for the cost functions are available. The cost functions can be found by simulation.
20
Outline
I. II. Introduction System Model
III. Symbol Timing Synchronization IV. Various Symbol Timing Estimators V. Simulation Results
VI. Conclusion
21
22
23
24
Outline
I. II. Introduction System Model
III. Symbol Timing Synchronization IV. Various Symbol Timing Estimators V. Simulation Results
VI. Conclusion
25
Conclusion
Developed optimum symbol timing estimators for various performance measures.
Minimum failure probability estimator Minimum mean square error estimator Modified minimum mean square error estimator
Derived a general Bayesian estimator and described all the above estimators and ML estimator in the general context of Bayesian estimation theory. Showed that different estimators should be chosen depending on the goal of the symbol timing synchronization.
26