# OFDM pilot allocation for sparse channel estimation

- Pooria Pakrooh
^{1}Email author, - Arash Amini
^{2}and - Farokh Marvasti
^{2}

**2012**:59

**DOI: **10.1186/1687-6180-2012-59

© Pakrooh et al; licensee Springer. 2012

**Received: **4 October 2011

**Accepted: **8 March 2012

**Published: **8 March 2012

## Abstract

In communication systems, efficient use of the spectrum is an indispensable concern. Recently the use of compressed sensing for the purpose of estimating orthogonal frequency division multiplexing (OFDM) sparse multipath channels has been proposed to decrease the transmitted overhead in form of the pilot subcarriers which are essential for channel estimation. In this article, we investigate the problem of deterministic pilot allocation in OFDM systems. The method is based on minimizing the coherence of the submatrix of the unitary discrete fourier transform (DFT) matrix associated with the pilot subcarriers. Unlike the usual case of equidistant pilot subcarriers, we show that non-uniform patterns based on cyclic difference sets are optimal. In cases where there are no difference sets, we perform a greedy method for finding a suboptimal solution. We also investigate the performance of the recovery methods such as orthogonal matching pursuit (OMP) and iterative method with adaptive thresholding (IMAT) for estimation of the channel taps.

## 1 Introduction

In wireless communications, orthogonal frequency division multiplexing (OFDM) is a well-known solution for overcoming the problem of multipath fading channels [1, 2]. However, this solution is effective only when the receiver is provided with tools to estimate the channel frequency response (CFR). To this end, the transmitter should send some predefined data in a predefined order that the receiver is a priori aware of. These predefined data are usually called pilots.

There are two main approaches for inserting pilot data in OFDM signals. In block-type pilots, all the subcarriers in some OFDM blocks (the whole spectrum) are reserved as pilot tones. In comb-type pilot models, some predefined subcarriers in each block serve as pilots. Hence, CFR at these subcarriers can be estimated using methods such as least square (LS) or minimum mean square error (MMSE). Now for estimating the CFR at non-pilot subcarriers, interpolation methods ranging from simple linear or second order techniques [3] to time domain [4] and even more complex approaches are used. It is clear that by decreasing the frequency gap between the adjacent pilot subcarriers, the performance of the interpolation techniques improves. Therefore, the pilots are preferably put at equidistant subcarriers to provide uniformity.

Considering the inherent sparsity in the impulse response of the wireless channels which is due to the sparse structure of the scattering objects, it is possible to estimate the channel impulse response (CIR) more accurately even from non-uniform pilot patterns. The common estimation techniques in this case are those introduced in the field of compressed sensing such as basis pursuit [5] and orthogonal matching pursuit (OMP) [6]. Unlike the interpolation case, equidistant pilot locations are not the best choices here. In [7], using the results of [5] for sparse signal recovery, it is mentioned that uniformly random pilot locations^{a} can provide the possibility of perfect channel reconstruction with overwhelming probability. Although this is an important theoretical result, it is not practical. In this article, we suggest a deterministic structure for the pilot locations in sparsity-based channel estimation methods which minimizes the inter-atom interference in discrete fourier transform (DFT) submatrices. Simulation results confirm the efficiency of the proposed pilot allocation method when greedy methods are used for channel estimation. Also, we propose an iterative thresholding method for channel estimation which results in appropriate performance in time-variant frequency selective OFDM channels.

## 2 Problem statement

*k*th subcarrier (1 ≤

*k ≤ N*) of the

*n*th OFDM frame can be formulated as:

*X*(

*n, k*) is the transmitted OFDM symbol,

*H*(

*n, k*) is the CFR and

*W*(

*n, k*) is the AWGN noise. If $\mathcal{P}$ denotes the set of all pilot indices, at a given pilot subcarriers ${k}_{p}\in \mathcal{P}$ and using the LS method, the CFR can be estimated as:

As explained earlier, conventional methods for estimation of the CFR at non-pilot subcarriers (given the noisy measurements at pilots) are interpolation-based techniques which require relatively high sampling rates (number of pilots) to produce acceptable mean squared error (MSE). Also, the optimum structure of the pilot locations for these techniques which minimizes the MSE of the estimated channel, is the uniform distribution (equidistance) of the pilots in the spectrum.

where **F**_{
p
}is the DFT submatrix with ${N}_{p}=\left|\mathcal{P}\right|$ rows associated with the pilot locations, ${\stackrel{\u0303}{\mathbf{H}}}_{p}$ is the vector of LS-estimated CFR at pilot locations, **h** is the sparse CIR vector, and **n**_{
p
}is the vector of noise values.

Generally, there are two main categories of sparsity-based methods to solve the set of equations presented in (3). One approach is to minimize the *ℓ*_{1} norm of **h** subject to (3), either directly or iteratively (such as SPGL [8]). Although the performance of such methods are considered among the bests, they are extremely slow for real-time implementation. The other approach which is considered in this article, is to use fast greedy methods such as OMP which iteratively detect and estimate the location and value of the channel taps. These methods are usually faster than *ℓ*_{1} minimization techniques by orders of magnitude while they may fall short of performance. Our simulation results confirm that their performance is acceptable for the purpose of OFDM channel estimation.

The main advantages of sparsity-based approaches can be categorized into two parts:

**(1) Decreasing MSE:** Generally, the purpose of using compressed sensing methods in solving a linear set of equations with the sparsity constraint is to achieve the Cramer Rao lower bound on MSE [9]. In extreme cases, the structured LS estimator [9] which knows the location of nonzero taps (support) through an oracle, and estimates their corresponding values using LS estimation is the best estimator. The MSE of this estimator is called CRB-S [9]. However, in general, there is no information about the location of the nonzero coefficients of **h** at the receiver and the structural LS estimator is not realizable. Simulation results indicate that we can get close to this bound by using proper sparsity-based methods.

**(2) Reducing Overhead:** Although the pilot subcarriers occupy a fraction of the spectrum, they do not convey any data. By reducing the number of pilot subcarriers, we increase the utilization efficiency of the spectrum while we may degrade the performance of the channel estimation block. As mentioned in [7], by considering the sparsity of the CIR, it is possible to capture the necessary information in the frequency domain in fewer number of pilots. The results in [5] show that *ℓ*_{1} minimization technique almost perfectly reconstructs the sparse CIR from (3) when the number of pilots is proportional to the number of channel taps. Furthermore, the reconstruction performance is independent of the location and value of the taps; i.e., unlike the interpolation-based methods, the number of required pilot subcarriers does not depend on the delay spread and degree of frequency selectivity of the channel.

## 3 Iterative thresholding method for sparse channel estimation

In this section, we propose an iterative method with adaptive thresholding (IMAT) [10] for the purpose of estimating the sparse CIR. In other words, we aim to identify non-zero channel taps and estimate their corresponding values using IMAT.

**h**from ${\stackrel{\u0303}{\mathbf{H}}}_{p}$ given the fact that

**h**has a few non-zero coefficients. To obtain an initial estimate, we multiply the sides of (3) by Moore-Penrose pseudo-inverse of

**F**

_{ p }to find the solution with minimum

*ℓ*

_{2}-norm:

*N*×

*N*non-negative matrix

**G**which is usually referred to as the distorting matrix, are given by:

**f**

_{ i }represents the

*i*th column of

**F**

_{ p }. If the columns of

**F**

_{ p }are orthogonal and there is no additive noise, ${\stackrel{\u0303}{\mathbf{h}}}_{0}$ will be a scaled version of

**h**; in general case where the columns are not orthogonal, ${\stackrel{\u0303}{\mathbf{h}}}_{0}$ is a distorted estimate of

**h**. Now through a series of iterations and by employing the sparsity constraint, we try to improve this estimate. In each iteration, we perform one step of the iterative method studied in [11] followed by a thresholding operator:

*k*are the relaxation parameter and the iteration number, respectively, $\mathbf{G}\cdot {\stackrel{\u0303}{\mathbf{h}}}_{k}$ is the output of the distorting operator to the input ${\stackrel{\u0303}{\mathbf{h}}}_{k}$ and ${\stackrel{\u0303}{\mathbf{h}}}_{0}$ is defined in (6). The steps (8) are known to compensate for the non-orthogonality of the columns of

**F**

_{ p }while the thresholding operator takes the sparsity constraint into account. We employ adaptive thresholds in (9) which can be tuned through the parameters

*α*and

*β*, and decrease exponentially with respect to the iteration number. The optimality of the exponential function in our method can be derived in a similar manner as in [12]. The block diagram of the proposed channel estimation method is shown in Figure 1.

In the proposed method, the ideal but unrealistic case would be when there is no distortion; i.e., when **G** is a scaled version of the identity matrix. Although this never happens, it shows that when **G** is a good-enough approximation of the identity matrix, we can expect satisfying results. Thus, a given set of pilot locations is considered as good if the off-diagonal elements of the matrix **G** are relatively small compared to the diagonal elements. In the following section, we will investigate the problem of selecting the DFT submatrix **F**_{
p
}which results in a suitable distorting matrix **G**.

## 4 Pilot allocation by minimizing the coherence in partial DFT matrices

As mentioned before, the performance of a channel estimation block depends on both the reconstruction technique and the set of pilot locations. In this section, we will study the sub-optimum pilot locations when greedy sparsity-based methods such as OMP and the introduced IMAT are employed.

### 4.1 Cyclic difference sets: minimum coherence

where **y** is the observed vector, **x** is an *s*-sparse vector (contains at most *s* non-zero elements) and **Φ** is an *m×n* (*m* ≪ *n*) measurement matrix which in our case is the partial DFT matrix formed by selecting *N*_{
p
} rows. In this section, we seek to find a proper location for pilots in each OFDM block, using the following definition.

**Definition 1:**The coherence of a measurement matrix

**Φ**∈ ℂ

^{ m×n }is the maximum absolute cross-correlation between the normalized columns:

Although the so called restricted isometry property (RIP) [5] is the best known tool for characterizing the performance of a given matrix **Φ** in sampling the sparse vectors, there is currently no polynomial time algorithm to check this property [13]. The common alternative for measuring how well a matrix preserves the information of the sparse vectors (**x**) in the produced samples (**y**) is the coherence; the smaller the better. In addition, the performance of the greedy methods is more influenced by the coherence of the measurement matrix rather than its RIP order [6]. One of the well-known results demonstrates that the sparsity-based methods such as *ℓ*_{1} minimization and greedy methods, are guaranteed to perfectly recover the *s*-sparse vectors when ${\mu}_{\Phi}<\frac{1}{2s}$[6].

**F**

_{ p }, becomes as small as possible. Considering the unit-norm property of the elements of

**F**

_{ p }, we have:

**F**

_{ p }becomes:

**F**

_{ P }, the inner product of

**f**

_{ l }and

**f**

_{ k }used in (12) only depend on

*r*=

*k - l*:

*f*(.) on the unit circle, instead of

*|f*(

*x*)

*|*it is simpler to work with

*|f*(

*x*)

*|*

^{2}=

*f*(

*x*)

*f**(

*x*)

*= f*(

*x*).

*f*(1

*/x*). This shows that the optimum set $\mathcal{P}$ which minimizes the coherence, is found by:

*a*

_{ d }denotes the number of repetitions of the number 0

*≤ d≤ N -*1 in the set $\mathcal{D}$, we have:

*g*(

*r*, {

*a*

_{ d }}) over all 1

*≤ r ≤ N*. Since

Hence, if there exists an index set $\mathcal{P}$ for which *a*_{1}*= ⋯ = a*_{
N
}_{-1} happens, it is for sure the best possible choice for minimizing the coherence. Such index sets are already known as cyclic difference sets [14]; unfortunately, the existence of difference sets are limited to some specific pairs (*N,N*_{
p
} ).

### 4.2 Greedy coherence minimization for improper pairs of *N* and *N*_{
p
}

Cyclic difference sets described in Section 4.1 are the optimal choices for the OFDM pilot locations with respect to the coherence criterion. In fact, if we make a DFT submatrix based on a cyclic difference set, the resultant matrix meets the Welch lower bound^{b}[15]. In other words, not only is such a submatrix optimum among all DFT submatrices of its size, but also is the optimum code-book in the sense of minimum coherence among all the matrices with the same size. Nevertheless, for many pairs of *N* and *N*_{
p
} , there is no cyclic difference set. Therefore we have to find proper indices for pilot allocation, using efficient search methods. In [16], it is suggested to use random exhaustive search among all $\left(\begin{array}{c}N\hfill \\ {N}_{p}\hfill \end{array}\right)$ DFT submatrices to find the one with the minimum coherence. As *N* increases, the cardinality of the search space grows exponentially and the results of the random search in relatively small steps might not be satisfactory. Here we propose a greedy method to find suitable pilot index set.

As stated in 4.1, it is important that the set of cyclic differences $\mathcal{D}$ of the set of pilot indices $\mathcal{P}$ has equal number of repetitions (*a*_{
d
} ) for its different elements; i.e., the variance of the set of repetitions {*a*_{
d
} }_{
d
}is equal to zero. In our greedy method, we choose *N*_{
p
} pilot indices in the following *N*_{
p
} stages: since rather than the exact value of the indices, their cyclic difference are important, we initialize the index set by ${\mathcal{P}}^{\left(1\right)}=\left\{1\right\}$ (1 is arbitrary). The rest of the stages are summarized in the following:

*i*th pilot index allocation:

- 1.Form all
*N*-*i +*1 possible*i*-element subsets by adding an element to ${\mathcal{P}}^{\left(i-1\right)}$:$\left\{{\mathcal{P}}^{\left(i\right)}\right\}=\left\{{\mathcal{P}}^{\left(i-1\right)}\cup s|s\phantom{\rule{0.3em}{0ex}}\in \left\{1,\dots ,N\right\}\backslash {\mathcal{P}}^{\left(i-1\right)}\right\}$(22) - 2.
For each

*i*-element set generated in step (1), form the set of cyclic differences and the set of repetitions ({*a*_{ d }}). - 3.
Choose the set (or one of the possible sets) with the minimum variance in the elements of the respective repetition set ({

*a*_{ d }}). - 4.
If

*i < N*_{ p }, go to step (1).

## 5 Simulation results

In order to give an insight toward theoretical results presented in Sections 3 and 4, we conduct several computer simulations using MATLAB. The simulations are presented in two parts:

### 5.1 IMAT method for sparse channel estimation results

Simulation parameters

Parameter | Specifications |
---|---|

Number of subcarriers | 256 |

Number of pilots | 16(6.25%) |

OFDM symbol duration | 224 ( |

Cyclic prefix length | 32(1 |

Fading channel parameters

Delay ( | 1.7 | 3.5 | 5.2 | 11.3 |
---|---|---|---|---|

Power (dB) | -2 | 0 | -5 | -7 |

### 5.2 Pilot allocation in sparsity-based estimation methods

*σ*

^{2}is the noise variance and

**F**

_{p,Λ}is the submatrix of

**F**

_{ p }obtained by keeping the columns corresponding to the channel taps. This lower bound is a fair criterion to measure the quality of our pilot allocation method, since it is the MSE of an estimator that knows the exact location of the channel taps. Therefore, in OMP channel estimation, if we select pilot locations properly, the maximum cross correlation between the columns of

**F**

_{ p }becomes small. Hence, the columns of the resultant measurement matrix in (3) become less correlated which makes it easier to detect and estimate the CIR. Similarly for IMAT, decrease in the off-diagonal elements of the distorting matrix results in the decrease of the MSE values of the estimated channel (Figure 5).

*N =*256 subcarriers and

*N*

_{ p }

*=*16 pilots. Since there is no cyclic difference set for this pair of

*N*and

*N*

_{ p }, we have employed the proposed greedy search in Section 4.2 to find a pattern for pilots with small coherence. The recovery percentage which is the percentage of exact channel recovery without error for various number of channel taps and OMP reconstruction method is presented in Figure 6.

## 6 Conclusion

In this article, we investigated the problem of OFDM pilot allocation in sparsity-based channel estimation methods. First, we proposed an IMAT which detects channel nonzero taps and their corresponding values iteratively for the purpose of OFDM channel estimation. As it was shown in the simulation results, this method outperforms typical interpolation methods such as Linear Interpolation and greedy algorithms in sparse channel estimation. We derived the optimum pilot location for greedy methods in sparse channel estimation, based on minimizing the coherence in DFT submatrices. Simulation results show the improvement in the MSE of the estimated channel for our proposed pilot allocation method compared to uniformly random insertion of pilots.

## Endnotes

^{a}That means all possible choices of pilot indices are equally likely. ^{b}In this article, we have used a different mathematical approach to prove the optimality of such a submatrix.

## Declarations

## Authors’ Affiliations

## References

*ETSI EN 302 304, Digital video broadcasting(dvb); transmission system for handheld terminals (dvb-h)*. 2004.*ETSI TS 102 428, Digital audio broadcasting(dab);dmb video service; user application specification*. 2005.- Hsieh M, Wei C: Channel estimation for OFDM systems based on comb-type pilot arrangement in frequency selective fading channels.
*IEEE Trans Consum Electron*1998, 44(1):1-5. 10.1109/30.663724View Article - Steele R:
*Mobile Radio Communications*. Pentech Press Limited, London, England; 1992. - Candes E, Romberg J, Tao T: Stable signal recovery from incomplete and inaccurate measurements.
*Comm Pure Appl Math*2006, 59: 1207-1223. 10.1002/cpa.20124MathSciNetView ArticleMATH - Tropp JA: Greed is good: algorithmic results for sparse approximation.
*IEEE Trans Inf Theory*2004, 50(10):2231-2242. 10.1109/TIT.2004.834793MathSciNetView ArticleMATH - Taubock G, Hlawatsch F: A compressed sensing technique for OFDM channel estimation in mobile environments: Exploiting channel sparsity for reducing pilots.
*IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2008, Las Vegas, NV*2008, 2885-2888.View Article - Figueiredo MAT, Nowak RD, Wright SJ: Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems.
*IEEE J Sel Top Signal Process*2007, 1(4):586-597.View Article - Carbonelli C, Vedantam S, Mitra U: Sparse channel estimation with zero tap detection.
*IEEE Trans Wirel Commun*2007, 6(5):1743-1763.View Article - Marvasti F, Amini A, Hadadi F, Soltanolkotabi M, Khalaj BH, Aldroubi A, Holm S, Sanei S, Chambers J:
*A unified approach to sparse signal processing*. 2009. [http://arxiv.org/abs/0902.1853] - Marvasti F:
*Nonuniform Sampling: Theory and Practice*. Kluwer Academic/Plenum Publishers, New York; 2001.View ArticleMATH - Soltanolkotabi M, Soltanalian M, Amini A, Marvasti F: A practical sparse channel estimation for current OFDM standards.
*International Conference on Telecommunications, 2009. ICT'09, Marrakech*2009, 217-222.View Article - Ben-Haim Z, Eldar YC, Elad M: Coherence-based near oracle performance guarantees.
*IEEE Trans Wirel Commun*2007, 6(5):1743-1763.View Article - Colbourn CJ, Dinitz JH:
*CRC Handbook of Combinatorial Designs*. CRC Press, Boca Raton, FL; 1996.View ArticleMATH - Xia P, Zhou S, Giannakis GB: Achieving the Welch bound with difference sets.
*IEEE Trans Inf Theory*2005, 51(5):1900-1907. 10.1109/TIT.2005.846411MathSciNetView ArticleMATH - Hochwald BM, Marzetta TL, Richardson TJ, Sweldens W, Urbanke R: Systematic design of unitary space-time constellations.
*IEEE Trans Inf Theory*2000, 46(6):1962-1973. 10.1109/18.868472View ArticleMATH

## Copyright

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.