(IJCSIS) International Journal of Computer Science and Information Security,Vol.
Chu sequences possess good correlation properties which areessential in a variety of engineering applications such asestablishing synchronization, performing channel estimationand reducing peak-to-average power ratio. The use of thesesequences leads to better frequency offset estimation at eachtransmitting antenna under the assumption of perfect timingsynchronization.In the proposed method CFO is compensated in two stages,at first CFO correction is performed in an acquisition stage, but there will still be existing residual CFO that has to becompensated. To remove these CFO residuals a tracking stageis implanted.
The paper is organized as follows .Section
describes thesystem model. In section
frequency synchronization preamble structure is explained in conjunction with propertiesof Zadoff and Chu sequences. The proposed frequency offsetestimation algorithm is explained in section IV. System performance is evaluated through computer simulation insection V. Conclusion remarks are presented in section VI.
A general MIMO-OFDM system comprising
transmitter antennas and
receiver antennas is depicted in Fig. 1
Fig.1. MIMO-OFDM system block diagram
.The received signal on the
receive antenna is described inequation (1), supposing that time has been synchronizedcorrectly
l Ln jqt N ql ql
is the synchronization training sequencetransmitted on
is the AWGN on the
is the frequency offset factor,
is thelength of the training sequence, and
is the channel gain between the
transmit antenna and the
receive antenna .Inthe present study the same frequency offset for each transmitand receive antenna pair has been assumed .
The main contribution of the proposed frequencysynchronization algorithm is implementation of Zadoff andChu sequences as synchronization sequences. Both of thesesequences are considered as Constant Amplitude ZeroAutocorrelation (CAZAC) sequences. The proposed frequencysynchronization algorithm uses the good correlation propertyof CAZAC sequences. It is worthwhile to
mention thatcomplexity of polyphase and PN sequences could becompared using two different perspectives .First, a polyphasesequence in frequency domain is also a polyphase sequence intime domain, in other word Zadoff-Chu sequence is alsoZadoff-Chu sequence after FFT which can help even in theimplementation. Second, the frequency domain correlation of a PN sequence cannot give reliable sequence detection. Thus,keeping in mind the above mentioned comparison it has beendecided to choose polyphase sequences as the basic sequencein the proposed study.
Frank-Zadoff code sequence
It is defined as cyclic shifted orthogonal code with good periodic correlation properties for preamble sequences. Frank-Zadoff code was described as a more general form of another code introduced by Heimiller 
For a code sequence of length
}, the complex cyclic correlationfunction is defined as:
s s x
denotes the complex conjugate of
because it is a cyclic code.
= 0, the value of
(3)On the other hand, for
the values of
should bezero. That means each code is orthogonal to its own phaseshifted version.
The autocorrelation function of Chu sequences is known to be zero except at the lag of an integer multiple of the sequencelength. The length of Zadoff codes is restricted to perfectsquares. But, Chu sequences have the same correlation properties and can be constructed for any code length. A set of Chu sequence with length
is considered as
, 0 < n < L-1
, is defined as:
odd Leven L
Lk nk j Lnk j
20 http://sites.google.com/site/ijcsis/ISSN 1947-5500