Carrier frequency offset estimation for orthogonal frequency division multiplexing systems

Orthogonal frequency division multiplexing (OFDM) is an attractive modulation scheme used in wideband communications because it essentially transforms the frequency selective channel into a flat fading channel. Furthermore, the combination of multiple-input multiple-output (MIMO) signal processing and OFDM seems to be an ideal solution for supporting reliable high data rate transmission for future wireless communication systems. However, despite the great advantages OFDM systems offer, such systems present challenges of their own. One of the most important challenges is carrier frequency offset (CFO) estimation, which is crucial in building reliable wireless communication systems. In this thesis, we consider CFO estimation for the downlink and uplink OFDM systems. For the downlink channel, we focus on blind schemes where the cost functions are designed such that they exploit implicit properties associated with the transmitted signal where no training signal is required. By taking the unconditional maximum likelihood approach, we propose a virtual subcarrier based blind scheme for MIMO-OFDM systems in the presence of spatial correlation. We conclude that the presence of spatial correlation does not impact the CFO estimation significantly. We also propose a CFO estimator for OFDM systems with constant modulus signaling and extend it to MIMO-OFDM systems employing orthogonal space-time block coding. The curve fitting method is used which gives a closed-form expression for CFO estimation. Therefore, the proposed scheme provides an excellent trade-off between complexity and performance as compared to prominent existing estimation schemes. Furthermore, we design a blind CFO estimation scheme for differentially modulated OFDM systems based on the finite alphabet constraint. It can achieve better performance at high signal-to-noise ratios (SNRs) at the expense of some additional computational complexity as compared to the schemes based on the constant modulus constraint. The constrained Cramer-Rao lower bound (CRLB) is also derived for the blind estimation scheme. As for the uplink channel, which is a more challenging problem, we propose two training aided schemes. One is based on a scalar extended Kalman filter (EKF) and the other one is on the variable projection (VP) algorithm. For both schemes, we assume that the system uses an arbitrary subcarrier assignment scheme, which is more involved than the other two schemes, namely block and interleaved subcarrier assignment scheme. In the first scheme, to apply the scalar EKF algorithm, we represent the measurement equation as a function of a scalar state, i.e., each user's CFO, in lieu of a state vector which consists of both CFO and channel coefficients by replacing the unknown channel coefficients with a nonlinear function of CFO. This proposed scheme can achieve the CRLB at high SNR for two users with a complexity lower than that of the alternating-projection method. In the second scheme, the VP algorithm is used for CFO estimation which is followed with a robust minimum mean square error (MMSE) estimator for channel estimation. In the VP algorithm, the nonlinear least square cost function is optimized numerically by updating the CFOs and channel coefficients separately at each iteration. We demonstrate that this proposed scheme is superior to the existing methods in terms of convergence speed, computational complexity and estimation performance

Low Complexity Blind Equalization for OFDM Systems with General Constellations

This paper proposes a low-complexity algorithm for blind equalization of data in OFDM-based wireless systems with general constellations. The proposed algorithm is able to recover data even when the channel changes on a symbol-by-symbol basis, making it suitable for fast fading channels. The proposed algorithm does not require any statistical information of the channel and thus does not suffer from latency normally associated with blind methods. We also demonstrate how to reduce the complexity of the algorithm, which becomes especially low at high SNR. Specifically, we show that in the high SNR regime, the number of operations is of the order O(LN), where L is the cyclic prefix length and N is the total number of subcarriers. Simulation results confirm the favorable performance of our algorithm

Iterative Joint Channel Estimation and Multi-User Detection for Multiple-Antenna Aided OFDM Systems

Multiple-Input-Multiple-Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) systems have recently attracted substantial research interest. However, compared to Single-Input-Single-Output (SISO) systems, channel estimation in the MIMO scenario becomes more challenging, owing to the increased number of independent transmitter-receiver links to be estimated. In the context of the Bell LAyered Space-Time architecture (BLAST) or Space Division Multiple Access (SDMA) multi-user MIMO OFDM systems, none of the known channel estimation techniques allows the number of users to be higher than the number of receiver antennas, which is often referred to as a “rank-deficient” scenario, owing to the constraint imposed by the rank of the MIMO channel matrix. Against this background, in this paper we propose a new Genetic Algorithm (GA) assisted iterative Joint Channel Estimation and Multi-User Detection (GA-JCEMUD) approach for multi-user MIMO SDMA-OFDM systems, which provides an effective solution to the multi-user MIMO channel estimation problem in the above-mentioned rank-deficient scenario. Furthermore, the GAs invoked in the data detection literature can only provide a hard-decision output for the Forward Error Correction (FEC) or channel decoder, which inevitably limits the system’s achievable performance. By contrast, our proposed GA is capable of providing “soft” outputs and hence it becomes capable of achieving an improved performance with the aid of FEC decoders. A range of simulation results are provided to demonstrate the superiority of the proposed scheme. Index Terms—Channel estimation, genetic algorithm, multiple-input-multiple-output, multi-user detection, orthogonal frequency division multiplexing, space division multiple access

Subspace-Based Blind Channel Identification for Cyclic Prefix Systems Using Few Received Blocks

In this paper, a novel generalization of subspace-based blind channel identification methods in cyclic prefix (CP) systems is proposed. For the generalization, a new system parameter called repetition index is introduced whose value is unity for previously reported special cases. By choosing a repetition index larger than unity, the number of received blocks needed for blind identification is significantly reduced compared to all previously reported methods. This feature makes the method more realistic especially in wireless environments where the channel state is usually fast-varying. Given the number of received blocks available, the minimum value of repetition index is derived. Theoretical limit allows the proposed method to perform blind identification using only three received blocks in absence of noise. In practice, the number of received blocks needed to yield a satisfactory bit-error-rate (BER) performance is usually on the order of half the block size. Simulation results not only demonstrate the capability of the algorithm to perform blind identification using fewer received blocks, but also show that in some cases system performance can be improved by choosing a repetition index larger than needed. Simulation of the proposed method over time-varying channels clearly demonstrates the improvement over previously reported methods

New Blind Block Synchronization for Transceivers Using Redundant Precoders

This paper studies the blind block synchronization problem in block transmission systems using linear redundant precoders (LRP). Two commonly used LRP systems, namely, zero padding (ZP) and cyclic prefix (CP) systems, are considered in this paper. In particular, the block synchronization problem in CP systems is a broader version of timing synchronization problem in the popular orthogonal frequency division multiplexing (OFDM) systems. The proposed algorithms exploit the rank deficiency property of the matrix composed of received blocks when the block synchronization is perfect and use a parameter called repetition index which can be chosen as any positive integer. Theoretical results suggest advantages in blind block synchronization performances when using a large repetition index. Furthermore, unlike previously reported algorithms, which require a large amount of received data, the proposed methods, with properly chosen repetition indices, guarantee correct block synchronization in absence of noise using only two received blocks in ZP systems and three in CP systems. Computer simulations are conducted to evaluate the performances of the proposed algorithms and compare them with previously reported algorithms. Simulation results not only verify the capability of the proposed algorithms to work with limited received data but also show significant improvements in the block synchronization error rate performance of the proposed algorithms over previously reported algorithms

Multiuser MIMO-OFDM for Next-Generation Wireless Systems

This overview portrays the 40-year evolution of orthogonal frequency division multiplexing (OFDM) research. The amelioration of powerful multicarrier OFDM arrangements with multiple-input multiple-output (MIMO) systems has numerous benefits, which are detailed in this treatise. We continue by highlighting the limitations of conventional detection and channel estimation techniques designed for multiuser MIMO OFDM systems in the so-called rank-deficient scenarios, where the number of users supported or the number of transmit antennas employed exceeds the number of receiver antennas. This is often encountered in practice, unless we limit the number of users granted access in the base station’s or radio port’s coverage area. Following a historical perspective on the associated design problems and their state-of-the-art solutions, the second half of this treatise details a range of classic multiuser detectors (MUDs) designed for MIMO-OFDM systems and characterizes their achievable performance. A further section aims for identifying novel cutting-edge genetic algorithm (GA)-aided detector solutions, which have found numerous applications in wireless communications in recent years. In an effort to stimulate the cross pollination of ideas across the machine learning, optimization, signal processing, and wireless communications research communities, we will review the broadly applicable principles of various GA-assisted optimization techniques, which were recently proposed also for employment inmultiuser MIMO OFDM. In order to stimulate new research, we demonstrate that the family of GA-aided MUDs is capable of achieving a near-optimum performance at the cost of a significantly lower computational complexity than that imposed by their optimum maximum-likelihood (ML) MUD aided counterparts. The paper is concluded by outlining a range of future research options that may find their way into next-generation wireless systems