A low-complexity zero-forcing CFO compensation scheme for OFDMA uplink systems

Abstract

Similar to the conventional orthogonal frequencydivision multiplexing (OFDM) system, an OFDM multiple access (OFDMA) system will have a carrier frequency offset (CFO) problem. Since CFOs of all users are different, CFO compensation in the OFDMA uplink system is much more involved. A simple, yet efficient, method is the zero-forcing (ZF) compensation method. However, it involves an inverse of an <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i> times <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i> CFO-induced ICI matrix, where <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i> is the number of subcarriers. Thus, the complexity can become very high when <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i> is large, a case commonly seen in OFDMA systems. In this work, we propose a low-complexity ZF method to overcome the problem. The main idea is to use Newton's method to solve matrix inversion iteratively. We explore the structure of the CFOinduced ICI matrix and develop a method that can implement Newton's method with fast Fourier transforms (FFTs). As a result, the required computational complexity is significantly reduced from <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">O</i> ( <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i> <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> ) to <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">O</i> (2 <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i> log <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i> ). Simulations show that, with only three iterations, the proposed method can have similar performance to the direct ZF method.