A Fast LMMSE Channel Estimation Method for OFDM Systems

A fast linear minimum mean square error (LMMSE) channel estimation method has been proposed for Orthogonal Frequency Division Multiplexing (OFDM) systems. In comparison with the conventional LMMSE channel estimation, the proposed channel estimation method does not require the statistic knowledge of the channel in advance and avoids the inverse operation of a large dimension matrix by using the fast Fourier transform (FFT) operation. Therefore, the computational complexity can be reduced signiﬁcantly. The normalized mean square errors (NMSEs) of the proposed method and the conventional LMMSE estimation have been derived. Numerical results show that the NMSE of the proposed method is very close to that of the conventional LMMSE method, which is also veriﬁed by computer simulation. In addition, computer simulation shows that the performance of the proposed method is almost the same with that of the conventional LMMSE method in terms of bit error rate (BER).


Introduction
Orthogonal frequency division multiplexing (OFDM) is an efficient high data rate transmission technique for wireless communication [1].OFDM presents advantages of high spectrum efficiency, simple and efficient implementation by using the fast Fourier transform (FFT) and the inverse Fast Fourier Transform (IFFT), mitigation of intersymbol interference (ISI) by inserting cyclic prefix (CP), and robustness to frequency selective fading channel.Channel estimation plays an important part in OFDM systems.It can be employed for the purpose of detecting received signal, improving the capacity of orthogonal frequency division multiple access (OFDMA) systems by cross-layer design [2], and improving the system performance in terms of bit error rate (BER) [3][4][5].
1.1.Previous Work.The present channel estimation methods generally can be divided into two kinds.One kind is based on the pilots [6][7][8][9], and the other is blind channel estimation [10][11][12] which does not use pilots.Blind channel estimation methods avoid the use of pilots and have higher spectral efficiency.However, they often suffer from high computation complexity and low convergence speed since they often need a large amount of receiving data to obtain some statistical information such as cyclostationarity induced by the cyclic prefix.Therefore, blind channel estimation methods are not suitable for applications with fast varying fading channels.And most practical communication systems such as World Interoperability for Microwave Access (WIMAX) system adopt pilot assisted channel estimation, so this paper studies the first kind.
For the pilot-aided channel estimation methods, there are two classical pilot patterns, which are the block-type pattern and the comb-type pattern [4].The block-type refers to that the pilots are inserted into all the subcarriers of one OFDM symbol with a certain period.The blocktype can be adopted in slow fading channel, that is, the channel is stationary within a certain period of OFDM symbols.The comb-type refers to that the pilots are inserted at some specific subcarriers in each OFDM symbol.The comb-type is preferable in fast varying fading channels, that is, the channel varies over two adjacent OFDM symbols but remains stationary within one OFDM symbol.The comb-type pilot arrangement-based channel estimation has been shown as more applicable since it can track fast varying fading channels, compared with the block-type one [4,13].The channel estimation based on comb-type pilot arrangement is often performed by two steps.Firstly, it estimates the channel frequency response on all pilot subcarriers, by lease square (LS) method, LMMSE method, and so on.Secondly, it obtains the channel estimates on all subcarriers by interpolation, including data subcarriers and pilot subcarriers in one OFDM symbol.There are several interpolation methods including linear interpolation method, second-order polynomial interpolation method, and phase-compensated interpolation [4].
In [14], the linear minimum mean square error (LMMSE) channel estimation method based on channel autocorrelation matrix in frequency domain has been proposed.To reduce the computational complexity of LMMSE estimation, a low-rank approximation to LMMSE estimation has been proposed by singular value decomposition [6].The drawback of LMMSE channel estimation [6,14] is that it requires the knowledge of channel autocorrelation matrix in frequency domain and the signal to noise ratio (SNR).Though the system can be designed for fixed SNR and channel frequency autocorrelation matrix, the performance of the OFDM system will degrade significantly due to the mismatched system parameters.In [15], a channel estimation exploiting channel correlation both in time and frequency domain has been proposed.Similarly, it needs to know the channel autocorrelation matrix in frequency domain, the Doppler shift, and SNR in advance.Mismatched parameters of the Doppler shift and the delay spread will degrade the performance of the system [16].It is noted that the channel estimation methods proposed in [6,[14][15][16] can be adopted in either the block-type pilot pattern or the comb-type pilot pattern.
When the assumption that the channel is time-invariant within one OFDM symbol is not valid due to high Doppler shift or synchronization error, the intercarrier interference (ICI) has to be considered.Some channel estimation and signal detection methods have been proposed to compensate the ICI effect [17,18].In [17], a new equalization technique to suppress ICI in LMMSE sense has been proposed.Meanwhile, the authors reduced the complexity of channel estimator by using the energy distribution information of the channel frequency matrix.In [18], the authors proposed a new pilot pattern, that is, the grouped and equispaced pilot pattern and corresponding channel estimation and signal detection to suppress ICI.

Contributions.
In this paper, the OFDM system framework based on comb-type pilot arrangement is adopted, and we assume that the channel remains stationary within one OFDM symbol, and therefore there is no ICI effect.We propose a fast LMMSE channel estimation method.The proposed method has three advantages over the conventional LMMSE method.Firstly, the proposed method does not require the knowledge of channel autocorrelation matrix and SNR in advance but can achieve almost the same performance with the conventional LMMSE channel estimation in terms of the normalized mean square error (NMSE) of channel estimation and bit error rate (BER).Secondly, the proposed method needs only fast Fourier transform (FFT) operation instead of the inversion operation of a large dimensional matrix.Therefore, the computational complexity can be reduced significantly, compared with the conventional LMMSE method.Thirdly, the proposed method can track the changes of channel parameters, that is, the channel autocorrelation matrix and SNR.However, the conventional LMMSE method cannot track the channel.Once the channel parameters change, the performance of the conventional LMMSE method will degrade due to the parameter mismatch.
1.3.Organization.The paper is organized as follows.Section 2 describes the OFDM system model.Section 3 describes the proposed fast LMMSE channel estimation.We analyze the mean square error (MSE) of the proposed fast LMMSE channel estimation and the MSE of the conventional LMMSE channel estimation in Section 4. The simulation results and numerical results of the proposed algorithm are discussed in Section 5 followed by conclusion in Section 6.

System Model
The OFDM system model with pilot signal (i.e., training sequence) assisted is shown in Figure 1.For N subcarriers in the OFDM system, the transmitted signal x(i, n) in time domain after inverse Fast Fourier Transform (IFFT) is given by where X(i, k) denotes the transmitted signal in frequency domain at the kth subcarrier in the ith OFDM symbol.The comb-type pilot pattern [4] is adopted in this paper.The pilot subcarriers are equispaced inserted into each OFDM symbol.It is assumed that the number of the total pilot subcarriers is N p , and the inserting gap is R.Each OFDM symbol is composed of the pilot subcarriers and the data subcarriers.It is assumed that the index of the first pilot subcarrier is k 0 .Therefore, the set of the indeces of pilot subcarriers, η, can be written as where k 0 ∈ [0, R).The received signal Y (i, k) in frequency domain after FFT can be written as where W(i, k) denotes the AGWN with zero mean, and variance σ 2 w , H(i, k) is the frequency response of the radio channel at the kth subcarrier of the ith OFDM symbol.Then, the received pilot signal Y p (i, k) is extracted from Y (i, k) to perform channel estimation.As shown in Figure 2, the channel estimator firstly performs channel frequency response estimation at pilot subcarriers.There are some channel estimation methods for this part such as LS and LMMSE estimator [4].Next, once the channel frequency response estimation at pilot subcarriers, H p (i, k), is obtained, the estimator performs interpolation to obtain channel frequency response estimation at all subcarriers.There are linear interpolation method [4], second-order polynomial interpolation method [4], discrete Fourier transform-(DFT-) based interpolation method [19], and so on.In our system model, the linear interpolation method is adopted.After channel estimation, maximum likelihood detection is performed to obtain the estimated frequency signal X(i, k).The X(i, k) is given by where S ∈ s, and s is the set containing all constellation points, which depends on modulation method, that is, the signal mapper.For instance, if QPSK modulation is adopted, the set Finally, the estimated frequency signal X(i, k) passes through the signal demapper to obtain the received bit sequence.

Properties of the Channel Correlation Matrix in Frequency
Domain.The channel impulse response in time domain can be expressed as where h l (i) is the complex gain of the lth path in the ith OFDM symbol period, δ(•) is the Kronecker delta function, τ l is the delay of the lth path in unit of sample point, and L is the number of resolvable paths.Assume that different paths h l (i) are independent from each other and the power of the lth path is σ 2 l .The channel is normalized so that σ 2 h = l σ 2 l = 1.The channel response in frequency domain H(i, k) is the FFT of h(i, n), and it is given by where FFT N (•) denotes N points FFT operation.The channel autocorrelation matrix in frequency domain can be expressed as where E(•) denotes expectation.Denote the vector form of the channel autocorrelation matrix by R HH , and we have R HH = [R HH (i, j)] N×N .It is easy to find that the matrix R HH is a circulant matrix.Therefore, as in [20], the eigenvalues of R HH are given by The formula ( 8) can be equivalently written as We can easily obtain from ( 7) and ( 9) that the number of nonzero eigenvalues of R HH is equal to the total number of resolvable paths, L (see Appendix A).It is known by us that the rank of a square matrix is the number of its nonzero eigenvalues.Therefore the rank of R HH is L, and R HH is a singular matrix since L < N. The matrix R HH does not have the inverse matrix and has only the Moore-Penrose inverse matrix.However, the rank of the matrix R HH + σ 2 w I is N (see Appendix A), where I is an N by N identity matrix.Therefore, the matrix R HH + σ 2 w I is not singular and has the inverse matrix.

The Proposed Fast LMMSE Channel Estimation
denote the channel frequency response at pilot subcarriers of the ith OFDM symbol, and let denote the vector of received signal at pilot subcarriers of the ith OFDM symbol after FFT.Denote the pilot signal of the ith OFDM symbol by X p (i, j), j = 0, 1, . . ., N p − 1.The channel estimate at pilot subcarriers based on least square (LS) criterion is given by  The LMMSE estimator at pilot subcarriers is given by [6] where R HpHp is channel autocorrelation matrix at pilot subcarriers and is defined by R HpHp = E{H p H H p }, where (•) H denotes Hermitian transpose.It is easy to verify that the matrix R HpHp is circulant, the rank of R HpHp is equal to L, and the rank of R HpHp + σ 2 w I is equal to N p .The signalto-noise ratio (SNR) is defined by SNR = E|X p (k)| 2 /σ 2 w , and 2 is a constant depending on the signal constellation.For 16QAM modulation β = 17/9 and for QPSK and BPSK modulation β = 1.If the channel autocorrelation matrix R HpHp and SNR are known in advance, R HpHp (R HpHp + (β/SNR)I) −1 needs to be calculated only once.However, the autocorrelation matrix R HpHp and SNR are often unknown in advance and time varying.Therefore the LMMSE channel estimator becomes unavailable in practice.To solve the problem, we propose the fast LMMSE channel estimation algorithm.The algorithm can be divided into three steps.The first step is to obtain the estimate of channel autocorrelation matrices R HpHp and R HpHp .Firstly, we obtain the least square (LS) channel estimation at pilot subcarriers in time domain, h p.ls (i, k), and it is given by Secondly, the most significant taps (MSTs) algorithm [21] has been proposed to obtain the refined channel estimation in time domain.The MST algorithm deals with each OFDM symbol by reserving the most significant L paths in terms of power and setting the other taps to be zero.The algorithm can reduce the influence of AWGN and other interference significantly, compared with the LS method.However, the algorithm may choose the wrong paths and omit the right paths because of the influence of AWGN and other interference.Thus, we will improve the algorithm of [21] by processing several adjacent OFDM symbols jointly.We calculate the average power of each tap for N MST adjacent OFDM symbols, P LS (k), and it is given by Then we choose the L most significant taps from P LS (k) and reserve the indeces of them into a set α .Finally, the refined channel estimation in time domain, h p,MST , is given by Denote the first row of the matrix R HpHp by A. Then A can be given from ( 7) by where P MST is a 1 by N p vector with each entry Since the matrix R HpHp is circulant, R HpHp can be acquired by circle shift of A. The second step is to obtain the estimate of SNR.The estimate of SNR, SNR, is given by The third step is to obtain the estimate of the matrix We refer to the matrix R HpHp (R HpHp + (β/SNR)I) −1 as the LMMSE matrix in this paper.Since R HpHp is a circulant matrix and (R HpHp + (β/SNR)I) −1 is a circulant matrix, the product of R HpHp and (R HpHp + (β/SNR)I) −1 is also a circulant matrix.Therefore, we need only to compute the estimate of the first row of the LMMSE matrix.Denote the first row of LMMSE matrix by B. The estimate of B, B, is given by (see Appendix B)   The proposed fast LMMSE algorithm avoids the matrix inverse operation and can be very efficient since the algorithm only uses the FFT and circle shift operation.The proposed fast LMMSE algorithm can be summarized as follows.
Step 1. Obtain the LS channel estimation of pilot signal in time domain, h p.ls (i, k), by formula (14).
Step 2. Calculate the average power of each tap for N MST OFDM symbols, P LS (k), by formula (15).Then, we choose the L most significant taps from P LS (k) and reserve it as P MST (k), by formula (18).
Step 4. Obtain the estimate of the first row of the LMMSE matrix, B, by formula (20).
Step 5. Obtain the estimation of the LMMSE matrix, , by circle shift of B. Then, the channel estimation in frequency domain at pilot subcarriers can be obtained by formula (21).
It is noted that the estimation of the LMMSE matrix requires only N p points FFT operation and circle shifting operation, which reduce the computational complexity significantly compared with the conventional LMMSE estimator since it requires the inverse operation of a large dimension matrix.

Analysis of the Mean Square Error of the Proposed Fast LMMSE Algorithm
In this section, we will present the mean square error (MSE) of the proposed fast LMMSE algorithm.Firstly, we present   the MSE of LMMSE algorithm for comparison.We study two cases.One case is the MSE analysis for matched SNR, that is, the designed SNR is equal to the true SNR, and the other one is the MSE analysis for mismatched SNR.Secondly, we present the MSE of the proposed fast LMMSE algorithm.Similarly, we study two cases.One is for matched SNR, and the other is for mismatched SNR.

MSE Analysis of the Conventional LMMSE Algorithm.
Denote the MSE of LMMSE algorithm by ϕ MSE (SNR, SNR design ), where SNR is the true SNR, and SNR design is the designed SNR.
(i) MSE Analysis for Matched SNR.The MSE of LMMSE algorithm at pilot subcarriers for matched SNR can be derived as [22] ϕ MSE (SNR, SNR) where A is the first row of the matrix R HpHp, and (•) H denotes Hermitian transpose.
(ii) MSE Analysis for Mismatched SNR.The MSE of LMMSE algorithm on pilot subcarriers for mismatched SNR can be derived as [22] ϕ MSE SNR, SNR design where A is the first row of the matrix R HpHp , and (•) H denotes Hermitian transpose.

MSE Analysis for the
where γ(l) = (P MST (l))/(P MST (l) + (β/(N p SNR))), l = 0, 1, . . ., N p − 1.If the number of the chosen OFDM symbol to obtain the estimated average power for each tap, N MST , is large, we can replace γ(l) with E(γ(l)) in ( 24), then, (24) can be further derived as If the improved MST algorithm chooses L (L ≥ L) paths, where L is number of resolvable paths of the dispersive channel, and the chosen L paths contain all the L channel paths without omission, then ( 25) can be further written as  φ MSE (SNR, SNR) where τ l is the channel delay of the lth resolvable path, and σ 2 l is the power of the lth path, (ii) MSE for Mismatched SNR.Similarly, the MSE of the proposed fast LMMSE algorithm for mismatched SNR is given by where γ (l) = P MST (l)/(P MST (l) + (β/(N p SNR))), l = 0, 1, . . ., N p − 1. τ l is the channel delay of the lth resolvable path, and σ 2 l is the power of the lth path, It is noted that since the channel is assumed to be normalized, the MSE of the proposed fast LMMSE algorithm and the MSE of the conventional LMMSE are equal to their normalized mean square errors (NMSEs), respectively.In addition, for the sake of performance comparison between the above analysis of NMSE and the NMSE obtained by computer simulation, we define the NMSE obtained by simulation as follows:  where H p (i, j) denotes the channel estimate at the jth pilot subcarrier in the ith OFDM symbol, obtained by LMMSE algorithm or the proposed fast LMMSE algorithm, and K denotes the number of OFDM symbols in the simulation.

Numerical and Simulation Results
Both computer simulation and numerical method have been deployed to investigate the performance of the proposed fast LMMSE algorithm for channel estimation.In the simulation, we employ the channel model of COST207 [23] having 6 numbers of paths, that is, L = 6, and the maximum delay spread of 2.5 microseconds.The channel power intensity profile is listed in Table 1.The number of the subcarriers of the OFDM system, N, is equal to 2048, and the CP length is equal to 128 sample points.The bandwidth of the system is 20 MHz so that one OFDM symbol period T s = 102.4microseconds and the CP period T CP = 6.4 microseconds > 2.5 microseconds.The number of the total pilots N p is equal to 128, and the pilot gap R is 16.The transmitted signal is BPSK modulated, and the Doppler shift is 100 Hz.

Channel Autocorrelation Matrix under Different SNRs.
Figure 3 shows the magnitude of the first row of the channel autocorrelation matrix R HpHp , A. Since the channel autocorrelation matrix is circulant, it is enough to show the first row of the channel autocorrelation matrix.Observe that the magnitude of A varies approximately periodically, and the period is 13 pilot subcarriers.Since the channel power intensity profile is negative exponential distributed, the period of the first row of the channel autocorrelation matrix is decided by the delay of the second path.The delay of the second path is 0.5 microseconds, that is, 10 sample points.According to (7), the period is N p /τ 1 = 128/10 = 12.8.It is noted that the parameter N should be replaced by N p in (7).Therefore, the period is about 13, as shown in Figure 3. Figure 4 shows the magnitude of the first row of the LMMSE matrix R HpHp (R HpHp + (β/SNR)I) −1 with SNR of 5 dB, 10 dB, and 20 dB, respectively.Since the LMMSE matrix is also circulant, it is sufficient to depict the first row of the LMMSE matrix.Observe that the value of the first row of the LMMSE matrix is symmetry, and the center point is 64.The first row of the LMMSE matrix is approximately periodic, and the period is about 13 pilot subcarriers.Observe that the value of the first row of the LMMSE matrix varies insignificantly when SNR changes from 5 dB to 20 dB.In addition, the local maximum values of the curves correspond to strong correlation between pilot subcarriers, and the local minimum values correspond to weak correlation between pilot subcarriers.

Normalized Mean Square Error (NMSE) Comparison of Channel Estimation between LMMSE Algorithm and the
Proposed Fast LMMSE Algorithm.Figure 5 shows the NMSE of channel estimation of LMMSE algorithm versus that of the proposed fast LMMSE algorithm by computer simulation and numerical method, respectively.The numerical results of LMMSE algorithm and the proposed fast LMMSE algorithm are obtained by (22) and (26), respectively.The simulation results are obtained by (30).We replace H p in (30) with H p,LMMSE for LMMSE algorithm and replace H p with H p,fast LMMSE for the proposed LMMSE algorithm, respectively.For the proposed fast LMMSE algorithm, the number of OFDM symbols chosen to obtain the average power of each tap, N MST , is 20, and the number of chosen paths, L , is 10.The number of OFDM symbols in the simulation, K, is 5000, for both LMMSE algorithm and the proposed fast LMMSE algorithm.Observe that the NMSE of the proposed fast LMMSE algorithm is very close to that of LMMSE algorithm in theory over the SNR range from 0 dB to 25 dB.In addition, for LMMSE algorithm the numerical result is verified by the simulation.For the proposed fast LMMSE algorithm, the simulation result approaches the numerical result well, except that the simulation result is a little higher than the numerical result at low SNR.Observe that both the proposed fast LMMSE algorithm and LMMSE algorithm are superior to LS algorithm.For instance, the LMMSE algorithm has about 16 dB gain over the LS algorithm, at the same MSE over the SNR range from 0 dB to 25 dB.
Figure 6 shows the normalized mean square error (NMSE) of LMMSE algorithm with matched SNR and mismatched SNRs versus SNR, by simulation and numerical method, respectively.Firstly, we give a necessary illustration of the curves obtained by numerical method.For the curves with matched SNR, we use (22) to calculate the MSEs under different SNRs, by numerical method.For the curves with   mismatched SNRs, that is, designed SNRs, we use (23) to obtain the results, by numerical method.Secondly, for the curves with mismatched SNRs obtained by computer simulation, we use the designed SNR (predetermined and invariable) instead of the true SNR in (13) to obtain the channel estimation of pilot subcarriers.Observe that the analysis results are verified by computer simulation well, for the designed SNR of 5 dB, 10 dB, and 20 dB, respectively.For the case of the designed SNR of 5 dB, the MSE approaches the curve of matched SNR well within the range from 0 dB to about 10 dB.However, when the SNR increases, an MSE floor of about 2 × 10 −3 occurs.Similar trend can be found for the case of designed SNR of 10 dB.Observe that the curve of designed 20 dB approaches the curve with matched SNR well within the SNR range from 0 dB to 25 dB.Therefore, if we only know the channel autocorrelation matrix R HpHp and do not know the SNR, the above results suggest that we use a higher designed SNR in (13) when performing channel estimation.
Figure 7 shows the NMSE of the proposed fast LMMSE algorithm with matched SNR and mismatched SNRs versus SNR, by simulation and numerical method respectively.Firstly, we give a brief illustration of the curves obtained by numerical method.For the curve with matched SNR, we use (26) to obtain the results.For the curves with mismatched SNRs, that is, designed SNR, we use (28) to obtain the numerical results.To verify the numerical results, we perform computer simulation for each case with different designed SNR.In the computer simulation, step 3 in the proposed fast LMMSE algorithm is modified by letting the estimated SNR, SNR, be the designed SNR.For instance, if we choose the designed SNR to be 10 dB, SNR will be set to be 10 dB in step 3 of the proposed fast LMMSE algorithm instead of using formula (19) to obtain SNR.For the computer simulation, the number of OFDM symbols chosen to obtain the average power of each tap, N MST , is 20, and the number of chosen paths, L , is 10.The number of OFDM symbols in the simulation, K, is 5000.Observe that the analysis results are verified by computer simulation well, for the designed SNR of 5 dB, 10 dB, and 20 dB, respectively.For the case of the designed SNR of 5 dB, the MSE approaches the curve of matched SNR well within the range from 0 dB to about 10 dB.However, when the SNR increases, an MSE floor of about 2 × 10 −3 occurs.Similar trend can be found for the case of designed SNR of 10 dB.Observe that the curve of designed 20 dB approaches the curve of matched SNR well within the SNR range from 0 dB to 25 dB.

Bit Error Rate (BER) Comparison between LMMSE
Algorithm and the Proposed Fast LMMSE Algorithm.Figure 8 shows the BER of LS, LMMSE, the proposed fast LMMSE, and perfect channel estimation, respectively.We adopt linear interpolation to obtain the channel frequency response at all subcarriers after the channel frequency response at pilot subcarriers is obtained by LS, LMMSE, and the proposed fast LMMSE estimator.Once the channel frequency response is obtained, we use maximum likelihood detection to obtain the estimated signal X(i, k).In addition, the perfect channel estimation refers to that the channel frequency response is known by the receiver in advance.Observe that the BERs of LMMSE estimator is very close to that of the proposed fast LMMSE estimator over the SNR range from 0 dB to 25 dB.And they are about 1 dB worse than the perfect channel estimator, over the SNR ranging from 0 dB to 25 dB.The LMMSE estimator and the proposed LMMSE estimator are about 3-4 dB better than the LS estimator at the same BER over the SNR ranging from 0 dB to 25 dB.
Figure 9 shows the BER performance of the LMMSE channel estimation with matched SNR and the LMMSE channel estimation with designed SNRs.The LMMSE channel estimator with designed SNR refers to that we use a predetermined and unchanged SNR in (13) instead of the true SNR.Observe that the BERs of the LMMSE with designed SNR of 5 dB, 10 dB, and 20 dB are almost overlapped with each other within the lower SNR range from 0 dB to 15 dB.However, when SNR increases from 15 dB to 25 dB, the BER of the LMMSE estimator with higher designed SNR is better than that of the lower designed SNR.The results are consistent with the NMSEs in Figure 4. Therefore, a design for higher SNR is preferable as for mismatch in SNR.
Figure 10 shows the BER of the proposed fast LMMSE estimator with estimated SNR and the proposed fast LMMSE estimator with designed SNRs.It is noted that the proposed fast LMMSE estimator with estimated SNR refers to our proposed algorithm summarized in Section 3. The proposed fast LMMSE estimator with designed SNR refers to that we modify the step 3 of the proposed algorithm by using a predetermined and unchanged SNR instead of using formula (19) to obtain the estimated SNR. Observe that the BERs of the proposed fast LMMSE estimator with designed SNR of 5 dB, 10 dB, and 20 dB are almost overlapped with each other within the lower SNR range from 0 dB to 15 dB.However, when SNR increases from 15 dB to 25 dB, the BER of the proposed fast LMMSE estimator with higher designed SNR is better than that of the lower designed SNR.Thus, a design for higher SNR is preferable as for mismatch in SNR.

Conclusion
In this paper, a fast LMMSE channel estimation method has been proposed and thoroughly investigated for OFDM systems.Since the conventional LMMSE channel estimation requires the channel statistics, that is, the channel autocorrelation matrix in frequency domain and SNR, which are often unavailable in practical systems, the application of the conventional LMMSE channel estimation is limited.Our proposed method can efficiently estimate the channel autocorrelation matrix by the improved MST algorithm and calculate the LMMSE matrix by Kumar's fast algorithm and exploiting the property of the channel autocorrelation matrix so that the computation complexity can be reduced significantly.We present the MSE analysis for the proposed method and the conventional LMMSE method and investigate the MSE thoroughly under two cases, that is, the matched SNR and the mismatched SNR.Numerical results and computer simulation show that a design for higher SNR is preferable as for mismatch in SNR.

A.
In this appendix, we will prove that the rank of R HH is equal to L and the rank of R HH + σ 2 w I is equal to N. We can obtain from (7)

B.
In this appendix, we will show the derivation of (20).Kumar's fast algorithm can be summarized as follows.
Step 1. Compute N p points FFT of the vector C and we obtain Step 2. E can be obtained from (B.4) as Step 3. Denote the first row of the matrix ( R HpHp + (β/ SNR)I) by F, and F can be given by computing N p points IFFT of the vector E: (B.6) The above three steps can be combined as

Figure 2 :
Figure 2: Channel estimation based on comb-type pilots.
the first row of channel autocorrelation matrix

Figure 3 :
Figure 3: The first row of the channel autocorrelation matrix R HpHp , A.
the first row of the LMMSE matrix SNR = 5 dB SNR = 10 dB SNR = 20 dB

Figure 5 :
Figure 5: Normalized Mean square error (NMSE) of channel estimation of LMMSE algorithm versus that of the proposed fast LMMSE algorithm by computer simulation and numerical method.

Figure 6 :
Figure 6: NMSE of LMMSE algorithm with matched SNR and mismatched SNRs versus SNR, by simulation and numerical method, respectively.
proposed fast LMMSE, matched SNR, numerical method The proposed fast LMMSE, SNR design = 5 dB, numerical method The proposed fast LMMSE, SNR design = 10 dB, numerical method The proposed fast LMMSE, SNR design = 20 dB, numerical method The proposed fast LMMSE, SNR design = 5 dB, simulation The proposed fast LMMSE, SNR design = 10 dB, simulation The proposed fast LMMSE, SNR design = 20 dB, simulation

Figure 7 :
Figure 7: NMSE of the proposed fast LMMSE algorithm with matched SNR and mismatched SNRs versus SNR, by simulation and numerical method, respectively.

Figure 8 :
Figure 8: Bit error rate (BER) of the LS, LMMSE, the proposed fast LMMSE, and perfect channel estimation versus SNR.

Figure 9 :
Figure 9: BER comparison between LMMSE channel estimation with matched SNR and LMMSE channel estimation with designed SNRs.

Figure 10 :
Figure 10: BER comparison between the proposed fast LMMSE channel estimation with estimated SNR and the proposed fast LMMSE channel estimation with designed SNRs.

Table 1 :
Channel Power Intensity Profile.