OFDM Synchronization: Speaker: 官雯彗

OFDM Synchronization
Speaker:
Wireless Access Tech. Lab.
Outline
OFDM System Description Synchronization
What is Synchronization?
Symbol Synchronization
Non-data-aided Method (Maximum likelihood, BPSK-OFDM case)
Frequency Synchronization
Non-data-aided Method (Via oversampling) Data-aided Method (Special training-symbol-block)
Joint Symbol and Frequency Synchronization

Non-data-aided Method (Exploiting second-order cyclostationarity)
2
CCU Wireless Access Tech. Lab.
OFDM System Block

Xi
S/P IFFT
P/S
channel
Yi
P/S FFT
' S/P i
3
OFDM System Description

An OFDM symbol structure Cyclic prefix interval
Symbol interval
xi,0,xi,1,,xi,N-1
CP
copy
x i xi , 0 , xi ,1 ,
, xi ,( N 1)
4
Signal Model
W
kn N
1 j N nk = e k = 0 ,1,2 , N
,N-1
0 WN ( N 1) 1 WN( N 1) ( N 1)( N 1) WN N N
0 0 0 WN 0 WN 1 WN 2 1 1 1 WN0 WN1 WN2 W= ( N 1)0 ( ( WN N 1)1 WN N 1)2 WN
X i ,k
1 = N
x
n =0
N 1
i ,n
2 nk N
1 xi ,n = N
X
k =0
N 1
i ,k e
2 nk N
- - > X i = Wx i . X i is frequency domain signal. FFT - - > x i = W * X i . x i is time domain signal. IFFT


6
Symbol synchronization
Symbol Synchronization refers to the task of finding the precise moment of when individual OFDM symbols start and end.
Frequency synchronization
Let the transmitted signal be sn, then the complex baseband model of the passband signal yn is Then the received complex baseband signal rn is
rn = sn e j2ftx nTs e -j2frx nTs = sn e j2f nTs where f and f is the transmitter and receiver carrier frequency tx rx respectively, and f is frequency offset.
7
yn = sn e j2 ftx nT s
Received Signal
Transmitted signal
Cyclic prefix interval Symbol interval
xi ,( N CP ) ,
, xi ,( N 1) , xi , 0 , xi ,1 ,
, xi ,( N 1)
Received signal
xi' ,k = xi ,k e
j + j 2 n N
+ wi ,k
where is initial phase,
is frequency offset,
xi ,k represents kth sample in ith OFDM symbol, wi ,k is AWGN term.
8
CP ith OFDM symbol CP
Corrert sampling, = 0, = 0, and wi ,k = 0 :

0 0 0 WN 0 WN 1 WN 2 1 1 1 WN0 WN1 WN2 ' 2 2 2 Wx = WN 0 WN 1 WN 2 W ( N 1)0 W ( N 1)1 W ( N 1)2 N N N 0 X i ,0 WN ( N 1) xi , 0 X 1 WN( N 1) xi ,1 i ,1 2 WN ( N 1) xi , 2 = X i = X i , 2 ( X i ,( N 1) WN N 1)( N 1) xi ,( N 1)
9
Error sampling, = 0, = 0, wi ,k = 0, a is an integer number :

0 0 0 WN 0 WN 1 WN 2 10 1 1 WN1 WN2 WN 2 2 2 Wx ' = WN 0 WN 1 WN 2 W ( N 1)0 W ( N 1)1 W ( N 1)2 N N N WN ( N a )0 0 ( N a )1 WN 0 = 0 0 0 WN ( N 1) xi ,( N a ) 1 WN( N 1) 2( N 1) xi , 0 WN ( N 1)( N 1) xi ,( N a 1) WN 0 WN ( N 1) 1 WN( N 1) 0 WN 0 1 WN0
0 0 WN ( N a ) WN ( N a +1) 1( N a ) 1 WN( N a +1) 0 WN ( ( WN ( N a )( N 1) WN N 1)( N a ) WN N 1)( N a +1)
( ( WN N 1)( N 1) WN N 1)0
xi ,( N a ) 0 WN ( N a 1) 1( N a 1) WN x i ,0 ( WN N 1)( N a 1) x i ,( N a 1)
=P
( N a )
X i ,0 ( N a) Xi =P X i ,( N 1)
10
Error sampling, = 0, = 0, wi ,k = 0, a is an integer number :

0 0 0 WN 0 WN 1 WN 2 10 1 1 WN1 WN2 WN 2 2 2 Wx ' = WN 0 WN 1 WN 2 W ( N 1)0 W ( N 1)1 W ( N 1)2 N N N
xi ,a W W x i ,( N 1) W xi +1,( N CP ) ( N 1)( N 1) WN x i +1,( N CP + a )

0( N 1) N 1( N 1) N 2( N 1) N
11

Corrert sampling, wi ,k = 0 :
0 0 0 WN 0 WN 1 WN 2 10 1 1 WN1 WN2 WN 2 2 2 Wx' = WN 0 WN 1 WN 2 W ( N 1)0 W ( N 1)1 W ( N 1)2 N N N 0 0 0 WN 0 WN 1 WN 2 10 1 1 WN1 WN2 WN 2 2 2 = e j W N 0 WN 1 WN 2 W ( N 1)0 W ( N 1)1 W ( N 1)2 N N N
x[0] e j W 2 j + j N x[1] e W 2 j + j 2 W N x[2] e 2 ( j + j ( N 1) WN N 1)( N 1) x[ N 1] e N x[0] 0 WN ( N 1) 2 j 1( N 1) x[1] e N WN 2 2 j 2 WN ( N 1) x[2] e N 2 ( N 1)( N 1) j ( N 1) WN x[ N 1] e N

0( N 1) N 1( N 1) N 2( N 1) N
12
Synchronization task
Data-aided method Non-data-aided method
13


14
Wireless Access Tech. Lab. Non-data-aided Method (Maximum likelihood)

To consider the received signal r (k ) = st (k )e
j 2 ( k ) N
+ w(k )
s (k + N CP ) ,0 k CP 1 , where st (k ) = , CP k CP + N 1 s (k CP ) CP is the length of cyclic prefix, N is the number of subcarriers, s (k ) is transmitted signal,
and are timing shift and carrier frequency offset respectively,

and w(k ) is AWGN term.
15

2 s2 + n , m = 0 k , E r (k )r * (k + m) = s2 e j 2 , m = N 0, otherwise
Observation interval
Symbol i-1
Symbol i
Symbol i+1
'
2N+CP
16

The log - likelihood function is ( , ) = log f (r | , ) = log f (r (k ), r (k + N ) ) f (r (k ) ) k ' k f (r (k ), r (k + N ) ) = log f (r (k ) ) k f (r ( k ) ) f (r ( k + N ) ) k where f () denotes the probability desity function of the variables,
2 r (k ) exp 2 2 ( s + n ) , and f (r (k ) ) = 2 2 ( s + n )
r (k ) 2 2 Re e j 2 r (k )r * (k + N ) + r (k + N ) 2 exp 2 2 2 ( s + n )(1 ) f (r (k ), r (k + N ) ) = 2 2 2 2 ( s + n )(1 )
17

Thus, ( , ) = ( ) cos(2 + ( )) ( ), where deontes the argument of a complex number,
m + L 1 k =m
( m) =
r (k )r * (k + N ),
1 m + L 1 2 2 ( m) = r ( k ) + r ( k + N ) , 2 k =m and =
E r (k ) E r (k + N )
2
E r (k )r * (k + N )
}{
}
2
s2 SNR = 2 = 2 s + n SNR + 1
18
is the magnitude of the correlation coefficien t.

Because max ( , ) = max max ( , ) = max ( , ML ( )),
( , )
( , ) = ( ) cos(2 + ( )) ( ) Thue, the estimated frequency offset is 1 ( ) + n, n is an integer, 2 and the estimated symbol timing is ML =
ML = arg max{ ( ) ( )}
19


20
Wireless Access Tech. Lab. Non-data-aided Method (BPSK-OFDM case) Signal model in BPSK-OFDM system
The transmitted signal is
j nk 1 N 1 N si (k ) = , 0 k N 1 xi,ne N n =0 where N denotes the IFFT window size, 2
si (k ) presents kth sample of ith OFDM symbol, xi ,n presents the data of nth subcarrier in ith symbol interval. Because BPSK mapping is used, xi ,n is real value.
21
Wireless Access Tech. Lab. Non-data-aided Method (BPSK-OFDM case)

real (si (k ) ) 1 = real N
xi ,n e
n =0
N 1
2 nk N
1 = N
xi ,n cos(
n =0
N 1
2 nk ) N
2 j nk 1 N 1 1 N 1 2 N = imag imag (si (k ) ) xi ,ne = N xi,n sin( N nk ) N n =0 n=0 2 2 j n( N k ) j nk 1 N 1 1 N 1 N N = real xi ,n e e j 2n real (si ( N k ) ) = real xi ,n e N N n =0 n =0 2 j nk 1 N 1 1 N 1 2 N = = real xi ,ne xi,n cos( N nk ) = real si (k ) N N n=0 n =0 2 2 nk j n( N k ) j 1 N 1 1 N 1 j 2n N N = imag imag (si ( N k ) ) = imag e xi ,ne N xi ,n e n =0 N n =0
1 = imag N
xi ,ne
n =0
N 1
2 nk N
1 = N
xi ,n sin(
n =0
N 1
2 nk ) = imag (s i (k ) ) N
22
Thus, the symmetry characteristic in BPSK - OFDM symbol can be written as N si (k ) = s ( N k ) , k 0 or . 2

* i
23
Because si (k ) = si* ( N k ) when k 0 or si (0) Ai , 0 e si (k ) Ai ,k e

j i , 0 j i , k
N , si (k ) can be expressed as 2 , k 0 or N 2
si ( N k ) = Ai ,k e
j i , N
2
j i ,k
si ( N 2) Ai , N 2 e
where Ai ,k and i ,k denote the magnitude and the phase of si (k ) respectively.
24
The received signal is ri (k ) = vi (k ) + wi (k ) vi (k ) = si (k )e

j + j 2 k N
ri ( ) = vi (0) + wi ( )
where is timing shift,
is initial phase, is carrier frequency offset,

and wi (k ) is AWGN term.
CP
si (k ) presents kth sample of ith OFDM symbol,
25

First group of symmetry relationship : When vi (0) is taken as the central point for the two opposite samples vi (k ) and vi ( k ), it has the character vi (k ) vi (k ) = A e
2 i ,k j 2
, 1 k CP
N 2
CP
Second group of symmetry relationship : When vi ( N 2) is taken as the central point for the two opposite samples vi (k ) and vi ( N k ), it has the character vi (k ) vi ( N k ) = Ai2,k e j 2 + j 2 , 1 k N 2 1
CP
+
N 2
26
Wireless Access Tech. Lab. Non-data-aided Method (BPSK-OFDM case) There are three kinds of useful property can be employed as follows:
The first group of symmetry relationship. The second group of symmetry relationship. The cyclic prefix copied from the tail of OFDM symbol.
27
Wireless Access Tech. Lab. Non-data-aided Method (BPSK-OFDM case) - Using angle
In second group of symmetry relationship, vi (k ) vi ( N k ) = Ai2,k e j 2 + j 2 where 1 k N 2 1.
C k = {Ck ,1 , Ck , 2 , Ck ,1 = angle(ri (k + 1) ri (k + N 1) ) Ck , N 21 = angle(ri (k + N 2 1) ri (k + N N 2 + 1) ) The mean of C is 1 N 21 E{C k } = 1 Ck ,m N 2 1 m= f {C k } =
N 2 1 m =1
, Ck , N 21 } where
N 2
CP
CP
When the central point of opposite samples is ri ( N 2 + ), phase of ri ( N 2 + ), and the cost function f {C } is zero for noise - free case.
28
The cost function f {C } is
the mean of C = {C ,1 , C , 2 ,
, C , N 21 }is the twice initial
k ,m
E{C k }
Wireless Access Tech. Lab. Non-data-aided Method (BPSK-OFDM case) - Using angle
First useful property : 1 CP E{B k } = Bk ,m CP m =1 f {B k } = Bk ,m E{B k }
m =1 CP
Bk ,m = angle(ri (k + m) ri (k m) )
N 2
CP
Second useful property : 1 N 21 E{C k } = Ck , m N 2 1 m =1 f {C k } =

N 2 1 m =1
Ck ,m = angle(ri (k + m) ri (k + N m) )
Fk f {B k }+ f {C k }+ f {D k }
+
N 2
k ,m
E{C k }
CP
Third useful property : Dk ,m = angle ri (k m) ri* (k + N m) 1 CP E{D k } = Dk ,m CP m =1 f {D k } = Dk ,m E{D k }

m =1 CP
)
+
N 2
CP
29
Wireless Access Tech. Lab. Non-data-aided Method (BPSK-OFDM case) - Using correlation
In second group of symmetry relationship, vi (k ) vi ( N k ) = Ai2,k e j 2 + j 2 where 1 k N 2 1.
i i
+
N 2
C (k ) =
N 2 1 m =1
r ( k + m) r ( k + N m)
CP
CP
When the central point of opposite samples is ri ( + N 2), k = , C ( ) has the maximum value in observation region.
30
Wireless Access Tech. Lab. Non-data-aided Method (BPSK-OFDM case) - Using correlation
First useful property : B(k ) =
r ( k + m) r ( k m)
m =1 i i
CP
N 2
CP
Second useful property : C (k ) =
N 2 1 m =1
r ( k + m) r ( k + N m)
i i
Fk B(k ) + C (k ) + D(k )
+
N 2
CP
Third useful property : D(k ) =
= arg max Fk
+
N 2
r ( k m) r ( k + N m )
* m =1 i i
CP
CP
31
Performance Analysis
10
0
AWGN channel
10
AWGN channel
10
-1
10
Lost symbol timing rate
Mean-squared error
10
-2
10
10
-3
10
10
-4
10
-1
10
-5
Using angle Using correlation ML 0 1 2 3 4 5 SNR(dB) 6 7 8 9 10
10
-2
Using angle Using correlation ML 0 1 2 3 4 5 SNR(dB) 6 7 8 9 10
10
-6
10
-3
32
8 7 6
x 10
Maximum likelihood algorithm
10 9 8 7
x 10
Using angle (Using two groups of symmetry relationship)
5 Statistics
6 Statistics 5 4 3
4 3 2
2
1 0
1 0 20
50 Time index, n
100
150
40
60
80 Time index, n
100
120
140
CP
CP
CP
33
Solution
Image part
Real part
: A pair of sample which has symmetry characteristic in noise free case
34
Solution
Image part
Real part
: A pair of sample which has symmetry characteristic in noise free case
35


36
Non-data-aided Method (Via oversampling)

Using the DFT based OFDM modulation with N subcarrier, the continuous time complex baseband OFDM symbol 1 s (t ) = N
d e
k =0 k
N 1
2k ( t t s ) T
where d k is used to modulate the subcarrier e j 2k T , t s is the starting time of the current OFDM symbol (excluding the guard time), T is the OFDM symbol duration (DFT/IDFT interval).
37

We define Ts = T N as the symbol interval. Assume that the sampling instances for s (t ) are at t = t s + nTs + where is the initial time shift and n = 0, , N 1, we have two sets of discrete - time observatio ns depending on . = 0. This is the usual IDFT OFDM symbol model
j 1 N 1 s1 ( n) = dk e N N k =0 Ts T = = . In this case, we get the signal model 2 2N 2k 1 j (n+ ) 1 N 1 s2 ( n) = dke N 2 N k =0 0 2nk
s1(n)
s2(n)
Ts 2Ts
( N 1)Ts T
38

Written in matrix form, we have s1 = Wd s2 = WEd
T
where W is the IDFT matrix; d is the symbol vector
[d 0 ,
, d N 1 ] ; and
j E = diag 1 e N
( N 1) N
39

In the presence of time dispersive channel, additive noise, and carrier frequency offset, the continuous time baseband received signal is then,
2k j( + )( t t s ) 1 N 1 T x(t ) = + z (t ) H (k )d k e N k =0 where H (k ) is the channel frequency response
corresponding to subcarrier k and is the frequency offset.

40

Under the sampling time at t = t s + nTs + , we have two sets of discrete - time observations depending on . = 0.
+ Ts ) n j( 1 N 1 N x1 (n) = + z1 (n) H (k )d k e N k =0 T T = s = 2 2N 2k 1 + Ts )( n + ) j( 1 N 1 2 x2 ( n ) = + z 2 ( n) H (k )d k e N N k =0 where z1 (n) and z 2 (n) are additive complex Gaussian 2k
noise and are usually assumed to be uncorrelated to each other. We defined as = Ts .
41

The above signal model can be written in a more compact matrix form as follows : ~ x1 = PW d + z1 ~ x 2 = e j 2 PWE d + z 2 (1) (2)
~ where d = Hd with H being a diagonal matrix with diagonal element H (k ). The matrix E reflects the phase shift between x1 and x 2 due to the difference in subcarrier frequencies, while the phase shift due to the frequency offset differs by a scalar constant e j 2 . Where P = diag (1, e j , , e j ( N 1) )
42

Perfect recovery of carrier frequency offset in the absence of noise
~ From (1) and (2), we notice that d is unknown, and we want to blind estimation of the frequency offset . Define y 1 = W H P H x1 y2 = e
j
(3) (4)
EH W H P H x2
It is straightfo rward to verify that in the absence of noise ~ (5) y1 = y 2 = d Thus it is intuitive to find such the resulting y 1 and y 2 are equal.
43

Frequency offset estimation in the present of noise
In presence of noise, it is unlikely that (5) will be true for any value of . However, we propose, intuitively, to minimize the distance between y 1 and y 2 . min(y1 y 2 )H (y1 y 2 )
Above minimization criterion using maximumlikelihood principles is provided in the next section.
44


45
Wireless Access Tech. Lab. Data-aided Method (Special training-symbol-block) At the transmitter, the training-symbol-block contains two equal-length training symbols in time domain, and the second training symbol is the inverse repeat of the first one.
The training - symbol- block :
S = [s(0) ,s(1) , ,s( N 1) ,s( N 1) , ,s(1) ,s(0)] where N denotes the DFT length of training symbols.
46
Wireless Access Tech. Lab. Data-aided Method (Special training-symbol-block) At receiver, without considering of the channel attenuation and additive AWGN, the relationship between corresponding samples in a received trainingsymbol-block is :
r ( 2 N 1 k ) = r ( k ) e j 2 ( 2 N 1 2 k ) / N k [ 0 , N 1] to a
where r ( k ) denotes the k th sample and denotes the carrier frequency offset normalized subcarrier spacing of training symbols.
47
Wireless Access Tech. Lab. Data-aided Method (Special training-symbol-block) A timing metric is defined:
M (d ) = 2 r (2 N + d 1 k )r * (k + d )
k =0 d + 2 N 1 N 1
k =d
r (k )
2 r(k - d)r * (k + d )e j 2 ( 2 N + 2 d 1 2 k ) / N
k =0 d + 2 N 1
N -1
k =d
r (k )
where d is a time index corresponding to the first sample in a window of 2 N samples.

48
Wireless Access Tech. Lab. Data-aided Method (Special training-symbol-block)
49

Shown in Fig. 1, that the expectation of M (0) is a function of with period of N / 2, and within each period, a main lobe appears. The expectation of M (d <> 0) is a constant independen t of . Within one period (without loss of generality, [ N 4 , N 4] is assumed), M (0) > M (d <> 0) is satisfied only in a small vicinity which stands in the center of the main lobe.
50
51
At the transmitter, 2 identical training - symbol - blocks are transmitted. At the receiver, 3 N samples of the training sequence are buffered. The length of 3 N guarantees one integral training - symbol - block being buffered.
52

Because the carrier frequency offset is fully unknown at the start of acquisition, a method of lookup is used : (2k + 1) presupposed values : ( k = -k , ( k 1) = (k 1) , 1 = , , 1 = , 0 = 0, , k 1 = (k 1) , k = k )
where k < N 4 and 0 < < N (2(2 N 1)) denotes the lookup interval.
53

For jth ( k j k ) compensated training sequence, the maximum M (d ) (0 d N 1) is represented as j which implies the appearance of an integral training - symbol block ; if q > p q for each k p k , then q denotes the carrier frequency offst estimated by acquisition algorithm. The estimated start of that integral training symbol - block d is also the output of acquisition.
0
54
Wireless Access Tech. Lab. Data-aided Method (Special training-symbol-block) After acquisition, if the remaining carrier frequency offset exceeds the tracking range, tracking algorithm will not work correctly, and this is called Missing Lock. For usable SNR, if N is large enough, the probability of Missing Lock is negligible.
55
Wireless Access Tech. Lab. Data-aided Method (Special training-symbol-block) After acquisition, the remaining frequency offset needs to be further corrected.
For a receivedtraining- symbol- block under certain SNR condition, the log - likelihood function for the carrier frequency offset , ( ) is the logarithmof the probability density function f ( | ) . ( ) = log f ( | ) N 1 = log f (r (k ), r (2 N 1 k )) k =0 = log( f (r (k ), r (2 N 1 k )))
k =0 N 1
56

The 2 D complex - valued Guassian distribution f (r (k ), r (2 N 1 k ) ) = r (k ) 2 2 Re e j 2 ( 2 N 1 2 k ) / N r (k )r * (2 N 1 k ) + r (2 N 1 k ) 2 exp 2 2 2 s + n 1 2 2 2 s2 + n 1 2
)( )(
) )
where
E r (k ) E r (2 N 1 k )
2
E r (k )r * (2 N 1 k )
}{
}
2
}
57
s2 SNR = 2 = 2 s + n SNR + 1 s2 SNR = 2 n

N 1 k =0
N r (k )r * (2 N 1 k ) angle r (k )r * (2 N 1 k ) (2 N 1 2k ) 2 r (k )r * (2 N 1 k ) (2 N 1 2k )
k =0 N 1 2
In order to make the proposed tracking algorithm work correctly, angle r (k )r * (2 N 1 k ) < for each k [0, N 1] should satisfied, i.e., the tracking range is ( N /(2(2 N 1))) subcarrier spacing.
58
The Cramer - Rao lower bound is N 3N Var e | < 2(2 N 1) 4 2 (4 N 2 1) SNR
59


60
Non-data-aided Method (Exploiting second order cyclostationarity)
The discrete - time baseband equivalent OFDM signal transmitted through a frequency - selective fading channel is given by y[n] = h[m]x[n m]
m =0 L 1
where h[n] is the impulse response of channel, L is channel order.
61
The transmitted signal x[n] is x[n] = ck ,l g[n lP ]e

k = 0 l = N 1 j 2 kn N
where g[n] is the transmitter pulse shaping filter, N is the number of sub - carrier, ck ,l are the complex informatio n symbols.
62
At the receiver y[n] = y[n n ]e j ( 2 n + ) + w[n] where n is the integer - valued unknown arrival time of a symbol,
is the frequency offset, is the initial phase.
63
The following assumptions are hold in this paper : 1. ck ,l is a zero - mean independen tly identicall y distributed(i.i.d.) sequence with values drawn from a finite - alphabet complex constellation, with variance c2 . 2. For 0 n L 1, each h[n] is zero - mean independen t gaussian
2 random variable with variance h[ n ] .
3. x[n] is uncorrelated with h[n] and w[n].
64
The goal of synchronization is to estimate n and . The proposed algorithm is based on cyclostationarity of the receiver OFDM signal caused by pulse shaping filter.
65
ry [n; ] = E y[n] y *[n ] =

m =0 L 1 2 h[ m ]
}
N 1 k =0 j 2 k N
j 2
c2 e
g [n lP ]g *[n lP ] + rw [ ]
l =
= ry [n + kP; ] where g [n] = g[n n ]

66

For a fixed , ry [n; ] is periodic in n with period P. Thus, the cyclic correlation turns out to be 1 L-1 2 j 2 R y [ k ; ] = h[ m ] e [ ] P m =0
n =
g [n]g *[n + ]e
N 1 k =0 j 2 k N
2 kn P
+ rw [ ] [k ]
where [ ] = e
67
Using Parseval's theorem

n =
g [n]g *[n + ]e =e
j 2 12 k n P
2 kn P
where G ( ) denotes Fourier transform of g[n].
k G * G ( )e j 2 d 2 P 1
68

12 1 2
Let G2 (k ; ) =
G * ( k P )G ( )e j 2 d .
2
Then cyclic correlation is expressed as

kn j 1 L 1 2 j 2 2 P R y [ k ; ] = h[ m ] e c [ ] G2 (k ; )e + rw [ ] [k ] P m =0 where G ( ) denotes Fourier transform of g[n].
Upon defining
M [k ; ] = G2 1 (k ; ) R y [k ; ] kn j 1 L 1 2 j 2 2 P = h[ m ] e c [ ]e + G2 1 (k ; )rw [ ] [k ] P m =0 2
69
Consider the case only k 0. For = 0, we can retrieve n from the phase of cyclic correlation 1 arg[M [k ;0]] for k > 0 2 k P Given timing offset n , the frequency offset can be derived as n =
k j 2 n 1 P = arg M [k ; N ] e 2N
Timing offset and frequency offset appear as the phase of cyclic correlation, and the impluse response of channel h[n] does not affect the phase of cyclic correlation.
70
Since we can not have access to ensemble cyclic quantity, we should estimate it from finite data samples. We obtain R [k ; ] from data set
y I {y[n]}n10 . If number of data I is large enough, Ry [k ; ] would be asymptotically =
unbiased and consistent in mean square sense, i.e. lim R [k ; ] R [k ; ].

I y y
71
The effect of imperfection of cyclic correlatio n can be potentially reduced average. The estimator is obtained by 1 1 Q 1 arg M [k ;0] n = 2 k P Q q =0
for k > 0
k j 2 n 1 1 Q 1 P = arg M [k ; N ] e 2N Q q =0
Thus, we can observe that the number of average, Q, increases the complexity of the estimator. Large Q makes more reliable estimation.
72
Reference
1) J.J. van de Beek, M. Sandell and P. O. Brjesson, ML
estimation of time and frequency offset in OFDM systems, IEEE Trans. Signal Processing, vol. 45, no. 7, pp. 1800-1805, July 1997. 2) B. Chen, H. Wang, Blind OFDM carrier frequency offset estimation via oversampling, 2001 IEEE, vol. 2, pp. 1465 1469, Nov. 2001. 3) Z. Zhang, M. Zhao, H. Zhou, Y. Liu, J. Gao, Frequency offset estimation with fast acquisition in OFDM system, IEEE Communications Letters, vol. 8, no. 3, pp. 171 173, Mar. 2004. 4) B. Park, H. Cheon, E. Ko, C. Kang, D. Hong, A blind OFDM synchronization algorithm based on cyclic correlation, IEEE Signal Processing Letters, vol. 11, no. 2, pp. 83 85, Feb. 73 2004.
74

OFDM Synchronization: Speaker: 官雯彗

Загружено:

Сведения о документе

Исходное описание:

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

OFDM Synchronization: Speaker: 官雯彗

Загружено:

Авторское право:

Доступные форматы

OFDM Synchronization

Wireless Access Tech. Lab.

Joint Symbol and Frequency Synchronization

Wireless Access Tech. Lab.

OFDM System Block

Wireless Access Tech. Lab.

OFDM System Description

Wireless Access Tech. Lab.

0 0 0 WN 0 WN 1 WN 2 1 1 1 WN0 WN1 WN2 W= ( N 1)0 ( ( WN N 1)1 WN N 1)2 WN

CCU Wireless Access Tech. Lab.

Wireless Access Tech. Lab.

OFDM System Description Synchronization

Joint Symbol and Frequency Synchronization

Wireless Access Tech. Lab.

CCU Wireless Access Tech. Lab.

Wireless Access Tech. Lab.

where is initial phase,

Wireless Access Tech. Lab.

CP ith OFDM symbol CP

Corrert sampling, = 0, = 0, and wi ,k = 0 :

Wireless Access Tech. Lab.

CP ith OFDM symbol CP

Error sampling, = 0, = 0, wi ,k = 0, a is an integer number :

0 0 WN ( N a ) WN ( N a +1) 1( N a ) 1 WN( N a +1) 0 WN ( ( WN ( N a )( N 1) WN N 1)( N a ) WN N 1)( N a +1)

Wireless Access Tech. Lab.

CP ith OFDM symbol CP

Error sampling, = 0, = 0, wi ,k = 0, a is an integer number :

xi ,a W W x i ,( N 1) W xi +1,( N CP ) ( N 1)( N 1) WN x i +1,( N CP + a )

Wireless Access Tech. Lab.

CP ith OFDM symbol CP

x[0] e j W 2 j + j N x[1] e W 2 j + j 2 W N x[2] e 2 ( j + j ( N 1) WN N 1)( N 1) x[ N 1] e N x[0] 0 WN ( N 1) 2 j 1( N 1) x[1] e N WN 2 2 j 2 WN ( N 1) x[2] e N 2 ( N 1)( N 1) j ( N 1) WN x[ N 1] e N

CCU Wireless Access Tech. Lab.

Wireless Access Tech. Lab.

Wireless Access Tech. Lab.

OFDM System Description Synchronization

Joint Symbol and Frequency Synchronization

Wireless Access Tech. Lab. Non-data-aided Method (Maximum likelihood)

and are timing shift and carrier frequency offset respectively,

Wireless Access Tech. Lab. Non-data-aided Method (Maximum likelihood)

Wireless Access Tech. Lab. Non-data-aided Method (Maximum likelihood)

r (k ) 2 2 Re e j 2 r (k )r * (k + N ) + r (k + N ) 2 exp 2 2 2 ( s + n )(1 ) f (r (k ), r (k + N ) ) = 2 2 2 2 ( s + n )(1 )

CCU Wireless Access Tech. Lab.

Wireless Access Tech. Lab. Non-data-aided Method (Maximum likelihood)

is the magnitude of the correlation coefficien t.

Wireless Access Tech. Lab. Non-data-aided Method (Maximum likelihood)

Wireless Access Tech. Lab.

OFDM System Description Synchronization

Joint Symbol and Frequency Synchronization

Wireless Access Tech. Lab. Non-data-aided Method (BPSK-OFDM case)

CCU Wireless Access Tech. Lab.

Wireless Access Tech. Lab. Non-data-aided Method (BPSK-OFDM case)

Thus, the symmetry characteristic in BPSK - OFDM symbol can be written as N si (k ) = s ( N k ) , k 0 or . 2

Wireless Access Tech. Lab. Non-data-aided Method (BPSK-OFDM case)

Because si (k ) = si* ( N k ) when k 0 or si (0) Ai , 0 e si (k ) Ai ,k e

where Ai ,k and i ,k denote the magnitude and the phase of si (k ) respectively.

Wireless Access Tech. Lab. Non-data-aided Method (BPSK-OFDM case)

The received signal is ri (k ) = vi (k ) + wi (k ) vi (k ) = si (k )e

where is timing shift,

is initial phase, is carrier frequency offset,

si (k ) presents kth sample of ith OFDM symbol,

Wireless Access Tech. Lab. Non-data-aided Method (BPSK-OFDM case)

The cost function f {C } is