# Carrier Frequency Offset Estimation for Multiuser MIMO OFDM Uplink Using CAZAC Sequences: Performance and Sequence Optimization

- Yan Wu
^{1}Email author, - J. W. M. Bergmans
^{1}and - Samir Attallah
^{2}

**2011**:570680

https://doi.org/10.1155/2011/570680

© Yan Wu et al. 2011

**Received: **12 November 2010

**Accepted: **15 February 2011

**Published: **10 March 2011

## Abstract

This paper studies carrier frequency offset (CFO) estimation in the uplink of multi-user multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems. Conventional maximum likelihood estimator requires computational complexity that increases exponentially with the number of users. To reduce the complexity, we propose a sub-optimal estimation algorithm using constant amplitude zero autocorrelation (CAZAC) training sequences. The complexity of the proposed algorithm increases only linearly with the number of users. In this algorithm, the different CFOs from different users destroy the orthogonality among training sequences and introduce multiple access interference (MAI), which causes an irreducible error floor in the CFO estimation. To reduce the effect of the MAI, we find the CAZAC sequence that maximizes the signal to interference ratio (SIR). The optimal training sequence is dependent on the CFOs of all users, which are unknown. To solve this problem, we propose a new cost function which closely approximates the SIR-based cost function for small CFO values and is independent of the actual CFOs. Computer simulations show that the error floor in the CFO estimation can be significantly reduced by using the optimal sequences found with the new cost function compared to a randomly chosen CAZAC sequence.

## 1. Introduction

Carrier frequency offset (CFO) is caused by the Doppler effect of the channel and the difference between the transmitter and receiver local oscillator (LO) frequencies. In OFDM systems, CFO destroys the orthogonality between subcarriers and causes intercarrier interference (ICI). To ensure good performance of OFDM systems, the CFO must be accurately estimated and compensated. For SISO-OFDM systems, periodic training sequences are used in [6, 7] to estimate the CFO. It is shown that these CFO estimators reach the Cramer-Rao bound (CRB) with low-computational complexity. A similar idea was extended to collocated MIMO-OFDM systems [8–10], where all the transmit antennas are driven by a centralized LO and so are all the receive antennas. In this case, the CFO is still a single parameter. For multiuser MIMO-OFDM systems, each user has its own LO, while the multiple antennas at the base-station (receiver) are driven by a centralized LO. Therefore, in the uplink, the receiver needs to estimate multiple CFO values for all the users. In [11, 12], methods were proposed to estimate multiple CFO values for MIMO systems in flat fading channels. In [13], a semiblind method was proposed to jointly estimate the CFO and channel for the uplink of multiuser MIMO-OFDM systems in frequency selective fading channels. An asymptotic Cramer-Rao bound for joint CFO and channel estimation in the uplink of MIMO-Orthogonal Frequency Division Multiple Access (OFDMA) system was derived in [14] and training strategies that minimize the asymptotic CRB were studied. In [15], a reduced-complexity CFO and channel estimator was proposed for the uplink of MIMO-OFDMA systems using an approximation of the ML cost function and a Newton search algorithm. It was also shown that the reduced-complexity method is asymptotically efficient. The joint CFO and channel estimation for multiuser MIMO-OFDM systems was studied in [16]. Training sequences that minimize the asymptotic CRB were also designed in [16].

Both Frank and Zadoff sequences and S&H sequences exist for sequence length of , where is the length of the sequence and is a positive integer, while Chu sequences exist for any integer length. For both Frank and Zadoff and Chu sequences, there are a finite number of sequences for each sequence length. Therefore, the optimal sequence can be obtained using a search among these sequences. However, for S&H sequences, there are infinitely many possible sequences. As the optimization problem for S&H sequences cannot be solved analytically, we resort to a numerical method to obtain a near-optimal solution. To this end, we use the adaptive simulated annealing (ASA) technique [21]. For small sequence lengths, for example, and , we are able to use exhaustive search to verify that the solution obtained using ASA is globally optimal. (Because CFO values are continuous variables, theoretically, it is not possible to obtain the exact optimum using exhaustive computer search, which works in discrete variables. If we keep the step size in the search small enough, we can be sure that the obtained "optimum" is very close to the actual optimum and can be practically assumed to the actual optimum. In this way, we are able to verify the solution obtained by the ASA is "practically" optimal.) Computer simulations were conducted to evaluate the performance of the CFO estimation using CAZAC sequences. We first compare the performance using CAZAC sequences with the performance using two other sequences with good correlation properties, namely, the IEEE 802.11n short training field (STF) [3] and the sequences [22]. The results show that the error floor using the CAZAC sequences is more than 10 times smaller compared to the other two sequences. Comparing the three classes of CAZAC sequences, we find that the performance of the Chu sequences is better than the Frank and Zadoff sequences due to the larger degree of freedom in the sequence construction. The S&H sequences have the largest number of degree of freedom in the construction of the CAZAC sequences. However, the simulation results show that they have only very marginal performance gain compared to the Chu sequences. This makes Chu sequences a good choice for practical implementation due to its simple construction and flexibility in sequence lengths. By using the identified optimal sequences, the error floor in the CFO estimation is significantly lower compared to using a randomly selected CAZAC sequence.

The rest of the paper is organized as follows. In Section 2, we present the system model and derive the ML estimator for the multiple CFO values. The sub-optimal CFO estimation algorithm using CAZAC sequences is proposed in Section 3. The training sequence optimization problem is formulated in Section 4 and methods are given to obtain the optimal training sequence. In Section 5, we present the computer simulation results and Section 6 concludes the paper.

## 2. System Model

where and superscript denotes vector transpose. The CFO matrix of user is denoted and is a diagonal matrix with diagonal elements equal to . We use to denote the transmitted signal matrix for the th user, which is an circulant matrix with the first column defined by . Here we assume so the channel vector between the th user and the th receive antenna is an vector by appending the channel impulse response vector with zeros.

with being the channel matrix for the th user. The noise matrix is given by .

and denotes the trace of a matrix. To obtain the ML estimate of the CFO vector , a search needs to be performed over the possible ranges of CFO values of all the users. The complexity of this search grows exponentially with the number of users and hence the search is not practical.

## 3. CAZAC Sequences for Multiple CFOs Estimation

where is the identity matrix of size . This means that is both a unitary (up to a normalization factor of ) and a circulant matrix.

Without loss of generality, we show how to estimate the CFO of the first user and the same procedure is applied to all the other users to estimate the other CFO values. Since same procedure is applied to all the users, the complexity of this CFO estimation method increases linearly with the number of users.

Because is a matrix resulting from cyclic shifting the identity matrix to the right by elements, produces a matrix resulting by cyclic shifting the rows of by elements downwards.

where denotes the angle of a complex number. The computational complexity of this estimator is low.

We can see that the interference power is a function of the training sequence , the channel delay power profile , and the CFO matrices .

## 4. Training Sequence Optimization

In the previous section, we showed that the multiple CFO values destroy the orthogonality among the training sequences of different users and introduces MAI. In this section, we study how to find the training sequence such that the signal to interference ratio (SIR) is maximized.

### 4.1. Cost Function Based on SIR

From the denominator of (23), we can see that the total interference power depends on the CFO values of all the other users. As a result, the optimal training sequence that maximizes the SIR is also dependent on for . In this case, even if we can find the optimal training sequences for different values of , we still do not know which one to choose during the actual transmission as the values are not available before transmission. This makes (23) an unpractical cost function.

where is the complement of , that is, is the last rows of the identity matrix.

From (27), we can see that the optimal training sequence depends on the power delay profile and the actual CFO value . The channel delay profile is an environment-dependent statistical property that does not change very frequently. Therefore, in practice, we can store a few training sequences for different typical power delay profiles at the transmitter and select the one that matches the actual channel delay profile. On the other hand, it is impossible to know the actual CFO in advance to select the optimal training sequence. In the following, we will propose a new cost function based on SIR approximation which can remove the dependency on the actual CFO in the optimization.

### 4.2. CFO Independent Cost Function

The advantage of (31) is that the optimization problem is independent of the actual CFO value as long as the value of is small enough to ensure the accuracy of the Taylor's series approximation in (28).

There are an infinite number of possible S&H sequences for each sequence length; it is impossible to use exhaustive computer search to obtain the optimal sequence. We resort to numerical methods and use the adaptive simulated annealing (ASA) method [21] to find a near-optimal sequence. To test the near-optimality of the sequence obtained using the ASA, for smaller sequence lengths of and , we use exhaustive computer search to obtain the globally optimal S&H sequence. The obtained sequence through computer search is consistent with the sequence obtained using ASA and this proves the effectiveness of the ASA in approaching the globally optimal sequence.

## 5. Simulation Results

where and represent the estimated and true CFO's, respectively, is the number of subcarriers, and denotes the total number of Monte Carlo trials.

From both Figures 4 and 5, we can see that the gain of using S&H sequences compared to Chu sequences is really small. Therefore, in practical implementation, it is better to use the Chu sequence because it is simple to generate and it is available for all sequence lengths. Another advantage of the Chu sequence is that the optimal Chu sequence obtained using cost function (31) is the same for the uniform power delay profile and some exponential power delay profiles we tested. Hence, a common optimal Chu sequence can be used for both channel PDP's. This is not the case for the S&H sequences.

## 6. Conclusions

In this paper, we studied the CFO estimation algorithm in the uplink of the multiuser MIMO-OFDM systems. We proposed a low-complexity sub-optimal CFO estimation methods using CAZAC sequences. The complexity of the proposed algorithm grows only linearly with the number of users. We showed that in this algorithm, multiple CFO values from multiple users cause MAI in the CFO estimation. To reduce such detrimental effect, we formulated an optimization problem based on the maximization of the SIR. However, the optimization problem is dependent on the actual CFO values which are not known in advance. To remove such dependency, we proposed a new cost function which closely approximate the SIR for small CFO values. Using the new cost function, we can obtain optimal training sequences for a different class of CAZAC sequences. Computer simulations show that the performance of the CFO estimation using CAZAC sequence is very close to the single-user CRB for low to medium SNR values. For high SNR, there is an error floor due to the MAI. By using the obtained optimal CAZAC sequence, such error floor can be significantly reduced compared to using a randomly chosen CAZAC sequence.

## Declarations

### Acknowledgment

The work presented in this paper was supported (in part) by the Dutch Technology Foundation STW under the project PREMISS. Parts of this work were presented at IEEE Wireless Communication and Networking conference (WCNC) April 2009.

## Authors’ Affiliations

## References

- Foschini GJ: Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas.
*Bell Labs Technical Journal*1996, 1(2):41-59.View ArticleGoogle Scholar - Telatar E: Capacity of multi-antenna Gaussian channels.
*European Transactions on Telecommunications*1999, 10(6):585-595. 10.1002/ett.4460100604View ArticleGoogle Scholar - IEEE P802.11n/D1.10 Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications: Enhancements for HigherThroughput IEEE Std., February 2007Google Scholar
- IEEE 802.16e: Air Interface for Fixed and Mobile Broadband Wireless Access Systems Amendment 2: Physical and Medium AccessControl Layers for Combined Fixed and Mobile Operation in Licensed Bands IEEE Std., 2006Google Scholar
- Dohler M, Lefranc E, Aghvami H: Virtual antenna arrays for future wireless mobile communication systems.
*Proceedings of the International Conference on Telecommunications (ICT '02), June 2002, Beijing, China*501-505.Google Scholar - Moose PH: Technique for orthogonal frequency division multiplexing frequency offset correction.
*IEEE Transactions on Communications*1994, 42(10):2908-2914. 10.1109/26.328961View ArticleGoogle Scholar - Schmidl TM, Cox DC: Robust frequency and timing synchronization for OFDM.
*IEEE Transactions on Communications*1997, 45(12):1613-1621. 10.1109/26.650240View ArticleGoogle Scholar - Mody AN, Stüber GL: Synchronization for MIMO OFDM systems.
*Proceedings of the IEEE Global Telecommunicatins Conference (GLOBECOM '01), November 2001*1: 509-513.View ArticleGoogle Scholar - Stuber GL, Barry JR, Mclaughlin SW, Li YE, Ingram MA, Pratt TG: Broadband MIMO-OFDM wireless communications.
*Proceedings of the IEEE*2004, 92(2):271-293. 10.1109/JPROC.2003.821912View ArticleGoogle Scholar - Van Zelst A, Schenk TC: Implementation of a MIMO OFDM-based wireless LAN system.
*IEEE Transactions on Signal Processing*2004, 52(2):483-494. 10.1109/TSP.2003.820989MathSciNetView ArticleGoogle Scholar - Besson O, Stoica P: On parameter estimation of MIMO flat-fading channels with frequency offsets.
*IEEE Transactions on Signal Processing*2003, 51(3):602-613. 10.1109/TSP.2002.808102MathSciNetView ArticleGoogle Scholar - Yao Y, Ng TS: Correlation-based frequency offset estimation in MIMO system.
*Proceedings of the 58th IEEE Vehicular Technology Conference (VTC '03), October 2003*1: 438-442.Google Scholar - Zeng Y, Leyman RA, Ng TS: Joint semiblind frequency offset and channel estimation for multiuser MIMO-OFDM uplink.
*IEEE Transactions on Communications*2007, 55(12):2270-2278.View ArticleGoogle Scholar - Sezginer S, Bianchi P, Hachem W: Asymptotic Cramér-Rao bounds and training design for uplink MIMO-OFDMA systems with frequency offsets.
*IEEE Transactions on Signal Processing*2007, 55(7):3606-3622.MathSciNetView ArticleGoogle Scholar - Sezginer S, Bianchi P: Asymptotically efficient reduced complexity frequency offset and channel estimators for uplink MIMO-OFDMA systems.
*IEEE Transactions on Signal Processing*2008, 56(3):964-979.MathSciNetView ArticleGoogle Scholar - Chen J, Wu YC, Ma S, Ng TS: Joint CFO and channel estimation for multiuser MIMO-OFDM systems with optimal training sequences.
*IEEE Transactions on Signal Processing*2008, 56(8):4008-4019.MathSciNetView ArticleGoogle Scholar - Morelli M, Mengali U: Carrier-frequency estimation for transmissions over selective channels.
*IEEE Transactions on Communications*2000, 48(9):1580-1589. 10.1109/26.870025View ArticleGoogle Scholar - Frank R, Zadoff S, Heimiller R: Phase shift pulse codes with good periodic correlation properties (corresp.).
*IRE Transactionson Information Theory*1962, 8(6):381-382. 10.1109/TIT.1962.1057786View ArticleGoogle Scholar - Chu DC: Polyphase codes with good periodic correlation properties.
*IEEE Transactions on Information Theory*1972, 18(4):531-532. 10.1109/TIT.1972.1054840MATHView ArticleGoogle Scholar - Sueshiro N, Hatori M: Modulatable orthogonal seqeuences and their application to SSMA systems.
*IEEE Transactions on Information Theory*1988, 34(1):93-100. 10.1109/18.2605View ArticleGoogle Scholar - Ingber L: Adaptive simulated annealing (ASA). Global optimization C-code, Caltech Alumni Association, Pasadena, Calif, USA, 1993, http://www.ingber.com
- Solomon S, Gong G:
*Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar*. Cambridge Univeristy Press, Cambridge, UK; 2005.Google Scholar - Yan W, Attallaht S, Bergmans JWM: Efficient training sequence for joint carrier frequency offset and channel estimation for MIMO-OFDM systems.
*Proceedings of the IEEE International Conference on Communications (ICC '07), June 2007*2604-2609.Google Scholar - Schenk TCW, Van Zelst A: Frequency synchronization for MIMO OFDM wireless LAN systems.
*Proceedings of the IEEE 58th Vehicular Technology Conference (VTC '03), October 2003*2: 781-785.Google Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.