The Tight Bound for the Number of Pilots in Channel Estimation for OFDM Systems

Coherent detection in OFDM systems requires accurate channel state information (CSI) at the receiver. Channel estimation based on pilot-symbol-assisted transmissions provides a reliable way to obtain CSI. Use of pilot symbols for channel estimation, introduces overhead and it is desirable to keep the number of pilot symbols as minimum as possible. This paper introduces a new tight bound for the number of pilots in channel estimation using adaptive scheme in OFDM systems. We calculate the minimum number of necessary pilots using two approaches. The first approach for the number of pilots is obtained based on Doppler frequency shift estimation and the second approach is acquired based on channel length estimation using second order statistics of received signal. Finally we obtain the tight bound for the number of pilots using attained values.


Introduction
Orthogonal frequency division multiplexing (OFDM) represents a valid choice for a variety of wireless applications since it has been shown to outperform single-carrier schemes especially in high data rate applications [1].To correctly demodulate the received data symbols, the channel estimation plays an important role to the system performance greatly.The most common technique to obtain channel information is via pilot aided channel estimation [2].Pilot symbols consume both power and spectrum and thus it is desirable to keep the number of pilot symbols as minimum as possible.Some approaches for reduction of pilot overhead were proposed in [3][4][5].On the other hand the spacing between pilot symbols should be small enough to make channel estimates reliable.Adaptive resource allocation in order to achieve a proper trade-off between utilized resources and quality of channel estimates based on CSI is necessary.Some authors discussed the number of used pilots in channel estimation and represent some methods for reduction them in OFDM systems.Authors in [6] use deviation of corresponding signals as a parameter to predict the channel characteristics in the transmitter end.They transmit fixed length of test signal to the channel whenever connection setup initiation takes place.Then by using the response, number of pilot signals to insert is determined and correspondingly appended to the data signal.Thus by vary-ing the number of pilots depending upon the channel environment, it certainly improves the channel estimation and reduction in number of pilots used for channel estimation and feedback.The proposed estimator in [7] employs a specific pilot structure which consists of two types of pilot symbols with different pilot density.The combination of interference alleviation and pilot rearrangement not only makes the channel estimation robust to the time selectivity of the channel but also reduces the number of pilot subcarriers needed to estimate the channel.Authors in [8] develop a method to obtain the optimal number of known pilot symbols for pilot-aided linear channel estimation in OFDM.They derive an expression for channel estimation error covariance from which performance measures can be numerically evaluated to obtain the optimal number of pilot symbols.In [9], the shortest preamble that attains a given mean square error in a sequence that under-samples the channel spectrum is found.A high mobile wireless channel is time-variant due to Doppler frequency shift.Then, the number of used pilots in channel estimation depends on the Doppler frequency shift.So, we represent a lower bound for the number of pilots based on it.Also, the number of used pilots depends on the length of channel.Thus, we evaluate channel length estimation problem for obtaining another lower bound for the number of pilots.Finally the tight bound is obtained.
The reminder of this paper is structured as follows: in Section 2 the system model is introduced.Bounds for number of used pilots in channel estimation are presented in Section 3. Some simulation results are given in Section 4 and finally Section 5 concludes the paper.

OFDM System Model
The basic building block for OFDM transceiver is shown in Figure 1.In an OFDM transmitter, at the nth symbol time, K data symbols , are converted into time-domain signals using the inverse fast Fourier transform (FFT).A cyclic prefix (CP) is inserted to preserve the orthogonality between the subcarriers and to eliminate the interference between the adjacent OFDM symbols.At the receiver, the CP is removed before the FFT process.Assuming the ideal synchronization at the receiver, the received symbol of the k th subcarrier at the n th symbol time can be represented by: where H[n,k] is the frequency response of the channel at the k th subcarrier and the n th symbol time, and Z[n,k] is the background noise, which can be approximated as zero-mean additive white Gaussian noise (AWGN) with variance z  [10].

Bounds for the Number of Pilots
We study the number of used pilots for channel estimation in OFDM systems, and achieve the bounds for it.
Here, we recall that unnecessary overhead is not desirable in terms of the resource allocation for the pilot signals.An appropriate pilot distribution is necessary using adaptive pilot allocation based on obtained bounds.

The First Lower Bound for the Number of Used Pilots in OFDM Systems
For proper channel estimation, it is necessary to sample channel according to the Nyquist theorem.The parameters of used in this section are listed in Table 1.Let us denote the spacing between pilot symbols in the time domain by t and in the frequency domain by N f N .The sampling theorem states that [11]: where d f and m  denote maximum Doppler frequency shift and maximum delay respectively.s T de-

N p
The number of pilot tones

N s
The number of OFDM symbols

K
The number of subcarriers notes the OFDM symbol duration and the carrier spacing, F  , is the spacing in the frequency domain.As illustrated in Figure 2, the transmitter sends pilot symbols scattered in the time and frequency domains in a regular pattern.Assuming that power spectrum density (PSD) of channel is based on jakes spectrum [12], d f can be estimated as follows: where 0 J is the 0 th order Bessel function of the first kind and   r n t  denotes the correlation function in the time domain.Also m  can be estimated with some approaches such as [13].The p N pilot tones are uni- formly inserted into OFDM block.p N is calculated as follows: where s N is the number of OFDM symbols in the time domain.
Using Equations ( 2) and ( 4), the first lower bound for the number of used pilots is obtained as follows:

The Second Lower Bound for the Number of Used Pilots in OFDM Systems
We assume that channel impulse response is as follows: ( where L is the length of channel.Authors in [14] proposed an algorithm for estimation of the channel length without the need of pilots based on the second-order statistics of the received signal.Here, we represent a terse description of it.Assuming an arbitrary positive integer N (N > L), we may construct an (N + 1) × 1 autocorrelation vector  r for the received signal such that:   where M denotes the sample size.Assume that the maximum lag N satisfies that N > L. A threshold  can be established as follows: where    is the parameter to be chosen and  is denotes as the start-terminal-coefficients-to-channelgain ratio, which is related to the detectable start and terminal channel coefficients, such that: The steps of proposed algorithm for channel length estimation in [14] are as follows: Step 1: Choose maximum lag N and sample size M. Set the threshold according to Equation ( 9).Step 2: Compute as given by Equation ( 7).Set .
Step 3: Compute (low detectability) are chosen.The performance of presented channel length estimation method is not sensitive to the values of the parameter θ and is robust over all kinds of constellations such as BPSK and QPSK.
To control the detectability, The following theorem states that, with knowing length of channel, we can have a bound for the number of pilots.
Theorem: assuming equi-spaced and equal power pilot tones with the number of pilot tones, , greater than or equal to the channel length, implies: 1) The covariance matrix of the channel estimation error , Σ, is a diagonal matrix.
2) If matrix Σ is diagonal, the MSEs of channel prediction are identical for all subcarriers.
3) Increasing the number of pilot tones greater than channel length will not enhance the performance of the channel predictor.
The proof of this theorem is given in [15].Then, we have: (11)

Adaptive Algorithm for Pilot-Aided Channel Estimation Based on Tight Bound
We rename right hand of inequalities ( 5) and ( 11), as follows: Thus, we have a tight bound for the number of necessary pilots for channel estimation in OFDM systems as follows: The receiver, after calculating the tight bound for the number of pilots, feeds these values back to the OFDM transmitter such that these values will be used in the next transmission period.By exploiting CSI, The proposed system minimizes the pilot overhead while maintaining desired channel estimation accuracy.In other words, receiver by consideration the tight bound for the number of necessary pilots and environment conditions, decide that how many pilots should be used for channel estimation.Figure 3 illustrates proposed adaptive algorithm for pilot aided channel estimation in the OFDM systems.

Simulation Results
In this section, we evaluate the performance of proposed adaptive algorithm for channel estimation.Simulation parameters are shown in Table 2.
BER vs. SNR curves with are shown in

N B
Figures 5 and 6 illustrate that adaptive pilot improves performance of OFDM system especially under high Doppler frequency shift.Figure 7 shows the bit error rate (BER) performance of the OFDM system with fixed pilots and adaptive pilots with and

Conclusion
In this paper, we drive a new tight bound for the number of used pilots in channel estimation for OFDM systems.This bound is fed back to the transmitter adaptively to improve the system performance with low pilot overhead compared to the conventional schemes.

Figure 2 .
Figure 2. Pilot symbols in the OFDM signals.
l by 1 and redo Step 3 until  .Step 4

Figure 3 .
Figure 3. Proposed OFDM system with adaptive scheme for number of used pilots.

Figure 4 .Figure 5 .
Figure 4.The adaptive pilot system based on the first lower bound is compared to fixed pilot system in Figures 5 and 6 in respectively.50, 150 Hz 

.
Channel estimation using fixed pilots is implemented in f d = 50 Hz.

Figure 6 ..
Figure 6.Performance improvement using adaptive resource allocation based on the first lower bound for the number of pilots, N 4   p sdsm KN f T F 

Figure 7 .
Figure 7. BER performance of the OFDM system with fixed pilots and adaptive pilots based on obtained tight bound with N p = B 1 and N p = B 2 .