 Research
 Open access
 Published:
Maximum likelihoodbased adaptive iteration algorithm design for joint CFO and channel estimation in MIMOOFDM systems
EURASIP Journal on Advances in Signal Processing volume 2021, Article number: 6 (2021)
Abstract
In this paper, we present a joint timevariant carrier frequency offset (CFO) and frequencyselective channel response estimation scheme for multiple inputmultiple outputorthogonal frequencydivision multiplexing (MIMOOFDM) systems for mobile users. The signal model of the MIMOOFDM system is introduced, and the joint estimator is derived according to the maximum likelihood criterion. The proposed algorithm can be separated into three major parts. In the first part of the proposed algorithm, an initial CFO is estimated using derotation, and the result is used to apply a frequencydomain equalizer. In the second part, an iterative method is employed to locate the fine frequency peak for better CFO estimation. An adaptive process is used in the third part of the proposed algorithm to obtain the updated CFO estimation and track parameter time variations, including the timevarying CFOs and timevarying channels. The computational complexity of the proposed algorithm is considerably lower than that of the maximum likelihoodbased grid search method. In a simulation, the mean squared error performance of the proposed algorithm was close to the CramerRao lower bound. The simulation results indicate that the proposed novel joint estimation algorithm provides a bit error rate performance close to that in the perfect channel estimation condition. The results also suggest that the proposed method has reliable tracking performance in Jakes’ channel models.
1 Introduction
Many researchers regard multiple input multiple output (MIMO) as a candidate technology for fifthgeneration mobile networks (5G). With spatial multiplexing, antennas transmit (TX) independent data streams simultaneously to improve the system throughput [1, 2]. With orthogonal frequencydivision multiplexing (OFDM), overlapping but orthogonal subchannels are introduced to convert a frequencyselective fading channel into a set of frequencyflat fading channels for easier equalization [3]. From another perspective, OFDM can resist intersymbol interference (ISI) by appending cyclic prefix (CP) samples in front of OFDM samples.
In the case of singleantenna OFDM systems or other multicarrier systems, three aspects should generally be managed: frequency synchronization, timing synchronization, and channel estimation. Multiple inputmultiple outputorthogonal frequencydivision multiplexing (MIMOOFDM) is extremely sensitive to frequency synchronization and channel estimation errors [4]. Carrier frequency offsets (CFOs) are induced by local oscillator mismatches between transmitters and receivers as well as Doppler shifts [5]. CFOs break subcarrier orthogonality, which results in intercarrier interference and the possible performance degradation of the system [6]. Compared with frequency synchronization and channel estimation, timing synchronization is less critical because CP insertion has some tolerance to timing errors [7]. In this paper, we assume the timing offsets are equal to zero and focus on frequency synchronization and channel estimation.
To achieve high transmission quality, a frequency offset must be estimated and compensated at the receiver [8]. The combined estimation of the channel and the frequency offset causes complex problems in MIMOOFDM systems due to the number of unknown parameters. In some estimation algorithms, CFO and channel estimations are treated separately by using different training sequences [9,10,11,12]. In these schemes, channel estimation is performed assuming zero CFO or frequency synchronization is achieved. However, such assumptions are rarely valid in practice with the presence of noise [9, 10].
In other schemes, to save bandwidth, joint estimation of the channel and frequency offset is attempted. A prohibitively high computational complexity is required to obtain maximum likelihood (ML) solutions for both the frequency offset and channel impulse response (CIR) [13]. These estimators in [3, 5,6,7, 9,10,11,12,13] are designed for singleinput singleoutput OFDM systems and not MIMOOFDM systems. In [14, 15], the channel estimation of MIMOOFDM systems was performed assuming no CFO imbalance or perfect frequency synchronization with the training sequences. In [16, 17], the proposed algorithms for CFO estimation were executed assuming an estimated channel and negligible channel effect. In [18], a method based on the alternating projection algorithm was proposed for ML synchronization and channel estimation in orthogonal frequencydivision multiple access uplink transmission. In [19,20,21,22,23], joint estimation algorithms have been proposed for time–frequency synchronization with channel identification in MIMOOFDM systems. However, all these algorithms have rather high complexity. In [24,25,26], an iterative method was used to reduce the complexity. However, in these schemes in [24,25,26], the CFO estimator must use point search, which may assume a search range with a small interval to achieve low complexity. Moreover, the methods presented in [18,19,20,21,22,23,24,25,26] do not provide the ability to track timevarying CFOs and timevarying channels simultaneously.
This paper discusses the problem of joint CFO and channel estimation in MIMOOFDM systems for mobile users, in which all subcarriers can be utilized simultaneously. The complexity of joint ML estimation through a grid search procedure motivated us to develop a new iteration algorithm [27] that can provide ML solutions for joint estimation problems in an iterative manner. The proposed algorithm can find the initial estimated CFO by employing a derotation algorithm and use this result as an initial value. It then uses the initial value to apply the frequencydomain equalizer and uses the derotation operation again for better estimation. Subsequently, an iterative method is adopted to improve estimation accuracy. To benchmark the performance of the proposed scheme, CramerRao lower bounds (CRBs) were derived for the CFO and the CIR. Finally, the CFO was estimated through a proposed parameterized adaptive process by tracking channels and CFOs simultaneously. The simulation results indicated the suitable performance of the proposed adaptive iteration estimator. The computational complexity of the proposed algorithm is lower than that of the grid searchbased method. Our contribution and new ideas are as follows: (a) a joint CFO and channel estimation in MIMOOFDM systems for mobile users, (b) a new iteration algorithm with lower complexity than the grid searchbased method, and (c) a newly designed mechanism with an adaptive mode to simultaneously track the timevarying CFOs and timevarying channels. Up to the present time, the proposed adaptive iteration algorithm is currently a stateofthe art approach for achieving nearoptimal performance for this joint CFO and channel estimation problem. To the best of our knowledge, in other studies such as [18,19,20,21,22,23,24,25,26], no report has investigated the joint CFO and channel estimation problem with simultaneous tracking of the timevarying CFOs and timevarying channels.
The remainder of this paper is organized as follows. Section 2 presents the system model. Section 3 describes the development of the adaptive iterative CFO estimation algorithm. Section 4 presents the simulation results, which indicate that the performance of the proposed algorithm is close to the CRBs. Finally, Section 5 reports the conclusions.
Notation: The superscripts(⋅)^{T}, (⋅)^{−1}, (⋅)^{H}, and diag(⋅)_{K × K} represent the transpose, inverse, Hermitian transpose, and K × K diagonal matrix, respectively. The K × K identity matrix is denoted by I_{K × K}.
2 System model
Consider a MIMOOFDM communication system with K subcarriers as well as N transmitting (TX) and M receiving (RX) antennas (Fig. 1).
The model of each transmitter structure of the MIMOOFDM system is illustrated in Fig. 2 [28].
At the jth transmitter, the preamble OFDM signal in the baseband time domain obtained after performing inverse discrete Fourier transform and CP insertion can be denoted as follows [29]:
where d(k) is the frequencydomain data symbol for each subcarrier (k = 0, 1, …, K) and N_{g} represents the CP samples of the OFDM symbol, which is used for ISI resistance. The discretetime composite CIR between the jth transmitter and the ith received antenna with L multipaths is represented as follows:
where h_{i, j}(l), l = 0, 1, …, L − 1 is the complex Gaussian gain of the lth multipath. We assume the complex CIR is timeinvariant over one OFDM symbol. Thus, the superposition of signals from all TX antennas plus noise is received at each RX antenna. Assume that all the received signals are downconverted to baseband with the same local oscillator centered at f_{c}. In the presence of CFO ε, the samples at the ith RX antenna can be represented as follows:
where v_{i}(m) is an additive white complex Gaussian distributed noise with a mean of 0 and variance of \( {\sigma}_{v_i}^2 \). Moreover, ε denotes the CFO normalized to the subcarrier spacing [5]. To avoid ISI, we assume that the timing offset is equal to 0 and that the number of multipaths (L) is smaller than the CP length.
According to (3), the received signal vector r_{i} = [y_{i}(0), y_{i}(1), …, y_{i}(K − 1)]^{Τ} at the i^{th} RX antenna can be used to rewrite the input–output relationship as follows:
where D(ε) = diag (1, e^{j2πε/K}, …, e^{j2π(K − 1)ε/K})_{K × K} is a diagonal CFO matrix, X_{j} is a K × L circular matrix formed by the j^{th} transmitted signal x_{j}(k), and v_{i} is a K × 1 noise vector that can be expressed using the covariance matrix \( {\sigma}_{v_i}^2{\mathbf{I}}_{K\times K} \). Then, we define two matrices X and h_{i} as follows:
Let D(ε)Xh_{i} = s_{i} and s_{i} = [s_{i}(0), …, s_{i}(K − 1)]^{T} so that the signaltonoise ratio (SNR) is defined [10] as follows:
where
3 Proposed joint CFO and channel iterative estimation algorithm
3.1 Receiver design
The processing diagram at the receiver for the proposed algorithm is displayed in Fig. 3.
In the common RX structure used in OFDM transmission, a frequencydomain equalizer is adopted to eliminate multipath interference. The coefficients of the equalizer are the results obtained through channel estimation. These results are fed back to the timedomain signal, and the steps are run again to obtain more accurate CFO estimates. The main idea is that the proposed algorithm combines the CFOs estimated in the previous processes as a rough estimated value for the followed iteration. Through smallstep iterative searching, we can find the maximum peak near the actual CFO as the finetuned estimate. Finally, the CFO adaptation process is performed using the final finetuned CFO estimate to improve the performance of the proposed estimator for tracking the timevarying parameters. The aforementioned are described in detail as the following text.
3.2 Initial CFO estimation
According to (4) and the Gaussian probability density function, the ML function can be written as follows:
Then, the loglikelihood function for two unknown parameters can be expressed as follows:
To evaluate the loglikelihood function in (9), the constant is eliminated to minimize the newly defined objective function, which is the second term of the loglikelihood function.
We can expand (10) and take the partial differentiation operator for h_{i}; then, let the firstorder derivative be equal to 0 to obtain \( {\tilde{\mathbf{h}}}_i \) as follows:
By substituting (11) into (10), for the purpose of minimizing the ML objective function (10), it becomes to maximize
The estimation of ε for the i^{th} RX antenna can be obtained as follows:
Equation (13) can be used to perform a grid search to find the optimal CFO. However, this process requires many computations and is thus difficult to implement. The projection matrix X(X^{H}X)^{−1}X^{H} is formed by the preamble signal per frame transmission. The projection matrix can be represented as follows:
The main diagonals of the X^{H}X matrix are realvalued and are denoted as R_{i}, i = 1,…, N·L. Its adjacent diagonals parallel to the main diagonals are denoted as C_{i, j}, i = 1,…, N·L, j = 1,…, N·L, i ≠ j, which represent conjugate symmetry on the other side parallel to the main diagonal. The matrix X(X^{H}X)^{−1}X^{H} has a similar structure.
where W_{i}, i = 1, …, K, are realvalued and E_{i, j}, i = 1, …, K, j = 1, …, K, i ≠ j, are complex valued and are the conjugate of E_{j, i}.
By substituting (15) into (13), the estimation of ε for the i^{th} RX antenna can be expressed as follows:
To find the maximum value for the estimation of ε, (16) can be separated into multiple terms. Because the first term in (16) is a fixed real value, we only consider the second part. In the second part, because the first term is a complex value caused by the frequency offset, we can derotate its phase to the real axis; thus, the frequency offset can be compensated to achieve a maximum real value. The frequency offsets of K terms for the ith RX antenna can be obtained as follows:
After finding the phase of each term of (17) associated with the maximum real value, we can average the phases of all the terms for each RX antenna and then use the calculated average values to obtain the initial CFO as follows:
3.3 Frequencydomain equalizer
The initial CFO performance degrades due to multipath interference and may not be accurate. Therefore, a frequencydomain equalizer is applied to overcome this problem and obtain a more accurate CFO. First, we utilize the initial CFO (18) to find the channel response (11). Second, we use the initial CFO to compensate the received signal, which is then transformed into the frequency domain. A frequencydomain equalizer is employed using the estimated channel response to cancel the multipath interference [30]. The aforementioned operations are expressed as follows:
If \( \tilde{\varepsilon}=\varepsilon \), we can rewrite the received signal (19) and transform it into the frequency domain as follows:
where H_{i, j} is a diagonal matrix that is the frequencydomain channel matrix. The term \( {\mathbf{H}}_{i,j}=\mathit{\operatorname{diag}}\left({\overline{\mathbf{h}}}_{i,j}\right),{\overline{\mathbf{h}}}_{i,j}={\left[{\overline{h}}_{i,j}(0),{\overline{h}}_{i,j}(1),\dots, {\overline{h}}_{i,j}\left(K1\right)\right]}^{\mathrm{H}} \) represents a K × 1 vector that includes the samples from the Kpoint discrete Fourier transform of the channel response, and s_{j} is the frequencydomain signal of the jth TX antennas. We can rewrite the signal received at all antennas over the kth subcarrier as follows:
where \( {\tilde{\mathbf{H}}}_k\in {\mathrm{\mathbb{C}}}^{M\times N} \) is the MIMO channel matrix over the kth subcarrier and \( {\tilde{\mathbf{s}}}_k\in {\mathrm{\mathbb{C}}}^{N\times 1} \) is the signal transmitted over the kth subcarrier. According to the signal at each subcarrier, we can equalize the compensated received signals as follows:
Subsequently, we can collect K consecutive samples and transform the equalized signals back into the time domain. The derotation method is then used again to calculate the more accurate CFO \( {\tilde{\varepsilon}}_e \).
In the following section, an iterative method is described. This method provides a refined estimate close to the CRB.
3.4 Smallstep iterative searching
The CFO estimation is refined using an iteration method. The CFO \( {\tilde{\varepsilon}}_e \) derived in the previous section is used as the initial main frequency estimate. Then, adjacent frequencies are selected near the initial main frequency as candidate frequencies. The next step is to substitute the main and candidate frequencies into (16) to evaluate the CFO values. The largest CFO function value is determined to identify the search direction (refer to Fig. 4, step 1). Subsequently, the frequency selected in the previous step becomes the new main frequency \( {\tilde{\varepsilon}}_m \). The fixedstep frequency Δf is added with the new main frequency \( {\tilde{\varepsilon}}_m \) to acquire its adjacent frequency, and the comparison is performed as before (refer to Fig. 4, steps 21 and 22). This iterative process continues until the function value of the main frequency in the evaluation is larger than that of its adjacent frequency (refer to Fig. 4, steps 2 and 3; e.g., the total number of iterations is 3). Finally, the maximum frequency peak ε_{f} is achieved in the region between the last main frequency and the last adjacent frequency (refer to Fig. 4, step 3).
However, the global maximum frequency peak may not be in the search region if the setting of a smallstep frequency is inappropriate. For instance, the CFO estimated with the iterative method would not be at the true frequency peak if the true global maximum frequency is in the previous range between the iterative main frequency and the iterative adjacent frequency (refer to Fig. 5, steps 2 and 3). Because the iterative adjacent frequency \( {\tilde{\varepsilon}}_{m_i}+\Delta f \) is larger than the iterative main frequency \( {\tilde{\varepsilon}}_{m_i} \), the maximum frequency is decided to be located at the righthand side of the iterative adjacent frequency. Therefore, the iteration continues until the result of the main frequency is larger than that of the adjacent frequency (refer to Fig. 5, steps 2–4). However, the peak of the maximum frequency is outside the final search range.
In the aforementioned circumstance, the method of reverse iterative searching is adopted. When the maximum value is at the boundary frequency, the search direction goes in the reverse side (refer Fig. 5, step 3). This process is reverse iterative searching. The maximum peak frequency is on the other side of the boundary frequency. The iterative reverse search method finally identifies the global maximum value (refer to Fig. 5, step 3). Illustrations of the iterative smallstepfrequency search process and reverse iterative search process are provided in Figs. 4 and 5, respectively. A large Δf can reduce the search time, and a small Δf can provide high estimation accuracy. Thus, a tradeoff is involved in the selection of the Δf value. Practically, an appropriate value is selected based on experimental trial and error results in operational environments and has correlation with SNRs.
3.5 Computational complexity and the procedure of the proposed method
We adopt the BigOh notation, which is a wellaccepted approach for analyzing the computational complexities of algorithms. The detailed analysis of the computational complexity is as follows. Note that K is the number of subcarriers and N and M are the numbers of TX and RX antennas, respectively. The proposed scheme comprises five major steps: (1) In step 1, Eqs. (17) and (18) are involved. Taking phase/angle operation may adopt CORDIC IP core, by configuring it to be an arctan mode, which requires a constant time. Therefore, the complexity is assumed to be O (1). The above steps are performed MK times in Eq. (18). Therefore, the computational complexity in step 1 is O (MK(K + 1)) = O(MK^{2}). (2) In step 2, Eq. (11) is computed. The term (X^{H}X)^{−1}X^{H} matrix in Eq. (11) is formed by the preamble signal per frame transmission so that the information of this matrix is treated as already known for both TX and RX. The components of the resultant matrix (X^{H}X)^{−1}X^{H} can be saved at RX. Therefore, the computational complexity of this matrix (X^{H}X)^{−1}X^{H} requires O (1) in Eq. (11). Here, we consider the worstcase scenario, where L equals the length of cyclic prefix (CP) samples of the OFDM symbol. The term D^{H}(ε)r_{i} has a computational complexity of O(K). Therefore, the product of (X^{H}X)^{−1}X^{H} and D^{H}(ε)r_{i} matrices has a computational complexity of O (KNL). The above operations are performed M times in Eq. (11). Therefore, the computational complexity in step 2 is O (M (K+ KNL)). (3) In step 3, the discrete Fourier transform of the channel response to form \( {\tilde{\mathbf{H}}}_k \) by using Fast Fourier Transform, FFT has a computational complexity of O (MNK log K). The \( {\tilde{\mathbf{H}}}_k^H{\tilde{\mathbf{H}}}_k \) matrix and its matrix inverse operation have a computational complexity of O (MN^{2}) and O (N^{3}), respectively. The calculation of the term \( {\tilde{\mathbf{H}}}_k^H{\tilde{\gamma}}_k \) has a computational complexity of O (NM). In addition, the matrix \( {\left({\tilde{\mathbf{H}}}_k^H{\tilde{\mathbf{H}}}_k\right)}^{1}{\tilde{\mathbf{H}}}_k^H{\tilde{\gamma}}_k \) has a computational complexity of O (N^{2}). These operations are performed K times in Eq. (22). Then, the operations in step 1 are followed with the computational complexity of O(MK^{2}). Therefore, the computational complexity in step 3 is O (MNKlogK + K(MN^{2}+ N^{3} + NM + N^{2}) + MK^{2}). (iv) In steps 4 and 5, the computational complexity of the carrier frequency offset searching process is evaluated by using (16). Let \( {\tilde{N}}_{\mathrm{iter}} \) be the total number of iterations for the convergence of the step frequency search process. The computational complexity in steps 4 and 5 is O (MK^{2}\( {\tilde{N}}_{\mathrm{iter}} \)). Similarly, let \( {\tilde{N}}_{\mathrm{grid}} \) be the number of the grid search points in the possible CFO range. The total computational complexity of the grid searchbased method can be achieved by O(MK^{2}\( {\tilde{N}}_{\mathrm{grid}} \)). Note that \( {\tilde{N}}_{\mathrm{grid}} \) >> K and \( {\tilde{N}}_{\mathrm{grid}} \) >> \( {\tilde{N}}_{\mathrm{iter}} \). For instance, if the normalized CFOs are located over [−0.5, 0.5], then the number of the grid searchbased method in this range would be \( {\tilde{N}}_{grid} \)= 10^{5} if the resolution of 10^{−5} is set.
The procedure of the proposed algorithms and the computational complexity are summarized in Tables 1 and 2, respectively.
3.6 Adaptive mode for tracking the time variations of parameters
According to the aforementioned described process, the CFO \( {\tilde{\varepsilon}}_{T=t} \) and CFO \( {\tilde{\varepsilon}}_{T=t+\Delta t} \) (CFO of the next time unit) are obtained (훥t can be the symbol time, slot duration, frame duration, or any other time unit in the transmission systems). The adjustment equation of the final CFO is updated with the coefficient μ as follows:
By substituting (23) into (11), the channel estimation in this adaptive mode is rewritten as follows:
4 Simulation
This section presents the simulation results and discusses the efficacy of the proposed schemes, including the iterative mode and adaptive tracking mode. The parameters common to both the iterative mode and adaptive tracking mode were as follows: M = 2, N = 2, K = 64, and the CP size N_{g} = 16. A preamble was inserted at the beginning of each transmitted signal per frame. The transmitted OFDM data symbols were modulated through quaternary phaseshift keying by using a threemultipath channel model, and estimations were made on the basis of the preamble. The delay profile for the multipaths is presented in Table 3. The channel gain of each multipath was randomly generated with a Gaussian distribution of variance 1. Equations (6) and (7) were used for the SNR calculation in the simulation. After the channel gain coefficients are generated, the noise power associated with the received signal power is generated for a particular SNR. A Δf value of 10^{−5} was adopted in the simulation. The results of 5000 Monte Carlo simulations were averaged for each SNR.
For the iterative mode, the normalized CFOs were randomly selected independently from the random variable and were uniformly distributed over [−0.5, 0.5]. The coefficients of the CIR were complex valued and generated independently from normally distributed random numbers.
Regarding the adaptive tracking mode, the coefficients of the CIR were generated using Jakes’ model, with the carrier frequency equaling 3.5GHz, which is to be adopted in 5G. Various velocities (v) produced a timevarying Doppler shift. The channel variations in Jakes’ model rely on the parameter of the maximum Doppler shift, which is determined by the carrier frequency and the mobile speed. Therefore, the change of the carrier frequency 푓_{표} to scrutinize other frequencies in the 5G band is equivalent to the change of the mobile speed with a larger value for the specified carrier frequency of 3.5 GHz. Simulations were performed for various mobile speeds.
In the case of channel estimation errors, \( \mathrm{E}\left({\left\Vert \hat{\mathbf{h}}\mathbf{h}\right\Vert}^2\right) \) was calculated and plotted using the sample averages. To obtain benchmarks for the performance evaluation, the lower bounds for the CFO and CIR in the iterative mode were derived using the Fisher information matrix based on (4), as in [31].
where r = [r_{1}, …, r_{M}]^{Τ}, h = [h_{1}, …, h_{M}]^{Τ};
where ⊗ denotes the Kronecker product. Moreover, the following equation is obtained:
Similarly, the CRB was obtained for the estimated \( \hat{\mathbf{h}} \) as follows:
where
4.1 Algorithm performance in the iterative mode
The mean squared error (MSE) performance of the proposed algorithm for CFO estimation in the iterative mode at different SNRs is revealed in Fig. 6. The performance of the proposed algorithm in the iterative mode was satisfactory and close to the CRB [refer to (26)].
The MSE performance of the proposed algorithm for channel estimation at different SNRs is illustrated in Fig. 7. Comparisons of the CRB [refer to (28)] and channel estimate with the estimates in the “perfect CFO estimation” condition, in which the CFOs are perfectly known, indicated that the proposed joint estimation algorithm provided satisfactory channel estimation performance.
In Fig. 8, the bit error rates (BERs) of the three schemes are illustrated as follows: (a) the “ideal channel” condition, which has perfect channel estimation and perfect CFO synchronization; (b) the “perfect CFO estimation with joint channel estimation” condition, in which CFOs are assumed to be known for estimating the CIR; and (c) “proposed joint CFO and channel estimation.” The results indicate that the BER performance of the joint estimation is nearly identical to that with ideal assumptions. The proposed algorithm not only has a considerably lower computational complexity than the grid searchbased method but also provides satisfactory performance, as revealed in Figs. 6, 7, and 8.
4.2 Algorithm performance in the adaptive tracking mode
The MSE performance of the proposed algorithm for CFO estimation in the adaptive mode at different SNRs is illustrated in Figs. 9, 10, and 11. To obtain intensive simulation results and the best MSE performance, the value of μ was selected as follows for various mobile speeds: (a) μ = 0.5 at v = 0 km/h in Fig. 9, (b) μ = 0.4998 at v = 60 km/h (the speed limit for automobiles in suburban areas) in Fig. 10, and (c) μ = 0.18 at v = 500 km/h (the average speed of highspeed rail, as defined for 5G) in Fig. 11. The μ values for various other mobile speeds are presented in Table 4. The adaptive mode was executed on a per frame basis. The frame duration 훥t was 1 ms. As expected, the simulation results indicated that the coefficient μ should be decreased when the velocity v increases. The estimated CFO \( {\tilde{\varepsilon}}_{T=t+\Delta t} \) of the next frame should have more weight than the estimated CFO \( {\tilde{\varepsilon}}_{T=t} \) when the time variation is faster. Therefore, the weighting of the parameterized equation [refer to (23)] tends toward the second term. As illustrated in Figs. 9 and 10, the performance of the proposed algorithm in the adaptive mode was superior to its performance in the iterative mode. As depicted in Fig. 11, the MSE performance of the proposed adaptive mode began to degrade at SNR = 24 dB due to high time variations, and μ was approximately selected. This phenomenon did not occur at low mobile speeds.
The MSE performance of the proposed algorithm for channel estimation in the adaptive mode is displayed in Figs. 12, 13, and 14. The value of the parameter μ is selected for various mobile speeds as: (a) μ = 0.5 at v = 0 km/h in Fig. 12, (b) μ = 0.4998 at v = 60 km/h in Fig. 13, and (c) μ = 0.18 at v = 500 km/h in Fig. 14, respectively, for the approximate best MSE performance. The results obtained with the proposed algorithm in the iteration mode and those obtained in the “perfect CFO estimation” condition were compared. The simulation results revealed that the performance obtained in the proposed adaptive mode was competitive with that obtained in the “perfect CFO estimation” condition (Figs. 9, 10, and 11).
Figures 15 and 16 display the BERs of the following three schemes: (1) the “ideal channel” condition, in which perfect channel estimation and CFO estimation are assumed; (2) the “perfect CFO estimation and joint channel estimation” condition, in which the CFOs are assumed to be known to estimate the CIR; and (3) the “proposed joint CFO and channel estimation” in the adaptive mode. To obtain the best BER performance, the values of μ were selected as follows: (a) μ = 0.4998 at v = 60 km/h in Fig. 15 and (b) μ = 0.18 at v = 500 km/h in Fig. 16. The results indicated that the proposed adaptive mode estimation offers a BER performance nearly identical to that obtained with ideal assumptions.
The tracking ability of the proposed adaptive mode was examined at v = 120 km/h (Fig. 17). The estimate was compared with a real timevarying CFO. The comparison indicated that the proposed algorithm can track a timevarying CFO in the adaptive mode. For a vehicle velocity of 120 km/h, the tracking results of the h_{11} are plotted in Fig. 18, where we select one of the channel gains in the illustration. The time variations of the channel were accurately tracked.
5 Conclusion
In this paper, we propose MLbased algorithms for joint CFO and channel estimation. The proposed methods provided fairly competitive performance to that of CRBs. Moreover, the proposed methods have a lower computational complexity than the grid searchbased method does. In addition, an adaptive mode is proposed to improve the algorithm performance. The adaptive method is used to obtain the weighted CFO; thus, the adaptive mode can enhance the performance of the original proposed algorithm and provide tracking capability for timevarying parameters. The parameter μ should be adjusted according to operational environments.
Availability of data and materials
The datasets generated during the current study are not publicly available but are available from the corresponding author on reasonable request.
Abbreviations
 CFO:

Carrier frequency offset
 MIMOOFDM:

Multiple input multiple outputorthogonal frequencydivision multiplexing
 MSE:

Mean squared error
 CRB:

CramerRao lower bound
 5G:

The fifthgeneration wireless networks
 ISI:

Intersymbol interference
 CP:

Cyclic prefix
 ML:

Maximum likelihood
 CIR:

Channel impulse response
 TX:

Transmit
 RX:

Receive
 IDFT:

Inverse discrete Fourier transform
 DFT:

Discrete Fourier transform
 SNR:

Signaltonoise ratio
 BER:

Bit error rate
References
T. Mao, Q. Wang, Z. Wang, S. Chen, Novel index modulation techniques: A survey. IEEE Commun. Surv. Tutor. 21, 315–348 (2019)
Y. Liu, X. Zhao, H. Zhou, Y. Zhang, T. Qiu, Lowcomplexity spectrum sensing for MIMO communication systems based on cyclostationarity. EURASIP J. Adv. Signal. Process. 2019, article id 29 (2019)
Y. Sheng, Z. Tan, G. Li, SingleCarrier Modulation with ML Equalization for LargeScale Antenna Systems over Rician Fading Channels (IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Florence, 2014)
L. Nasraoui, L.N. Atallah, M. Siala, Robust Synchronization Approach for MIMOOFDM Systems with SpaceTime Diversity (IEEE 81st Vehicular Technology Conference (VTC Spring), Glasgow, 2015)
A. Diliyanzah, R.P. Astuti, B. Syihabuddin, Dynamic CFO Reduction in Various Mobilities Based on Extended Kalman Filter for Broadband Wireless Access Technology (International Conference on Information Technology and Electrical Engineering (ICITEE) Conference, Yogyakarta, 2014)
A. Jhingan, L. Kansal, G.S. Gaba, F. Tubbal, S. Abulgasem, Performance Analysis of OFDM System Augmented with SC Diversity Combining Technique in Presence of CFO (12th International Conference on Telecommunication Systems, Services, and Applications (TSSA), Yogyakarta, 2018)
M.O. Pun, M. Morelli, C.C. Jay Kuo, Iterative detection and frequency synchronization for OFDMA uplink transmissions. IEEE Trans. Wirel. Commun. 6, 629–639 (2007)
G. Li, T. Li, M. Xu, X. Zha, Y. Xie, Sparse massive MIMOOFDM channel estimation based on compressed sensing over frequency offset environment. EURASIP J. Adv. Signal. Process. 2019, article id 31 (2019). https://doi.org/10.1186/s1363401906273
D. Bai, W. Nam, J. Lee, I. Kang, Comments on: "a technique for orthogonal frequency division multiplexing frequency offset correction". IEEE Trans. Commun. 61, 2109–2111 (2013)
A.J. Coulson, Maximum likelihood synchronization for OFDM using a pilot symbol: Algorithm. IEEE J. Sel. Areas. Commun. 19, 2486–2494 (2001)
J.J. van de Beek, O. Edfors, M. Sandell, On channel estimation in OFDM systems. Proc. Veh. Technol. Conf. 2, 815–819 (1995)
M. Morelli, U. Mengali, A comparison of pilotaided channel estimation methods for OFDM systems. IEEE Trans. Signal. Proc. 49, 3065–3073 (2001)
B.H. Fleury, M. Tschudin, R. Heddergott, D. Dahlhaus, K.I. Pedersen, Channel parameter estimation in mobile radio environments using the SAGE algorithm. IEEE J. Sel. Areas. Commun. 17, 434–450 (1999)
V.S. Hendre, M. Murugan, R.V. Jawale, Channel Residual Energy Based Combine Estimation of Imperfections of Receiver in MIMOOFDM System (International Conference on Pervasive Computing (ICPC), Pune, 2015)
F. Yang, P. Cai, H. Qian, X. Luo, Pilot contamination in massive MIMO induced by timing and frequency errors. IEEE Trans. Wirel. Commun. 17, 4477–4492 (2018)
A.K. Dutta, K.V.S. Hari, L. Hanzo, Minimumerrorprobability CFO estimation for multiuser MIMOOFDM systems. IEEE Trans. Veh. Technol. 64, 2804–2818 (2015)
S.H. Aswini, B.N.A. Lekshmi, S. Sekhar, S.S. Pillai, MIMOOFDM Frequency Offset Estimation for Rayleigh Fading Channels (First International Conference on Computational Systems and Communications (ICCSC), Trivandrum, 2014)
M.O. Pun, M. Morelli, CCJ, Kuo, maximumlikelihood synchronization and channel estimation for OFDMA uplink transmissions. IEEE Trans. Commun. 54, 726–736 (2006)
I. Ziskind, M. Wax, Maximum likelihood localization of multiple sources by alternating projection. IEEE Trans. Acoust. Speech Signal Process. 36, 1553–1560 (1998)
A. Saemi, V. Meghdadi, J.P. Cances, M.R. Zahabi, J.M. Dumas, ML TimeFrequency Synchronization for MIMOOFDM Systems in Unknown Frequency Selective Fading Channels (Proceedings of the IEEE International Symposium on Personal, Indoor and Mobile Radio Commun. (PIMRC), Helsinki, 2007), pp. 1–5
S. Salari, M. Ahmadian, M. Ardebilipour, J.P. Cances, V. Meghdadi, EMbased turbo receiver design for lowdensity paritycheckcoded MIMOOFDM systems with carrierfrequency offset. IET Commun. 2, 107–112 (2008)
X. Chen, A. Wolfgang, A. Zaidi, MIMOOFDM for Small Cell Backhaul in the Presence of Synchronization Errors and Phase Noise (IEEE International Conference on Communications Workshops (ICC Workshops), Paris, 2017)
B. Zhou, Q. Chen, F. Shen, Q. Ci, On the Joint Carrier Frequency Offset Estimation and Channel Tracking Limits for MIMOOFDM System over HighMobility Scenarios (IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Nanjing, 2016)
S. Salari, M. Ardebilipour, M. Ahmadian, Joint maximumlikelihood frequency offset and channel estimation for multipleinput multipleoutputorthogonal frequencydivision multiplexing systems. IET Commun. 2, 1069–1076 (2008)
S. Salari, M. Ahmadian, M. Ardebilipour, V. Meghdadi, J.P. Cances, MaximumLikelihood CarrierFrequency Synchronization and Channel Estimation for MIMOOFDM Systems (2007 Wireless Telecommunications Symposium, Pomona, 2007), pp. 1–5
S. Salari, M. Heydarzadeh, J.P. Cances, Joint MaximumLikelihood Frequency Synchronization and Channel Estimation in MIMOOFDM Systems with Timing Ambiguity (International Symposium on Wireless Communication Systems (ISWCS), Paris, 2012), pp. 954–958
S.H. Chiu, K.C. Fu, Y.F. Chen, A Modified Algorithm for Joint Frequency Offset and Channel Estimation in OFDM Systems (International Conference on Communications in China (ICCC), Xi'an, 2013)
M. Morelli, U. Mengali, Carrierfrequency estimation for transmissions over selective channels. IEEE Trans. Commun. 48, 1580–1589 (2000)
S. Ohno, E. Manasseh, M. Nakamoto, Preamble and pilot symbol design for channel estimation in OFDM systems with null subcarriers. EURASIP J. Wirel. Commun. Netw. 2011, article no. 2 (2011)
H. Hojatian, M.J. Omidi, H. SaeediSourck, A. Farhang, Joint CFO and Channel Estimation in OFDMBased Massive MIMO Systems (International Symposium on Telecommunications (IST), Tehran, 2016)
P. Ciblat, P. Bianchi, M. Ghogho, Training sequence optimization for joint channel and frequency offset estimation. IEEE Trans. Signal Process. 56, 3424–3436 (2008)
Acknowledgements
The authors would like to thank the editors and anonymous reviewers for their constructive comments and suggestions, which helped improve the manuscript. This work was supported in part by the Ministry of Science and Technology, Taiwan, under Grant MOST 108  2221  E  008  020  MY2 and in part by the Qualcomm Technologies, Inc., USA, under Grant No. SOW NAT435657.
Funding
This work was supported in part by the Ministry of Science and Technology, Taiwan, under Grant MOST 108  2221  E  008  020  MY2 and in part by the Qualcomm Technologies, Inc., USA, under grant No. SOW NAT435657.
Author information
Authors and Affiliations
Contributions
The algorithms proposed in this paper have been conceived by NH Cheng, KC Huang, YF Chen, and SM Tseng. YF Chen designed the experiments. NH Cheng and KC Huang performed the experiments and analyzed the results. NH Cheng, KC Huang, and YF Chen wrote the paper. The authors read and approved the final manuscript.
Authors’ information
NanHung Cheng received his BS degree in electronic engineering from the Chung Cheng Institute of Technology, National Defense University, Taiwan, in 2003 and received his MS degree from the Department of Communication Engineering, National Central University, Taoyuan, Taiwan, in 2008. He is currently pursuing PhD from the Department of Communication Engineering at National Central University and coadvised by the Department of Electronic Engineering at Chang Gung University. His current research areas include signal processing algorithm designs for wireless communication systems and ESD protection of HEMT devices.
KaiChieh Huang received his BS degree at the department of communication engineering from Yuan Ze University in 2016 and then got MS degree in communication engineering from National Central University in 2018. The area of his current research is about digital signal processing and algorithm designs for wireless communication systems.
YungFang Chen (S’95–M’98) received his BS degree in computer science and information engineering from National Taiwan University, Taipei, Taiwan, in 1990; received his MS degree in electrical engineering from the University of Maryland, College Park, in 1994; and obtained a PhD in electrical engineering from Purdue University, West Lafayette, IN, in 1998. From 1998 to 2000, he worked with the CDMA Radio Technology Performance Group in Lucent Technologies, Whippany, NJ. Since 2000, he has been a Professor in the Department of Communication Engineering, National Central University, Taoyuan, Taiwan. His research interests include resource management algorithm designs for communication systems and signal processing algorithm designs for wireless communication systems.
ShuMing Tseng received the B.S. degree from National Tsing Hua University (highest honors), Taiwan, and the M.S. and Ph.D. degrees from Purdue University, IN, USA, all in electrical engineering, in 1994, 1995, and 1999, respectively. He was with the Department of Electrical Engineering, Chang Gung University, Taiwan, from 1999 to 2001. Since 2001, he has been with the Department of Electronic Engineering, National Taipei University of Technology, Taiwan, where he has been a Professor since 2007. His research interests are MUMIMO, OFDMA, cross layer optimization for video transmission, jamming resiliency, NOMA for 5G, and network performance evaluation. He has published 39 SCI journal papers. He has served as an Editor for KSII Transactions on Internet and Information Systems, indexed in SCI, since 2013. He was on sabbatical and a visiting scholar with Department of Electrical and Computer Engineering, UC San Diego, USA, in the 2014–2015 academic year. He is listed in Marquis Who’s Who in World since 2006.
Corresponding author
Ethics declarations
Ethics approval and consent to participate
All data and procedures performed in this paper were in accordance with the ethical standards of research community. This paper does not contain any studies with human participants or animals performed by any of the authors.
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Cheng, NH., Huang, KC., Chen, YF. et al. Maximum likelihoodbased adaptive iteration algorithm design for joint CFO and channel estimation in MIMOOFDM systems. EURASIP J. Adv. Signal Process. 2021, 6 (2021). https://doi.org/10.1186/s13634020007115
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13634020007115