# Low-complexity DOA estimation from short data snapshots for ULA systems using the annihilating filter technique

- 899 Downloads
- 1 Citations

## Abstract

This paper addresses the problem of DOA estimation using uniform linear array (ULA) antenna configurations. We propose a new low-cost method of multiple DOA estimation from very short data snapshots. The new estimator is based on the *annihilating filter* (AF) technique. It is non-data-aided (NDA) and does not impinge therefore on the whole throughput of the system. The noise components are assumed temporally and spatially white across the receiving antenna elements. The transmitted signals are also temporally and spatially white across the transmitting sources. The new method is compared in performance to the Cramér-Rao lower bound (CRLB), the root-MUSIC algorithm, the deterministic maximum likelihood estimator and another Bayesian method developed precisely for the single snapshot case. Simulations show that the new estimator performs well over a wide SNR range. Prominently, the main advantage of the new AF-based method is that it succeeds in accurately estimating the DOAs from short data snapshots and even from a single snapshot outperforming by far the state-of-the-art techniques both in DOA estimation accuracy and computational cost.

## Keywords

DOA estimation Root-MUSIC Annihilating filter Array signal processing NDA estimation## 1 Introduction

In recent years, there has been a surge of interest in array signal processing applications in both military and civil domains [1, 2]. The concept of direction of arrival (DOA) estimation find its use in applications related to radar or sonar systems. In addition, in modern mobile communication systems, for example, based only on the data received at the antenna array, estimating the DOAs of the desired users and those of the interference signals allows their extraction and cancellation, respectively, by beamforming technologies [3, 4] in order to improve the wireless systems’ performance.

Roughly speaking, depending on the a priori knowledge of the transmitted signals, DOA estimators can be categorized as data-aided (DA) or non-data-aided (NDA). In plain English, DA approaches base the estimation process on a priori perfectly known symbols. Unfortunately, although being simple and accurate, these approaches may suffer from the major drawback of limiting the whole throughput of the system by periodically sending a reference (known) signal [5]. It should be mentioned here that superimposed pilots do not affect the throughput but increase the complexity of the channel estimation process. Hence, the ever increasing demand for channel bandwidth spurred the more practically oriented minds to develop new estimation techniques that rely on the received data samples only and which are therefore commonly known as NDA techniques. NDA estimators themselves are referred to as deterministic or stochastic if the unknown transmitted signal is assumed deterministic or completely random, respectively. So far, from maximum likelihood-based to subspace-based methods, many NDA DOA estimators have been proposed and extensively studied in the literature [6, 7, 8]. The NDA maximum likelihood approaches are undoubtedly the most accurate, but unfortunately, they are often computationally very expensive. To circumvent this challenging problem, covariance-based estimators are often a trend—in NDA estimation schemes—to alleviate this burden of computational cost. Fortunately, usually, they also provide sufficiently accurate DOA estimates, especially in the presence of sufficiently large number of received samples. But in situations of short data snapshots, they may not be reliable and one would be obliged to trade low complexity for more accurate estimation by simply applying the maximum likelihood approaches. Yet, the maximum likelihood estimators are analytically intractable in the NDA case especially in the presence of random transmitted symbols/signals. Therefore, they are often tackled numerically via multidimensional grid search approaches. Their accuracy/resolution is therefore dictated by the discretization step of the grid. A very dense discretization (small step) is able to provide very accurate estimates even at low operational SNRs, but the complexity of the underlying ML algorithm would be extremely high and even prohibitive since its complexity grows exponentially with the number of the parameters to be estimated. Another alternative is to solve the ML criterion using pilot/reference symbols/signals only where a closed-form solution may be feasible. Unfortunately, this approach is not able to provide *in-service* estimates as the receiver is compelled to wait for the next pilot signals in order to update the estimates.

Motivated by these facts, we develop in this paper a new covariance-based DOA estimation method for ULA configurations which succeeds in estimating the DOA from very short data records. It is based on the *annihilating filter* technique: finding the roots of an annihilating filter (AF) which are directly related to the unknown DOAs. It should be noted that the AF technique has been well known for a very long time in the mature field of spectral estimation. About a decade ago, it was also used to successfully develop the so-called finite-rate-of-innovation (FRI) sampling method [9] where it led to signal sampling and reconstruction paradigms at the minimal possible rate (far below the traditional Nyquist rate). In this contribution, we apply for the first time the AF approach to DOA estimation for ULA configurations and, therefore, we will henceforth refer to our new technique as the AF-based method. The coefficients of the corresponding AF are calculated by the singular value decomposition (SVD) of a matrix whose elements are built from second-order cross moments across the receiving antenna elements of the received samples. Interestingly, this matrix is of reduced dimensions thereby yielding a very low computational load of the SVD decomposition.

We propose two different versions of the new AF-based solution^{1} depending on the SNR threshold. The first one, referred to as “version I”, is more advantageous at high SNR levels. It exploits each consecutive 2*K*+1 correlation coefficients along the columns and rows of the covariance matrix (*K* being the number of sources). The second one, referred to as “version II”, exploits the Toepltiz structure of the covariance matrix in order to enhance the estimation performance at low SNR levels. In both versions, the obtained DOA estimates are then used to find the unknown sources’ powers along with the noise variance.

In the multiple snapshot case, both versions of the proposed AF-based technique are compared in accuracy performance to the Cramér-Rao lower bound (CRLB) [10] and to the root-MUSIC algorithm—a popular and powerful technique of DOA estimation for ULA systems—which is also based on polynomial rooting [11]. In the single-snapshot scenario, however, it is compared to another Bayesian method that was designed precisely for the challenging single-snapshot case [12] as well as the deterministic ML (DML) estimator. We mention here that a more recent *iterative* technique that handles the single-snapshot case has also been proposed in [13]. Unfortunately, in its NDA version, it relies on the prior availability of an initial guess about all the unknown DOAs whose accuracy affects the overall performance of the method. Therefore, for the sake of fairness, this technique is not considered since none of the considered techniques (including our AF-based estimator itself) requires an initial guess about the DOAs. Even more, it has been recently recognized in a comparative study of various DOA estimators [14] that DML is indeed the most attractive one if the DOAs are to be estimated from a single snapshot. It will be shown by Monte-Carlo simulations that the new AF-based method is able to accurately estimate the DOAs from short data snapshots and even from a single-shot measurement. Furthermore, it outperforms the classical Bayesian and DML estimators over a wide SNR range with a slight performance advantage for the latter in the low SNR region but at the cost of an extremely high computational load.

We organize the rest of this paper as follows. In Section 2, we introduce the system model that will be used throughout this article. Then in Section 3, we develop our new AF-based DOA estimation technique. In Section 4, we exploit these new AF-based DOA estimates to develop new estimates for the channel powers. In Section 5, we assess the performance of the new estimators. Finally, we draw out some concluding remarks in Section 6.

We mention beforehand that some of the common notations will be used throughout this paper. Vectors and matrices are represented by lower- and upper-case bold fonts, respectively. Moreover, {.}^{ H } and {.}^{ T } denote the Hermitian (i.e. transpose conjugate) and transpose of any vector or matrix, respectively. The operators {.}^{∗} and |.| return the conjugate and amplitude of any complex number, respectively, and *j* is the pure complex number that verifies *j* ^{2}=−1. Moreover, *N* _{ a } refers to the number of antenna elements in a uniform linear array (ULA). The statistical expectation is denoted as *E*{.}, and the notation \(\triangleq \) is used for definitions.

## 2 System model

*N*

_{ a }antenna elements immersed in a homogeneous media in the far field of

*K*point sources that are transmitting multiple planar waves. We assume that the transmitted signals are temporally white and uncorrelated between the radiating sources. Assuming perfect frequency synchronization, the received signal on the \(\{i^{th}\}_{i=1}^{N_{a}}\) antenna element, at the output of the matched filter, can be modelled as a complex signal as follows:

where at time index *n*, *a* _{ k }(*n*)^{2} is the signal (or symbol) transmitted by the *k* ^{ th } source and *w* _{ i }(*n*) is the noise component on the *i* ^{ th } antenna branch that is modelled by a zero-mean complex Gaussian random variable with independent real and imaginary parts, each of variance *σ* ^{2}. The complex channel coefficients corresponding to the *K* sources are assumed to be unknown, and they are denoted by \(\{h_{k}=|h_{k}|e^{j\phi _{k}}\}_{k=1}^{K}\) where *ϕ* _{ k } stands for any possible channel distortion phase. Moreover, \(\{\theta _{k}\}_{k=1}^{K}\) are the unknown DOAs (to be estimated) of the planar waves impinging from the *K* sources.Note here that the receiving antenna elements are supposed to be spaced by half the wavelength, i.e. *d*=*λ*/2 where *d* is the distance between two consecutive antenna branches and *λ* is the carrier wavelength of the signal. Note also that although the vector/matrix representation of the received signals is more compact and widely adopted in the open literature, we settle here on the scalar form of the received signals (i.e. the elementary received signals on each antenna element). We believe that this representation allows for an easy grasp of the theoretical foundations of the new estimator since it is—as will be seen later—based on the explicit expression for each cross-covariance between the elementary received signals.

*n*the transmitted signals,

*(*

**a***n*)=[

*a*

_{1}(

*n*),

*a*

_{2}(

*n*),⋯,

*a*

_{ K }(

*n*)]

^{ T }and the noise components \(\phantom {\dot {i}\!}\boldsymbol {w}(n)=[w_{1}(n),\cdots,~w_{N_{a}}(n)]^{T}\) are each uncorrelated element-wise, i.e.

*E*{|

*a*

_{ k }(

*n*)|

^{2}}=1. In fact, the transmitted powers,

*P*

_{ k }=E{|

*a*

_{ k }(

*n*)|

^{2}}, can always be incorporated in the channel coefficients after being scaled by the factor \(\sqrt {P_{k}}\). Finally, the symbols, \(\{a_{k}(n)\}_{n=1}^{N}\), transmitted by source

*k*over the observation time window are assumed mutually independent. Then, we define the true SNR of the

*k*

^{ th }source as follows:

## 3 Formulation of the new AF-based DOA estimator

*K*, we gather for more convenience all the unknown DOAs in one single parameter vector

*=[*

**θ***θ*

_{1},

*θ*

_{2},⋯,

*θ*

_{ K }]

^{ T }. Then, the cross-covariances between the received signals from any pair (

*i,l*) of the receiving antenna array can be defined as:

*M*

_{ θ }(

*i,l*) reduces simply to:

*n*,

*Σ*

_{ y }(

*i,l*), is nothing but the (

*i,l*)

^{ th }entry of the covariance matrix, \(\boldsymbol {\Sigma _{y}} =\text {E}\{\boldsymbol {y}(n)\boldsymbol {y}^{H}(n)\}\). The latter matrix is Toeplitz structured

^{3}due to the use of an ULA antenna and can be estimated by a simple sample mean as follows:

**Σ**_{ y }contains all the information about the DOAs that would be extracted from the entire matrix. Indeed, the diagonal elements do not depend on the unknown DOAs, although they can be eventually used to estimate the noise variance after estimating the channel coefficients from the off-diagonal entries as detailed later. Consequently, from now on, the counters

*i*and

*l*will always verify

^{4}

*i*>

*l*. Then, using the notation \(u_{k}=e^{j\pi \sin (\theta _{k})}\), we define the

*N*

_{ a }−1 sequences—indexed by the counter

*l*—\(\{r^{(l)}_{\boldsymbol {\theta }}[m]\}_{m=1}^{N_{a}-l}\), each of which containing the

*N*

_{ a }−

*l*elements of the \(\{l^{th}\}_{l=1}^{N_{a}-1}\) column that are lying strictly below the main diagonal as follows:

*N*

_{ a }−

*l*)-dimensional vector \(\boldsymbol {r}_{\boldsymbol {\theta }}^{(l)}\)—that will be used subsequently—as follows

^{5}:

*annihilating filter*technique—and is actually the main idea behind this work as will be soon explained.Generally speaking, a filter

*g*[

*m*] is called an annihilating filter of a signal or more generally a discrete sequence {

*s*[

*m*]}

_{ m }when

*s*[

*m*] in (11). Indeed, as shown subsequently, for such special sequences (linear combinations of exponentials), the roots of the corresponding annihilating filters are exactly the involved elementary exponentials. More formally, consider the following filter:

*g*[

*n*]—as constructed in (12)—is indeed an annihilating filter for the sequence \(\left \{r^{(l)}_{\boldsymbol {\theta }}[m]\right \}_{m=1}^{N_{a}-1}\). Then, if one is able to find the coefficients \(\{g[n]\}_{n=0}^{K}\), the roots of the corresponding polynomial

*g*(

*z*) in (12) would be easily computed and then the DOAs can be easily estimated from the arguments of the obtained roots. To that end, we gather the desired coefficients, \(\{g[n]\}_{n=0}^{K}\), in a single unknown vector

*=[*

**g***g*[0],

*g*[2],⋯,

*g*[

*K*]]

^{ T }and describe below an easy SVD procedure that enables finding

*. First notice that the unknown filter coefficients \(\{g[n]\}_{n=0}^{K}\) in \(g(z)=\sum _{n=0}^{K}g[n]z^{-n}\) must be such that (11) is satisfied for all \(m\in \mathbbm {Z}\) and in particular for*

**g***m*>

*n*:

*l*

^{ th }column of the covariance matrix, we estimate (as described later) from (14) the

*K*+1 unknown filter coefficients. In this way, it is clear that one needs

*K*+1 independent equations—obtained by changing

*m*—in order to obtain at least one estimate, \(\hat {\boldsymbol {g}}^{(l)}\), of the desired vector

*. Therefore, if a column*

**g***l*is to be useful, the corresponding vector \(\boldsymbol {r}_{\boldsymbol {\theta }}^{(l)}\) should contain at least 2

*K*+1 elements. Recall from (10) that the size of \(\boldsymbol {r}_{\boldsymbol {\theta }}^{(l)}\) is

*N*

_{ a }−

*l*, which results in

*N*

_{ a }−

*l*≥2

*K*+1. Therefore,

*l*must verify

*N*

_{ a }−2

*K*−1 columns of the covariance matrix contain a sufficient number of cross-covariances that enable having at least one estimate, \(\hat {\boldsymbol {g}}^{(l)}\) of

*, per-column \(\left (\text {or per-vector}~ \boldsymbol {r}_{\boldsymbol {\theta }}^{(l)}\right)\). Observe also from (15) that it is necessary to have at least*

**g***N*

_{ a }≥2

*K*+2 receiving antenna elements for

*K*unknown sources. Thus, our estimator needs more than twice the number of antennas as the number of sources. Moreover, in addition to the trivial initial estimate, \(\widehat {\boldsymbol {g}}_{0}^{(l)}\), that is obtained using the first necessary 2

*K*+1 cross-covariances in \(\boldsymbol {r}_{\boldsymbol {\theta }}^{(l)}\), we can actually obtain

*P*

_{ l }additional estimates \(\left \{\hat {\boldsymbol {g}}^{(l)}_{p}\right \}_{p=1}^{P_{l}}\) for the unknown

*from each candidate column*

**g***l*. Here,

*P*

_{ l }=

*N*

_{ a }−

*l*−2

*K*−1 is the number of samples exceeding these necessary first 2

*K*+1 cross-covariances. This means that we obtain

*P*

_{ l }+1=

*N*

_{ a }−2

*K*−

*l*estimates for

*from each eligible column*

**g***l*. In fact, for a given

*l*, the \(\{l^{th}\}_{l\leq N_{a}-2K-1}\) vector \(\boldsymbol {r}^{(l)}_{\boldsymbol {\theta }}\) contains 2

*K*+1+

*P*

_{ l }cross-covariances. Then, for each

*p*=0,1,2,⋯,

*P*

_{ l }, consider 2

*K*+1 consecutive samples of these second-order moments, \(\left \{r^{(l)}_{\boldsymbol {\theta }}[m_{p}+r]\right \}_{r=-K}^{K}\), that are centred around

*m*

_{ p }=

*K*+1+

*p*. Now, replacing

*m*by

*m*

_{ p }+

*r*, the system in (14) yields

*p*(or equivalently

*m*

_{ p }), we have

*K*+1 independent equations which can be more conveniently written in the matrix/vector form as follows:

*l*, we have

*P*

_{ l }+1=

*N*

_{ a }−

*l*−2

*K*possible linear systems (by varying

*p*) that provide

*P*

_{ l }+1 estimates for the same vector

*—involved in these systems—as previously stated.In practice, the system in (17) can be solved via a singular value decomposition (SVD) where the (*

**g***K*+1×

*K*+1) matrix \(\boldsymbol {S}_{p}^{(l)}(\boldsymbol {\theta })\) is decomposed into:

*l*=1,2,⋯,

*N*

_{ a }−2

*K*−1 and

*p*=0,1,⋯,(

*N*

_{ a }−2

*K*−1)−

*l*, we obtain an estimate, \(\hat {\boldsymbol {g}}_{p}^{(l)}\), for

*as follows:*

**g**

**e**_{ K+1}is a vector with 1 at position

*K*+1 and 0 elsewhere. Solving for the

*K*roots of \(\hat {\boldsymbol {g}}_{p}^{(l)}\), we obtain a set of estimates for \(\left \{u_{k}=e^{j\pi \sin (\theta _{k})}\right \}_{k=1}^{K}\). We denote these estimates as \(\left \{\hat {u}_{k}^{(l,p)}\right \}_{k=1}^{K}\) from which a set of estimates for the unknown DOAs are obtained for each

*l*and

*p*as follows:

*P*

_{ l }+1=

*N*

_{ a }−2

*K*−

*l*estimates for the same DOA

*θ*

_{ k }, which means that by considering all the eligible columns, we have

*N*

_{ a }−2

*K*−1 columns. Yet, the remaining columns (

*l*≥

*N*

_{ a }−2

*K*) can also be exploited to further refine the DOA estimates. This may seem a priori impossible since these columns—or equivalently the corresponding vectors \(\left \{\boldsymbol {r}^{(l)}_{\boldsymbol {\theta }}\right \}_{l=N_{a}-2K}^{N_{a}}\)—do not indeed contain the necessary 2

*K*+1 cross-covariances as previously required. Yet, the elements of these columns belong to the last

*N*

_{ a }−2

*K*−1 rows that contain necessarily more than 2

*K*+1 adjacent covariances. Indeed, recalling that the covariance matrix \(\bar {\boldsymbol {\Sigma }}(\boldsymbol {y})\) is Toeplitz structured, it becomes clear that the last

*N*

_{ a }−2

*K*−1 rows can also be exploited in the same way providing thereby a new set of estimates for the DOAs. To that end, for the \(\{l^{th}\}_{l=2K+2}^{N_{a}}\) row, we construct the corresponding vectors

^{6}, \(\boldsymbol {r}^{\prime (l)}_{\boldsymbol {\theta }}=\left [r^{\prime (l)}_{\boldsymbol {\theta }}(1), r^{\prime (l)}_{\boldsymbol {\theta }}(2),\cdots,r^{\prime (l)}_{\boldsymbol {\theta }} (l-1)\right ]^{T}\) whose

*m*

^{ th }element is defined as

*l*=

*N*

_{ a },

*N*

_{ a }−1,⋯,2

*K*+2, the sequence \(\{r^{\prime (l)}_{\boldsymbol {\theta }}[m]\}_{m=1}^{l-1}\) inherits the important structure of linear combinations of weighted exponentials. Then, applying the same procedure using the vectors \(\boldsymbol {r}^{\prime (l)}_{\boldsymbol {\theta }}\) instead of \(\boldsymbol {r}^{(l)}_{\boldsymbol {\theta }}\), we obtain an additional

*row-wise*refined estimate for each DOA which we denote \(\hat {\theta }_{k}^{\text {row}}\). Lastly, the final estimates of the DOAs are obtained as

*Σ*

_{ y }(

*i,l*), given in (5) although in practice these elementary cross-covariances are estimated by sample averaging as follows:

and this sample average does not coincide with the statistical average given in (5) unless the observation window size, *N*, is very large. Yet, we will see in the simulations section that the new AF-based estimator performs very well with very short-data records and even from a single snapshot.

### 3.1 Robustness to the presence of short data records

*N*=1. For convenience, we adopt the notation \(\widehat {\Sigma }_{\boldsymbol {y}}^{l}(i)\) for the estimated elementary cross-covariances of (25) instead of \(\widehat {\Sigma }_{\boldsymbol {y}}(i,l)\), which are given by

*n*=1,2,⋯,

*N*:

*i*and antenna element

*l*, as follows:

We observe from (29) that the second-order moments estimated with short data records (or even a single snapshot) exhibit the interesting property of a “weighted sum of sinusoids” and therefore the DOAs can still be accurately estimated from the roots of their annihilating filter.

### 3.2 Exploiting the Toeplitz structure of the covariance matrix

*N*

_{ a }covariances. In fact, we see from (5) that for

*m*=1,2,⋯,

*N*

_{ a }−1

*m*, \(\{\widehat {\Sigma }_{\boldsymbol {y}}(l+m,l)\}_{l=1}^{N_{a}-m}\) can be averaged as follows to obtain the following more refined statistics:

from which we construct a single vector, \(\widehat {\bar {\boldsymbol {r}}}_{\boldsymbol {\theta }}=[\widehat {\bar {r}}_{\boldsymbol {\theta }}(1), \widehat {\bar {r}}_{\boldsymbol {\theta }}(2),\cdots, \widehat {\bar {r}}_{\boldsymbol {\theta }}(N_{a}-1)]^{T}\). Then, the same procedure that was previously applied for all the eligible columns is now applied to the single vector \(\widehat {\bar {\boldsymbol {r}}}_{\boldsymbol {\theta }}\) since it also inherits the interesting property of weighted sum of exponentials. For ease of notation, we simply refer to this procedure as *version II* of the new AF-based estimator and we refer to the procedure described previously (column-wise and row-wise) as *version I*.This operation of averaging over the secondary diagonals is not only useful to combat the effect of the noise at low SNRs but also expected to improve the DOA estimation even for moderate SNR values whenever the number of sources to be localized is large. In fact, when *K* is high, the number *N* _{ a }−2*K*−1 of eligible columns in *version I* can be limited. For instance, for *N* _{ a }=8 and *K*=3, only the first column is eligible since *N* _{ a }−2*K*−1=1. Consequently, a large part of the covariance matrix is simply ignored although it carries a lot of information about the unknown DOAs. Yet, by averaging over the secondary diagonals, all the entries of the covariance matrix are incorporated in the estimation process and the whole information is being exploited. Therefore, as long as the SNR decreases or the number of sources increases (for a fixed number of receiving antenna elements), it is expected that the second version of the new estimator outperforms its first version. However, for sufficiently high SNR values, the estimated elementary cross-covariances (without averaging) are already quite accurate and can hence be reliably used to obtain more accurate^{7} DOA estimates with *version I*. The latter is even more recommended if the number of sources is also small since the number of eligible columns (and consequently the number of exploited cross-covariances) would be sufficiently high.

### 3.3 Complexity analysis

^{8}. To that end, we evaluate the number of operations (additions and multiplications) required by each estimator. In particular, the new estimator involves two major steps which are (i) the estimation of the covariance matrix that requires

*NN*

_{ a }(

*N*

_{ a }−1) operations and (ii) the SVD decomposition and polynomial rooting procedures which require 2(

*N*

_{ a }−2

*K*−1)(

*N*

_{ a }−2

*K*)

*O*(

*K*

^{3}) operations. Of course, it involves also at the very end a simple step in which the individual estimates are averaged requiring (

*N*

_{ a }−2

*K*−1)(

*N*

_{ a }−2

*K*) extra operations. On the other hand, the overall complexities of the DML and Bayesian estimators are \(R^{K}\left (2N_{a}^{3}+(N+2K-1)N_{a}^{2}+(4N_{a}-1)K^{2}-(N+N_{a}) K+O(K^{3})\right)\) and \(R^{K}\left ((4K+3)N_{a}^{2}+(12N_{a}-3)K^{2}- (3K-2)N_{a}+3O(K^{3})\right)\), respectively, where

*R*is the number of samples on the parameters grid corresponding to a discretization step,

*s*, of

*s*=180/

*R*. Notice here that the complexity of these two traditional estimators grows exponentially with the number of unknown DOAs,

*K*, as reflected by the multiplicative term

*R*

^{ K }. It comes clear now that increasing

*R*(i.e. considering a denser grid search for more refined estimates) increases prohibitively their computational cost. Typically, for

*N*

_{ a }=16,

*N*

_{ s }=2,

*N*=1, and

*R*=100, the total number of operations performed by our AF-based method, to estimate all the DOAs, is about 2484 operations. However, to evaluate their objective functions just at a single search point (

*θ*

_{ i },

*θ*

_{ j }) in the grid, the Bayesian and DML estimators require about 3532 and 9442 operations, respectively, i.e. already far more than the overall complexity of our estimator. To find the estimates of the DOAs as the maximum of their objective functions over all the grid points, these two classical estimators require in total as much as 100

^{2}×3532=35.32×10

^{6}and 100

^{2}×9442=94.42×10

^{6}operations against just 2484 operations with the proposed estimator. Of course, the performance of these grid-search estimators improves constantly as

*R*increases, but their computational load becomes prohibitively very high. This is illustrated in Table 1 where we present the computational load of the three estimators in different setups by evaluating their complexities at various values for the couple (

*K,R*) with a fixed array-size of

*N*

_{ a }=16. It is clearly seen from this table that our estimator is far less computationally expensive than both existing single-snapshot techniques. Moreover, it will be shown later through computer simulations that it outperforms both of them in accuracy over a large SNR range.

Complexity of the three single-shot techniques with *N* _{ a }=16 receiving antenna branches

| | |||
---|---|---|---|---|

| | | | |

Bayesian method | 35.32×10 | 8.83×10 | 7.9200×10 | 4.95×10 |

DML | 94.42×10 | 2.3605×10 | 1.1244×10 | 7.0275 ×10 |

AF-based | 2484 | 2484 | 7464 | 7464 |

## 4 Per-source channel power estimation

*N*<10 for instance). To that end, we take the first

*K*averaged covariances in (31), \(\bar {r}_{\boldsymbol {\theta }}[m]=\sum _{k=1}^{K}|h(k)|^{2}u_{k}^{m}\),

*m*=1,2,⋯,

*K*, from which we write the following matrix system:

*u*

_{ k }instead of the true DOAs,

*θ*

_{ k }, we construct an estimated matrix, \(\widehat {\boldsymbol {U}}(\boldsymbol {\theta })\), using \(\widehat {u}_{k}=e^{j\pi \sin (\widehat {\theta }_{k})}\), to substitute

*(*

**U***) in the system (32) in which the only remaining unknowns are \(\{|h_{k}|^{2}\}_{k=1}^{K}\). Thus, by inverting \(\widehat {\boldsymbol {U}}(\boldsymbol {\theta })\) and using \(\widehat {\bar {\boldsymbol {r}}}_{\boldsymbol {\theta }}\) instead of \(\bar {\boldsymbol {r}}_{\boldsymbol {\theta }}\), one can easily obtain a joint estimate, \(\widehat {\boldsymbol {h}}=[|\widehat {h}_{1}|^{2},|\widehat {h}_{2}|^{2},\cdots,|\widehat {h}_{K}|^{2}]^{T}\), for the channel powers,*

**θ***=[|*

**h***h*

_{1}|

^{2},|

*h*

_{2}|

^{2},⋯,|

*h*

_{ K }|

^{2}]

^{ T }, as follows:

*h*

_{ k }|

^{2}obtained in (33), we obtain an estimate \(\widehat {\sigma }^{2}_{l}\) of

*σ*

^{2}for each

*l*=1,2,⋯,

*N*

_{ a }as follows:

*l*to obtain a more accurate estimate of the noise variance:

## 5 Simulation results

*k*

^{ th }DOA,

*θ*

_{ k }, as follows:

*M*

_{ c }is the number of Monte-Carlo simulations which is set to

*M*

_{ c }=1000 in all simulations and \(\hat {\theta }^{(q)}_{k}\) is the estimate of

*θ*

_{ k }from the

*q*

^{ th }Monte-Carlo run. We also consider the well-known root-MUSIC (RM) estimator and the Cramér-Rao lower bound (CRLB) [10] as a benchmark against which we compare the performance of our newly developed method in the case of a large number of snapshots. In the case of short data records, we also add the Multi-Task Bayesian Compressed Sensing (MT-BCS) technique [19] as a benchmark. We propose also another performance metric where we show the resolution probabilities for the AF-based and root MUSIC techniques. In the more challenging case where a single snapshot is available at the receiver side, we compare our method to the Bayesian estimator [12] and the Single Task Bayesian Compressed Sensing (ST-BCS) technique [19] that are both specifically designed to cope with this extreme scenario. We also compare it to the deterministic ML estimator that is recognized to be the most accurate in this case [14]. For the sake of conciseness, we consider without loss of generality the case of equipowered sources and provide simulation results only for the first source (DOA and channel power). Yet, we emphasize the fact that the same performance behaviour can be observed from the other sources. For the channel power estimator, we adopt the normalized root mean square error (NRMSE) as a performance measure defined as

The NRMSE for the SNR estimator is defined likewise. DOA estimation will be basically organized in three subsections: (i) the case of multiple snapshots (including short-data records), (ii) the case of a single-shot measurement, and (iii) the case of time varying DOAs. Channel powers and SNR estimation will then follow.

### 5.1 Multiple and short-data records: comparison against root-MUSIC

*version I*and

*verion II*of the AF-based and root-MUSIC) the MSE of the DOA estimates for the first source obtained from

*N*=1000 received samples, with

*N*

_{ a }=8 and

*N*

_{ a }=16 receiving antenna elements, versus the SNR of the same source.

We see that the two versions of the new estimator provide sufficiently accurate DOA estimates over the entire SNR range. In such *comfortable* situation where a very large number of measurements can be used in the estimation process, the classical root-MUSIC technique outperforms the two AF-based versions. It is also seen that as *N* _{ a } increases, *version I* of the AF-based estimator exhibits a performance gain against its *version II* at low SNR values. Actually, this is only true when the window size is large enough (e.g. *N*=1000 as considered in this figure) so that the elementary cross-covariances are quite accurate and therefore the elementary estimates \(\hat {\theta }^{(l,k)}\) are also sufficiently accurate. Indeed, since the number of these elementary estimates (*N* _{ a }−2*K*−1 eligible columns and rows) also increases with *N* _{ a }, this leads to a more accurate final averaged estimate than the single estimate obtained by applying *version II*. The same observation holds for sufficiently high SNR values even if *N* _{ a } is small (*N* _{ a }=8).

*N*=3 for example). The major advantage of our new estimator is now revealed. In fact, both versions of the new technique outperform by far, in terms of estimation accuracy, the RM estimator with an advantage for

*version II*over

*version I*(the advantage of exploiting the Toeplitz structure is now clearer). Yet, the former’s performance saturates at very high SNR values whereas the latter’s improves linearly with the SNR. The MT-BCS technique shows in Fig. 2 good performance in the case of short data records (i.e.

*N*=3). Unfortunately, its computational complexity is dictated by the grid discretization step, and a trade-off between complexity and performance must be made.[19].

*Δ*

*θ*=10°. Clearly, AF-version II has a better resolution performance with closely spaced angles. Figure 3b depicts the probabilities of resolution as function of the SNR values. Both AF techniques succeed in resolving the sources in 90% of the cases starting from the SNR value of 3 dB.

### 5.2 Single-shot case: comparison against the DML and Bayesian methods

*N*=1 (i.e. only one sample is available at the receiver side) and

*N*

_{ a }=16 receiving antenna branches.

The three existing estimators were simulated using a discretization step *s*=180/100 (in the remainder of this paper, we will characterize the grid step, *s*, by the integer number *R* where *s*=180/*R*). We observe from this figure that both versions of the newly developed AF-based estimator are still able to estimate the DOAs over a wide SNR range. We see also from Fig. 4 that for sufficiently high SNR values the MSE of *version II* saturates, contrarily to *version I*. This is because in this SNR region the signals are almost noise-free and therefore the elementary cross-covariances’ estimates are already noiseless. They can be thus exploited as they are (as done in *version I*) to provide a large number of sufficiently accurate estimates \(\hat {\theta }_{k}^{(l,p)}\) without *prior* averaging (as done in *version II*). In fact, averaging along the secondary diagonals would simply provide a number of statistics that are as accurate as the elementary cross-covariances themselves, and hence, the performance in terms of DOA estimation does not improve (saturation).On the other hand, the existing single-shot techniques (Bayesian, DML estimators and ST-BCS) exhibit a slight advantage at low SNR levels, but their computational load is extremely much higher. In fact, in light of the complexity analysis presented in Table 1 at the end of Section 3.3, the complexities of the DML and Bayesian algorithms are, respectively, in the order of \(N_{oper}^{\text {Bayesian}}= 35.32\times 10^{6}\) and \(N_{oper}^{\textrm {DML}}= 94.42\times 10^{6}\) operations against only \(N_{oper}^{\text {AF}}=2484\) operations for the proposed estimator. This amounts to complexity ratios in the order of \(\frac {N_{oper}^{\text {Bayesian}}}{N_{oper}^{\text {AF}}}\approx \frac {N_{oper}^{\textrm {DML}}}{N_{oper}^{\text {AF}}} \approx 10^{4}\). Yet, even at these extremely high computational loads, the traditional single-snapshot algorithms are not able to outperform the new estimator for medium to high levels. Of course, as stated previously, for extremely large values of *R* (very dense grid search), these two estimators would ultimately outperform our new method over the entire SNR range, but unfortunately their complexities become even more prohibitive^{9}. For example, under the same simulation setup of Fig. 4 (in particular *N* _{ a }=16 and *K*=2), these two estimators will outperform the AF-based technique, over the entire SNR range, by setting *R*=500 (i.e. estimating the DOAs at a grid resolution of 0.36°). However, the complexity ratios become in the order of \(\frac {N_{oper}^{\text {Bayesian}}}{N_{oper}^{\text {AF}}}\approx \frac {N_{oper}^{\textrm {DML}}}{N_{oper}^{\text {AF}}} \approx 10^{6}\).

The new method is therefore very useful (in terms of accuracy/complexity trade-offs) in applications where a single snapshot is to be used. This is encountered in many situations where a very high estimation update speed is required. These applications can be indeed enhanced by providing a DOA estimate once a single sample is acquired instead of waiting for a larger number of measurements. Furthermore, in many other practical situations, the DOAs may change appreciably from one snapshot to another due to the fast motion of the sources. For all these systems, our new AF-based estimator offers the best accuracy/complexity trade-offs.

### 5.3 Time-varying DOAs

*version II*and the DML algorithm for two moving sources and an SNR level of 15 dB. The DOAs were generated assuming that both sources increase linearly from −60° and −30°, respectively, with a radial speed \(\dot {\theta }_{1}=\dot {\theta }_{2}\) as high as 1.175° per sample, over 80 data snapshots. Both estimators were applied using

*N*=1 (i.e. single snapshot). It is seen that both AF and DML estimates follow accurately the trajectories of the two time-varying DOAs. Yet, as depicted in Fig. 6, the AF-based estimator exhibits lower tracking error at significantly much less computational cost. Furthermore, since the new estimator performs well with a single data snapshot, its tracking performance will prove the same no matter the angular speed ranges of the DOA time variations reach.

*N*) and DOA speeds (\(\dot {\theta }\)), for the two estimators. A region is attributed to a given estimator when this estimator shows lower MSE for all the couples (

*N*, \(\dot {\theta }\)) in this region. We see that when the DOAs vary so rapidly, our new estimator outperforms the RM technique even in the case of multiple snapshots (upper right corner of Fig. 7) contrarily to what was observed in Fig. 1 where the DOAs where assumed constant (which corresponds to \(\dot {\theta }= 0\)°/sample and

*N*=1000).

### 5.4 Performance of the channel powers and SNR estimators

*N*=10 and

*N*=1000, we plot in Figs. 8 and 9, respectively, the NRMSE for the channel power estimator using both

*versions*

*I*and

*II*as a function of the true SNR. First, notice from Fig. 8 that the channel power is estimated quite accurately using only few received samples,

*N*=10 snapshots, especially in the moderate/high experienced SNR values. Naturally, the estimation accuracy is enhanced in Fig. 9 for a larger window size, i.e.

*N*=1000 where both versions provide very accurate estimates for the channel power, a key parameter that is often used for the design of wireless communication schemes. We also observe from these two figures, for these large antenna array-sizes (

*N*

_{ a }=16 and

*N*

_{ a }=32), the performance improvements of

*version I*against

*version II*at low SNR values, a fact that is mainly due to the improvements in DOA estimation in this region as explained previously (see comments on Fig. 1).

*N*

_{ a }. It is seen from this figure that performance improves by increasing

*N*

_{ a }, which is hardly surprising. Yet, the SNR estimates are not as quite accurate as those of the channel strength. This stems mainly from the estimation error on the noise variance. At a first sight, one would argue that since the channel strengths are increasingly more accurate at higher SNR values, then the estimation error on the noise power should also remain constant and so does the SNR estimates. This is simply not true because as the true SNR increases, the true channel strength increases as well (for a fixed true noise variance) and the relative estimation error \(\epsilon _{k}=|\hat {h}_{k}|^{2}-|h_{k}|^{2}\) is higher although the normalized error \(\tilde \epsilon _{k}=\epsilon _{k}/|h_{k}|^{2}\) remains constant in average (i.e. the channel estimates’ NRMSE remains constant). Consequently, larger \(\{\epsilon _{k}\}_{k=1}^{K}\) yields a higher estimation error on the noise power (or equivalently the SNR);

*ε*

_{ k }can be even larger than 2

*σ*

^{2}to be estimated itself. For a larger number of receiving antenna elements (

*N*

_{ a }=32 for example), the SNR estimates are, however, reliable for the entire considered SNR region.

## 6 Conclusions

In this paper, we derived a new DOA estimation method for multiple planar waves impinging on a ULA antenna array. The transmitted sources and the noise components are assumed to be spatially and temporally white. The new method is based on the *annihilating filter* technique. It was seen that the new method exhibits accurate statistical performance while having a low computational cost. Its major advantage is its capability of accurately resolving DOAs as close as 10°from short data snapshots and even from a single snapshot. This capability makes this new estimator well geared toward applications that require DOA estimation of fast moving sources or require up-to-date estimates for the DOAs over very short observation windows. The estimated DOAs were then used to easily estimate the channel powers and SNRs for each source (or user).

## 7 Endnotes

^{1} Extensions of the proposed AF-based technique to the problem of joint angle and delay estimation (JADE) [21] falls beyond the scope of this paper.

^{2} The signal *a* _{ k }(*n*) can be complex symbols taken from any constellation such as QPSK, M-PSK and M-QAM or simply complex Gaussian.

^{3} This is because all the cross-covariances that belong to any given secondary diagonal of the covariance matrix have the same expression.

^{4} One could decide to consider the upper-triangular matrix, i.e. *i*<*l*. But this does not change the estimator, as seen from (5), since this will only introduce a negative sign in the exponential argument.

^{5} Note that the vector \({\boldsymbol {r}}_{{\boldsymbol {\theta }}}^{(l)}\) contains all the *N* _{ a }−*l* elements of the *l* ^{ th } column that are lying under the main diagonal of the covariance matrix.

^{6} We mention here that \(\boldsymbol {r}^{\prime (l)}_{\boldsymbol {\theta }}\) plays the role of \(\boldsymbol {r}^{(l)}_{\boldsymbol {\theta }}\) that was previously used when the estimation process was performed column-wise.

^{7} This is because this version provides a larger number of estimates for each DOA, which can be averaged to obtain a more refined final estimate.

^{8} Please note that the root-MUSIC techniques has almost the same complexity of the our AF-based estimator since it involves similar operations of SVD decomposition (but with different matrices sizes) and polynomial rooting. Also note that we evaluate and refer to the complexity of *version I* of the new AF-based estimator since it is more computationally expensive than *version II*.

^{9} Their complexities also increase *exponentially* with the number of unknown DOAs, *K*, contrarily to the proposed estimator whose complexity increases only *polynomially* with *K* (see Table 1 for *K*=4).

## Notes

### Acknowledgments

This work was made possible by NPRP grant NPRP 5-250-2-087 from the Qatar National Research Fund (a member of Qatar Foundation). The statements made herein are solely the responsibility of the authors. Work published in part in [22].

### Competing interests

The authors declare that they have no competing interests.

### Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## References

- 1.DH Johnson, DE Dudgeon,
*Array Signal Processing Concepts and Techniques*(Prentice Hall, Englewood Cliffs, NJ, 1993).MATHGoogle Scholar - 2.HL Van Trees,
*Optimum Array Processing*, 1st edn (John Wiley, New York, 2002). Part IV of Detection, Estimation and Modulation Theory.CrossRefGoogle Scholar - 3.TS Rappaport,
*Smart Antennas: Adaptive Arrays, Algorithms, and Wireless Position Location*(IEEE Press, New York, 1998).Google Scholar - 4.SD Blostein, H Leib, Multiple antenna systems: role and impact in future wireless access. IEEE Commun. Mag.
**41**(7), 94–101 (2003).CrossRefGoogle Scholar - 5.A Jagannatham, B Rao, in
*Proc. of IEEE ACSSC’2006*. Superimposed pilots vs. conventional pilots for channel estimation (IEEECalifornia, USA, 2011).Google Scholar - 6.R Roy, A Paulraj, T Kailath, ESPRIT - A subspace rotation approach to estimation of parameters of cisoids in noise. IEEE Trans. Acoust. Speech Signal Proc.
**ASSP-34:**, 1340–1342 (1986).CrossRefGoogle Scholar - 7.P Stoica, KC Sharman, Maximum likelihood methods for direction-of-arrival estimation. IEEE Trans. Acoust. Speech Signal Proc.
**38:**, 1132–1143 (1990).CrossRefMATHGoogle Scholar - 8.M Agrawal, S Prasad, A modified likelihood function approach to DOA estimation in the presence of unknown spatially correlated Gaussian noise using a uniform linear array. IEEE Trans. Sign. Proc.
**48**(10), 2743–2749 (2000).CrossRefGoogle Scholar - 9.M Vetterli, P Marziliano, T Blu, Sampling signals with finite rate of innovation. IEEE Trans. Sign. Proc.
**50**(6), 1417–1428 (2002).MathSciNetCrossRefGoogle Scholar - 10.P Stoica, A Nehorai, Performance study of conditional and unconditional direction-of-arrival estimation. IEEE Trans. Acoust. Speech Signal Proc.
**38**(10), 1783–1795 (1990).CrossRefMATHGoogle Scholar - 11.H Krim, M Viberg, Two decades of array signal processing research. IEEE Signal Proc. Mag.
**13**(4), 67–93 (1996).CrossRefGoogle Scholar - 12.BM Radich, KM Buckley, Single-snapshot DOA estimation and source number detection. IEEE Signal Proc. Lett.
**4**(4), 109–111 (1997).CrossRefGoogle Scholar - 13.RT O’Brien, K Kiriakidis, Single-snapshot robust direction finding. IEEE Trans. Signal Proc.
**53**(6), 1964–1978 (2005).MathSciNetCrossRefGoogle Scholar - 14.P Hacker, B Yang, Single snapshot DOA estimation. Adv. Radio Sci.
**8:**, 251–256 (2010). [Online]. Available http://www.adv-radio-sci.net/8/251/2010/.CrossRefGoogle Scholar - 15.S Moshavi, Multi-user detection for DS-CDMA communications. IEEE Commun. Mag.
**34**(10), 124–136 (1996).CrossRefGoogle Scholar - 16.ALC Hui, KB Letaief, Successive interference cancellation for multiuser asynchronous DS/CDMA detectors in multipath fading links. IEEE Trans. Commun.
**46**(3), 384–391 (1998).CrossRefGoogle Scholar - 17.JG Andrews, TH Meng, Optimum power control for successive interference cancellation with imperfect channel estimation. IEEE Trans. Wirel. Commun.
**2**(2), 375–383 (2003).CrossRefGoogle Scholar - 18.SP Weber, JG Andrews, X Yang, GD Veciana, Transmission capacity of wireless ad hoc networks with successive interference cancellation. IEEE Trans. Inf. Theory.
**53**(8), 2799–2814 (2007).MathSciNetCrossRefMATHGoogle Scholar - 19.M Carlin, P Rocca, G Oliveri, F Viani, A Massa, Directions-of-arrival estimation through Bayesian compressive sensing strategies. IEEE Trans. Antennas Propag.
**61**(7), 3828–3838 (2013).MathSciNetCrossRefGoogle Scholar - 20.R Grover, DA Pados, MJ Medley, Subspace direction finding with an auxiliary-vector basis. IEEE Trans. Signal Proc.
**55:**, 758–763 (2007).MathSciNetCrossRefGoogle Scholar - 21.JG Andrews, TH Meng, Optimum power control for successive interference cancellation with imperfect channel estimation. IEEE Trans. Wireless Commun.
**2**(2), 375–383 (2003).CrossRefGoogle Scholar - 22.SP Weber, JG Andrews, X Yang, GD Veciana, Transmission capacity of wireless ad hoc networks with successive interference cancellation. IEEE Trans. Inf. Theory.
**53**(8), 2799–2814 (2007).MathSciNetCrossRefMATHGoogle Scholar

## Copyright information

**Open Access** This article is distributed under the terms of the Creative Commons Attribution 4.0 International License(http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.