Data-Aided Maximum Likelihood Joint Angle and Delay Estimator Over Orthogonal Frequency Division Multiplex Single-Input Multiple-Output Channels Based on New Gray Wolf Optimization Embedding Importance Sampling

Abstract

In this paper, we propose a new data-aided (DA) joint angle and delay (JADE) maximum likelihood (ML) estimator. The latter consists of a substantially modified and, hence, significantly improved gray wolf optimization (GWO) technique by fully integrating and embedding within it the powerful importance sampling (IS) concept. This new approach, referred to hereafter as GWOEIS (for “GWO embedding IS”), guarantees global optimality, and offers higher resolution capabilities over orthogonal frequency division multiplex (OFDM) (i.e., multi-carrier and multi-path) single-input multiple-output (SIMO) channels. The traditional GWO randomly initializes the wolfs’ positions (angles and delays) and, hence, requires larger packs and longer hunting (iterations) to catch the prey, i.e., find the correct angles of arrival (AoAs) and time delays (TDs), thereby affecting its search efficiency, whereas GWOEIS ensures faster convergence by providing reliable initial estimates based on a simplified importance function. More importantly, and beyond simple initialization of GWO with IS (coined as IS-GWO hereafter), we modify and dynamically update the conventional simple expression for the convergence factor of the GWO algorithm that entirely drives its hunting and tracking mechanisms by accounting for new cumulative distribution functions (CDFs) derived from the IS technique. Simulations unequivocally confirm these significant benefits in terms of increased accuracy and speed Moreover, GWOEIS reaches the Cramér–Rao lower bound (CRLB), even at low SNR levels.

1. Introduction

JADE (For the reader’s convenience, please find and refer to the full list of all abbreviations adopted in this paper, at the very end, right before the bibliography section) is a crucial operation in many digital receivers. Highly accurate and computationally inexpensive JADE is required in many fields ranging from military applications such as RADAR or SONAR systems to wireless indoor positioning [1,2] and wireless communication systems [3]. Moreover, the estimation of AoAs and TDs enable the design of highly accurate localization techniques [4]. Many existing works have focused on solving the JADE problem. Most fall under the subspace-based category such as Multiple Signal Classification (MUSIC) [5], ESPRIT [6], and the 2D unitary matrix pencil (UMP) [7]. One of the iterative ML estimators based on the space-alternating generalized expectation maximization (SAGE) algorithm was proposed in [8]. The approach in [9] mainly targets only the DOA estimation. It introduces a DOA estimation algorithm in a full-dimension MIMO system by solving the maximum likelihood estimation using expectation-maximization (EM) algorithm. Recently, a tensor-based approach for channel and target parameter estimation was proposed in [10]. Also, a non-iterative ML estimator that tackles the JADE problem in a multi-carrier transmission context was developed in [11] using the IS technique. More recently, we proposed a new ML JADE solution in a non-DA (NDA) single-carrier scenario [12]. Shortly after, we have tackled the same scenario by making IS initialize the differential evolution (DE) technique in [13]. Referred to hereafter as IS-DE, it was a first attempt to tackle JADE by exploiting a bio-inspired optimization approach.

Under this category, GWO has notably been used to optimize and solve many engineering problems. The best-known applications are numerical simulations and stability fields [14,15], feature acquisition selection, dataset classification, neural networks training [16], etc. A multi-objective GWO was developed for cloud computing in [17], and for wireless sensor networks in [18]. It was adapted to a multi-robot application in [19], and to unmanned aerial vehicles (UAVs) in [20]. A GWO-based optimal channel estimation technique was proposed for large-scale MIMO in LTE networks in [21]. A dragonfly-evaluated gray wolf optimization (DA-GWO) model was introduced in [22], which hybridizes the concepts of dragonfly algorithm and GWO for channel estimation in millimeter wave massive MIMO system. In [23], we find also that the GWO algorithm was used only for direction of arrival (DoA) estimation.

Nevertheless, GWO suffers from slow convergence, limited solution accuracy, and susceptibility to getting trapped in local optima. Many improvements to GWO were proposed in different applications [24,25,26,27], but none were to tackle JADE, to the best of our knowledge.

In this paper, we exploit GWO [28] to solve JADE over OFDM SIMO transmissions in multi-path environments. The main idea consists of improving the GWO by initializing the wolf positions using the IS technique instead of random positions. More importantly, and beyond simple initialization of GWO with IS (coined as IS-GWO hereafter), we modify and dynamically update the conventional simple expression for the convergence factor of the GWO algorithm that entirely drives its hunting and tracking mechanisms by accounting for new CDFs derived from the IS technique. Numerical assessments will confirm the advantages of the proposed GWOEIS over IS, GWO, IS-GWO, DE, IS-DE, and other state-of-the-art JADE solutions in terms of estimation accuracy, population or sample size (e.g., number of wolves), global convergence, and convergence speed. The remainder of this paper is organized as follows. Section 2 introduces the multi-carrier SIMO system model in multi-path environments. Section 3 addresses JADE, first by deriving the concentrated likelihood function (CLF), then the IS technique, and ultimately the main common algorithmic steps and the key variations we introduced to some that ultimately encompass GWO, IS-GWO, and the proposed GWOEIS. Section 4 discusses our computer simulations and results, whereas Section 5 concludes our work.

The adopted notations are as follows. Vectors and matrices are represented in lower- and upper-case bold fonts, respectively. Moreover, ${\{.\}}^T$ and ${\{.\}}^H$ denote the conjugate and Hermitian (i.e., transpose conjugate) operators. The Euclidean norm of any vector is denoted as $\left|\right|.\left|\right|$, and ${\mathbf{I}}_N$ denotes the $(N\times N)$ identity matrix. For any matrix $\mathbf{X}$, ${\left[\mathbf{X}\right]}_l$, and ${\left[\mathbf{X}\right]}_{p,l}$, denote its lth column and $(p,l)$th entry, respectively. The kronecker product of any two matrices $\mathbf{X}$ and $\mathbf{Y}$ is denoted as $\mathbf{X}\otimes \mathbf{Y}$. For any vector $\mathbf{x}$, ${\left[\mathbf{x}\right]}_p$ denotes its pth entry or element, and $\mathrm{diag}\left\{\mathbf{x}\right\}$ refers to the diagonal matrix whose elements are those of $\mathbf{x}$. Moreover, $|.|$ returns the modulus of any complex number. Finally, j is the pure imaginary number (i.e., $j^2=-1$), and the notation ≜ is used for definitions.

2. System Model

We consider a SIMO OFDM system characterized by a single transmitting and P receiving antenna elements and K sub-carriers. At each time period, this system transmits over these sub-carriers K symbols $\mathbf{s}={[s_1,s_2,\dots ,s_K]}^T$, all belonging to an M-ary constellation alphabet ${\mathcal{C}}^M$, and are assumed to be known at pilot transmission periods (i.e., replaced a priori by 1) in the DA-type estimation scheme we are adopting here. The transmit data then goes through a multi-path channel consisting of different paths, whose number Q is assumed to be known.

The resulting multi-path SIMO channel is characterized by Q different AoAs $\mathit{\theta }=[{\theta }_1,{\theta }_2,\cdots ,{\theta }_Q]\in \mathcal{U}{\left([{\displaystyle \frac{-\pi }{2}},{\displaystyle \frac{\pi }{2}}]\right)}^Q$; Q different TDs $\mathit{\tau }=[{\tau }_1,{\tau }_2,\cdots ,{\tau }_Q]\in \mathcal{U}{\left([0,{\tau }_{\max }]\right)}^Q$, where ${\tau }_{\max }$ can be chosen to be as large as desired; $\mathcal{U}\left([v_{\min },v_{\max }]\right)$ denotes a uniform distribution over the interval $[v_{\min },v_{\max }]$; and Q complex gains $\mathit{\gamma }={[{\gamma }_1,{\gamma }_2,\cdots ,{\gamma }_Q]}^T$. All these three parameter vectors are assumed to be unknown.

At the receiver side, the observation signal, $x_p(k)$, over the pth antenna and the kth sub-carrier, is given by:

$$x_p(k)=h_p(k)s_k+n_p(k),$$

(1)

where $n_p(k)$ is an additive white Gaussian noise (AWGN) with zero mean and variance ${\sigma }^2$, and $h_p(k)$ is the channel frequency response (CFR), defined as follows:

$$h_p(k)=\sum _{q=1}^Q{\gamma }_q{e}^{-j2\pi k{\Delta }_f{\tau }_q}{e}^{-j2\pi psin({\theta }_q)},$$

(2)

where ${\Delta }_f$ is the sub-carrier spacing. By stacking, the scalar signal observation in (1) received at each kth sub-carrier into a single observation vector $\mathbf{x}(k)={[x_1(k),x_2(k),\cdots ,x_P(k)]}^T$ is modeled as follows:

$$\mathbf{x}(k)=\mathbf{h}(k)s_k+\mathbf{n}(k),$$

(3)

where $\mathbf{n}(k)={[n_1(k),n_2(k),\dots ,n_P(k)]}^T$ is an i.i.d. and spatially uncorrelated zero-mean Gaussian noise vector and $\mathbf{h}(k)$ is the $P\times 1$ CFR vector over all antennas, defined as:

$$\begin{array}{ccc}\hfill \mathbf{h}(k)& =& \sum _{q=1}^Q\mathbf{a}({\theta }_q){\gamma }_q{e}^{-j2\pi k{\Delta }_f{\tau }_q}\hfill \end{array}$$

(4)

$$\begin{array}{ccc}& =& \overline{\mathbf{A}}(\mathit{\theta }){\mathbf{D}}_k(\mathit{\tau })\mathit{\gamma },\hfill \end{array}$$

(5)

where $\overline{\mathbf{A}}(\mathit{\theta })\triangleq [\mathbf{a}({\theta }_1),\mathbf{a}({\theta }_2),\dots ,\mathbf{a}({\theta }_Q)]$ is a $P\times Q$ steering matrix, $\mathbf{a}(\theta )$ is the $P\times 1$ steering vector at AoA $\theta$ defined for simplicity and without loss of generality here over a uniform linear array (ULA) as:

$$\begin{array}{c}\hfill \mathbf{a}(\theta )\triangleq {\left[1,e^{-j\pi sin(\theta )},\cdots ,e^{-j(P-1)\pi sin(\theta )}\right]}^T,\end{array}$$

and ${\mathbf{D}}_k(\mathit{\tau })\triangleq \mathrm{diag}(e^{-j2\pi \overline{k}{\Delta }_f{\tau }_1},e^{-j2\pi \overline{k}{\Delta }_f{\tau }_2},\cdots ,e^{-j2\pi \overline{k}{\Delta }_f{\tau }_Q})$ is the $Q\times Q$ TDs matrix, in which $\overline{k}$ is some index translation of $k=1,\cdots ,K$ (e.g., $\overline{k}=k-1$, $\overline{k}=k-K/2-1$ if K is even, $\overline{k}=k-(K-1)/2$ if K is odd, etc.), with no impact at all on what follows.

For an even more compact notation, we now stack the $P\times 1$ CFR vector $\mathbf{h}(k)$ over all sub-carriers to obtain the $KP\times 1$ total CFR vector $\mathbf{H}$ as follows:

$$\mathbf{H}={[\dots ,\mathbf{h}{(k)}^T,\dots ]}^T=\mathbf{A}(\mathit{\theta })\mathbf{D}(\mathit{\tau })\mathit{\gamma },$$

(6)

where $\mathbf{A}(\mathit{\theta })$ is the $KP\times KQ$ steering matrix defined as:

$$\mathbf{A}(\mathit{\theta })=\mathrm{diag}\left\{\overline{\mathbf{A}}(\mathit{\theta }),\overline{\mathbf{A}}(\mathit{\theta }),\cdots ,\overline{\mathbf{A}}(\mathit{\theta })\right\},(Ktimes)$$

(7)

and $\mathbf{D}(\mathit{\tau })$ is the $KQ\times Q$ TDs matrix defined as:

$$\mathbf{D}(\mathit{\tau })\triangleq {\left[{\mathbf{D}}_1{(\mathit{\tau })}^T{\mathbf{D}}_2{(\mathit{\tau })}^T\cdots {\mathbf{D}}_K{(\mathit{\tau })}^T\right]}^T.$$

(8)

Hence, at pilot period transmissions where sub-carriers are not modulated (i.e., $s_k=1$), after we stack both $\mathbf{x}(k)$ and $\mathbf{n}(k)$ in the same way we did to transform $\mathbf{h}(k)$ into $\mathbf{H}$, we obtain:

$$\mathbf{X}=\mathbf{H}+\mathbf{N}.$$

(9)

3. Joint Angle and Delay Estimation (JADE)

3.1. Derivation of the CLF

At any given pilot transmission period, we can derive the log-likelihood function (LLF) that depends on all three unknown parameter vectors $\mathit{\theta }$, $\mathit{\tau }$, and $\mathit{\gamma }$ as follows:

$$\begin{array}{ccc}\hfill \mathcal{L}\left(\mathit{\theta },\mathit{\tau },\mathit{\gamma }\right)& =& \left|\right|\mathbf{X}-\mathbf{H}|{|}^2=||\mathbf{X}-\mathbf{A}(\mathit{\theta })\mathbf{D}(\mathit{\tau })\mathit{\gamma }|{|}^2.\hfill \end{array}$$

(10)

Hence, we can estimate $\mathit{\gamma }$ using the least squares (LS) solution as follows:

$$\begin{array}{ccc}\hfill {\widehat{\mathit{\gamma }}}_{\mathrm{LS}}& =& {\left[\mathbf{A}(\mathit{\theta })\mathbf{D}(\mathit{\tau })\right]}^{†}\mathbf{x}={\mathbf{B}}^{†}\mathbf{x},\hfill \end{array}$$

(11)

where ${\mathbf{B}}^{†}={\left({\mathbf{B}}^H\mathbf{B}\right)}^{-1}\mathbf{B}$ is the Moore–Penrose pseudo-inverse of $\mathbf{B}$. By injecting ${\widehat{\mathit{\gamma }}}_{\mathrm{LS}}$ into (10), we obtain the CLF:

$${\mathcal{F}}_c\left(\mathit{\theta },\mathit{\tau }\right)={\mathbf{x}}^H\mathbf{B}{({\mathbf{B}}^H\mathbf{B})}^{-1}{\mathbf{B}}^H\mathbf{x}.$$

(12)

Hence, we can obtain the joint ML estimates of $\mathit{\theta }$ and $\mathit{\tau }$ as the optimal solution ${\Xi }_{opt}$ to the following optimization problem:

$${\Xi }_{opt}\triangleq [{\mathit{\theta }}_{opt},{\mathit{\tau }}_{opt}]=\underset{\Xi \triangleq [\mathit{\theta },\mathit{\tau }]}{argmax}\left({\mathcal{F}}_c\left(\mathit{\theta },\mathit{\tau }\right)\right).$$

(13)

3.2. Overview/Summary of IS for ML DA JADE

We start by approximating ${\mathbf{B}}^H\mathbf{B}$ in (12) as follows:

$$\begin{array}{c}\hfill {\mathbf{B}}^H\mathbf{B}\approx PK{\mathbf{I}}_Q,\end{array}$$

(14)

where ${\mathbf{I}}_Q$ denotes the $(Q\times Q)$ identity matrix. Then, we plug (14) into (12) to obtain:

$$\begin{array}{ccc}\hfill {\mathcal{F}}_c\left(\mathit{\theta },\mathit{\tau }\right)& \approx & {\displaystyle \frac{1}{PK}}{\mathbf{x}}^H\mathbf{B}{\mathbf{B}}^H\mathbf{x}\approx {\displaystyle \frac{1}{PK}}\left|\right|{\mathbf{B}}^H\mathbf{x}{\left|\right|}^2,\hfill \\ & \approx & {\displaystyle \frac{1}{PK}}\sum _{q=1}^Q|\sum _{k=1}^K{\left[\overline{\mathbf{A}}(\theta ){\mathbf{D}}_k(\tau )\right]}^H\mathbf{x}(k){|}^2.\hfill \end{array}$$

(15)

Now, injecting the expressions of $\overline{\mathbf{A}}(\theta )$ and ${\mathbf{D}}_k(\tau )$ into (15), we obtain the approximate CLF:

$${\mathcal{F}}_c(\mathit{\theta },\mathit{\tau })\approx {\displaystyle \frac{1}{PK}}\sum _{q=1}^Q\psi ({\theta }_q,{\tau }_q),$$

(16)

where $\psi (\theta ,\tau )$ is the so-called periodogram of the observation signal [11] given by:

$$\begin{array}{ccc}\hfill \psi (\theta ,\tau )& =& |\sum _{p=1}^P\sum _{k=1}^K{e}^{-j\pi (p-1)sin(\theta )}{e}^{-j2\pi \overline{k}\Delta f\tau }{x}_p^{*}(k){|}^2.\hfill \end{array}$$

(17)

Relying on the observations made above, we summarize the IS process in [11] of generating the R realizations of the AoA-TD couples according to the following steps:

• Step (1): we start by evaluating the periodogram $\psi ({\theta }_i,{\tau }_j)$ in (17) at all grid points $({\theta }_i,{\tau }_j)\in \Gamma ({\displaystyle \frac{-\pi }{2}},{\displaystyle \frac{\pi }{2}},{\delta }_{\theta })\times \Gamma (0,{\tau }_{\max },{\delta }_{\tau })$ where $\Lambda (v_{\min },v_{\max },{\delta }_v)$ denotes the set of points obtained over the interval $[v_{\min },v_{\max }]$ with a uniform sampling step ${\delta }_v$.
• Step (2): we evaluate the so-called joint pseudo-pdfs [11] set of values over the above AoA-TD grid as follows:

  $$\begin{array}{c}\hfill \overline{\Phi }({\theta }_i,{\tau }_j)={\displaystyle \frac{exp\left\{{\rho }_1\psi ({\theta }_i,{\tau }_j)\right\}}{{\displaystyle \sum _i\sum _{j}exp\left\{{\rho }_1\psi ({\theta }_i,{\tau }_j)\right\}{\delta }_{\theta }{\delta }_{\tau }}}},\end{array}$$

  (18)

  where ${\rho }_1$ is a design parameter to be chosen properly later on.
• Step (3): we evaluate the marginal pseudo-pdf of ${\tau }_j$ as follows:

  $$\begin{array}{c}\hfill {\displaystyle {\overline{\varphi }}_{\tau }({\tau }_j)=\sum _i{\overline{\varphi }}_{\theta ,\tau }({\theta }_i,{\tau }_j){\delta }_{\theta }.}\end{array}$$

  (19)

Then, we can find the initial TD estimates that correspond to the Q maxima of (19) as:

$$\begin{array}{c}\hfill \left[{\widehat{\tau }}_1^0,{\widehat{\tau }}_2^0,\cdots ,{\widehat{\tau }}_Q^0\right]=\underset{\tau }{argmax}{|}_Q\left({\overline{\varphi }}_{\tau }(\tau )\right),\end{array}$$

(20)

where ${argmax|}_Q(f)$ returns the Q maxima of the function f.

• Step (4): for $q=1,2,\cdots ,Q$, we compute the pseudo-CDF of ${\tau }_j$ as follows:

  $$\begin{array}{c}\hfill {\mathcal{J}}_{{\tau }_q}({\tau }_j)=\sum _{l\le j}{\overline{\varphi }}_{{\tau }_q}({\tau }_l){\delta }_{\tau }\forall {\tau }_l\in {\lambda }_{{\widehat{\tau }}_q^0},\end{array}$$

  (21)

  where

  $${\lambda }_{{\widehat{\tau }}_q^0}=\Gamma \left({\widehat{\tau }}_q^0-{\Delta }_{\tau },{\widehat{\tau }}_q^0+{\Delta }_{\tau },{\delta }_{\tau }\right).$$

  (22)
• Step (5): For $q=1,2,\cdots ,Q$, we generate R realizations ${\left\{u_q^{(r)}\sim \mathcal{U}\left([0,1]\right)\right\}}_{r=1}^R$. Then, we apply a linear interpolation to obtain the rth TD realization:

  $${\widehat{\tau }}_q^{(r)}={\mathcal{J}}_{{\tau }_q}^{-1}(u_q^{(r)}).$$

  (23)
• Step (6): We evaluate the conditional pseudo-pdf of $\theta$ given $\tau ={\widehat{\tau }}_q^0$ for $q=1,2,\cdots ,Q$ as follows:

  $$\begin{array}{c}\hfill {\overline{\varphi }}_{\theta |\tau }({\theta }_i|{\widehat{\tau }}_q^0)={\displaystyle \frac{{\overline{\varphi }}_{\theta ,\tau }({\theta }_i,{\widehat{\tau }}_q^0)}{{\overline{\varphi }}_{\tau }({\widehat{\tau }}_q^0)}}.\end{array}$$

  (24)

Then, we obtain the initial Q AoA estimates as:

$$\begin{array}{c}\hfill {\widehat{\theta }}_q^0=\underset{\theta }{argmax}\left({\overline{\varphi }}_{\theta |\tau }(\theta |{\widehat{\tau }}_q^0)\right)forq=1,\cdots ,Q.\end{array}$$

(25)

• Step (7): similarly to Step 4, we compute the conditional pseudo-CDF as:

  $$\begin{array}{c}\hfill {\mathcal{J}}_{{\theta }_q|{\tau }_q}({\theta }_j|{\widehat{\tau }}_q^{(r)})=\sum _{l\le j}{\overline{\varphi }}_{\theta |\tau }({\theta }_i|{\widehat{\tau }}_q^{(r)}){\delta }_{\tau }\forall {\theta }_l\in {\lambda }_{{\widehat{\theta }}_q^0}.\end{array}$$

  (26)

  where

  $${\lambda }_{{\widehat{\theta }}_q^0}=\Gamma \left({\widehat{\theta }}_q^0-{\Delta }_{\theta },{\widehat{\theta }}_q^0+{\Delta }_{\theta },{\delta }_{\theta }\right).$$

  (27)
• Step (8): Similarly to Step 5, we generate R realizations ${\left\{u_q^{(r)}\sim \mathcal{U}\left([0,1]\right)\right\}}_{r=1}^R$ for $q=1,2,\cdots ,Q$. Then, we apply a linear interpolation to obtain the rth AoA realization:

  $${\widehat{\theta }}_q^{(r)}={\mathcal{J}}_{{\theta }_q|{\tau }_q}^{-1}(u_q^{(r)}).$$

  (28)

Thus, we are able to generate R JADE realizations as:

$${\left\{{\widehat{\mathit{\theta }}}^{(r)}\right\}}_{r=1}^R\mathrm{and}{\left\{{\widehat{\mathit{\tau }}}^{(r)}\right\}}_{r=1}^R,$$

(29)

where ${\widehat{\mathit{\theta }}}^{(r)}=\left[{\widehat{\theta }}_1^{(r)},{\widehat{\theta }}_2^{(r)},\cdots ,{\widehat{\theta }}_Q^{(r)}\right]$ is the AoAs vector estimate, and ${\widehat{\mathit{\tau }}}^{(r)}=\left[{\widehat{\tau }}_1^{(r)},{\widehat{\tau }}_2^{(r)},\cdots ,{\widehat{\tau }}_Q^{(r)}\right]$ is the TDs vector estimate. These realizations readily enable the direct implementation of an IS ML solution to (13) as:

$${\widehat{\Xi }}_{IS}=\left[{\widehat{\mathit{\theta }}}_{IS}={\displaystyle \frac{{\sum }_{r=1}^R{\widehat{\mathit{\theta }}}^{(r)}}{R}},{\widehat{\mathit{\tau }}}_{IS}={\displaystyle \frac{{\sum }_{r=1}^R{\widehat{\mathit{\tau }}}^{(r)}}{R}}\right].$$

(30)

3.3. GWO vs. Combining|Embedding IS (IS-GWO|GWOEIS)

GWO is inspired by the leadership hierarchy and the hunting mechanism of gray wolves in nature [28]. In a pack or population of, say, $R^{\prime }$ individuals, we identify four types of gray wolves that emulate their leadership hierarchy: the $\alpha$-type are responsible for making hunting decisions (representing the solutions with best results). The $\beta$-type help the $\alpha$-type in decision making and act as their best substitute-candidates when one of them becomes old or dies (second-best solutions in the population). The $\delta$-type have only to submit to the $\alpha$- and $\beta$-types (third-best solutions). And the $\omega$-type are of the lowest rank, and must yield to the dominant ones. Guided by this “social” hierarchy’s rules, gray wolves proceed to hunt along three main and consecutive stages: (1) tracking, chasing, and approaching the prey; (2) pursuing, encircling, and harassing it once it stops moving; and (3) attacking it.

Mathematically and generally speaking, GWO translates the leadership hierarchy and the hunting mechanism summarily described above due to lack of space into an optimization by search (i.e., hunting) in any multi-dimensional space whose best solution (i.e., prey) that minimizes a given criterion (i.e., so-called “fitness function”) is found in an iterative manner by mimicking the gray wolves (i.e., search agents) hunting behavior (i.e., search adaptation rules).

In the present case, ${\Xi }_{opt}\triangleq [{\mathit{\theta }}_{opt},{\mathit{\tau }}_{opt}]$ and $-{\mathcal{F}}_c\left(\mathit{\theta },\mathit{\tau }\right)$ in (13) stand, respectively, for the prey to be hunted and the fitness function to be minimized in a $2Q$-dimensional space. Hence, GWO translates as follows:

• Step (1): first, the wolves’ positions are initialized in the $2Q$ space according to one of the following cases (a) or (b).
• Step (1.a) [GWO]: The conventional GWO initially places the wolves pack of $R^{\prime }=R$ individuals at random positions in the $2Q$ search space ${\left\{{\Sigma }_0^{(r)}\right\}}_{r=1}^R=\left\{\{{\Sigma }_{\theta }^{(r)},{\Sigma }_{\tau }^{(r)}\right\}{\}}_{=1}^R$ where ${\Sigma }_{\theta }^{(r)}={\left\{\mathcal{U}\left([-{\displaystyle \frac{\pi }{2}},{\displaystyle \frac{\pi }{2}}\right)\right\}}_{q=1}^Q$ and ${\Sigma }_{\tau }^{(r)}={\left\{\mathcal{U}\left([0,{\tau }_{\max }]\right)\right\}}_{q=1}^Q$. Hence, it requires larger packs and longer hunting (iterations) to catch the prey, i.e., find the correct angles of arrival (AoAs) and time delays (TDs) without guaranteeing global convergence.
• Step (1.b) [IS-GWO or GWOEIS]: Instead of random initial placement, IS-GWO and GWOEIS position the wolves at ${\left\{{\Sigma }_0^{(r)}\right\}}_{r=1}^R={\left\{{\zeta }^{(r)}=\left\{{\theta }_1^{(r)},\cdots ,{\theta }_Q^{(r)},{\tau }_1^{(r)},\cdots ,{\tau }_Q^{(r)}\right\}\right\}}_{r=1}^R$, stemming from the $R^{\prime }=R$ realizations generated in (29). Hence, even with relatively less realizations, this still guarantees global convergence, and it would always provide good-enough rough initialization values to GWOEIS to make the latter converge much faster and more accurately with relatively less hunting iterations.
• Step (2): at each iteration ${\left\{t\right\}}_{t=1}^{T_H}$ over the hunt duration $T_H$, $-{\mathcal{F}}_c\left(\Sigma \right)$ is evaluated over each individual ${\Sigma }_{t-1}^{(r)}$ in the pack, and the fittest three that better minimize it are identified as ${\Sigma }_{t-1}^{\alpha }$, ${\Sigma }_{t-1}^{\beta }$, and ${\Sigma }_{t-1}^{\delta }$, respectively.
• Step (3): the so-called convergence factor $a_t$ guiding the hunt is updated according to one of the following cases (a) or (b).
• Step (3.a) [GWO or IS-GWO]: $a_t=2(1-{\displaystyle \frac{t}{T_H}})$ is simply set to decrease linearly from 2 to 0 over the hunt duration $T_H$. Therefore, the positions of the wolves to converge to local minima.
• Step (3.b) [GWOEIS]: To improve and speed up convergence, instead of a common convergence factor, each realization or individual in the pack is assigned one of its own that accounts both for the AoA and TD pseudo-CDFs calculated in Steps (4) and (7) of the IS technique (cf. Section 3.2) as follows:

  $$a_{j,t}^{(r)}={\displaystyle \frac{u_j^{(r)}}{t}},$$

  (31)

  where $u_j^{(r)}\sim \mathcal{U}\left([{ϵ}_j^{(r)},{\varrho }_j^{(r)}]\right)$, $j=\{1,2,\cdots ,2Q\}$ is the dimension index, and

  $${ϵ}_j^{(r)}=\left\{\begin{array}{c}\max \left\{{\mathcal{J}}_{{\theta }_j|{\tau }_j}{({\Sigma }_t^{(r)})}_j,{\mathcal{J}}_{{\theta }_j|{\tau }_j}({\widehat{\theta }}_j^0)\right\},j=\{1,\cdots ,Q\}\hfill \\ \max \left\{{\mathcal{J}}_{{\tau }_{j^{\prime }}}{({\Sigma }_t^{(r)})}_{j^{\prime }},{\mathcal{J}}_{{\tau }_{j^{\prime }}}({\widehat{\tau }}_{j^{\prime }}^0)\right\},j=\{Q+1,\cdots ,2Q\}\hfill \end{array}\right.$$

  (32)

  $${\varrho }_j^{(r)}=\left\{\begin{array}{c}\min \left\{{\mathcal{J}}_{{\theta }_j|{\tau }_j}{({\Sigma }_t^{(r)})}_j,{\mathcal{J}}_{{\theta }_j|{\tau }_j}({\widehat{\theta }}_j^0)\right\},j=\{1,\cdots ,Q\}\hfill \\ \min \left\{{\mathcal{J}}_{{\tau }_{j^{\prime }}}{({\Sigma }_t^{(r)})}_{j^{\prime }},{\mathcal{J}}_{{\tau }_{j^{\prime }}}({\widehat{\tau }}_{j^{\prime }}^0)\right\},j=\{Q+1,\cdots ,2Q\}\hfill \end{array}\right.$$

  (33)

  where ${(\mathcal{S})}_i$ denotes the i-th element of the set $\mathcal{S}$. ${\widehat{\tau }}_q^0$ and ${\widehat{\theta }}_q^0$ are the initial TD and AoA IS estimates obtained in (20) and (25), respectively, and $j^{\prime }=j-Q$.

When using the linearly decreasing factor in Step (3.a), the positions of the wolves can converge to local minima. To mitigate this issue, we generate for each individual a specific convergence factor that decreases with the iteration index while accounting through the pseud-CDF values for the distance between the gray wolves and the prey. As long as a wolf is far away from the prey, the uniform variable will generate realizations closer to 1. Once this wolf gets closer to the prey, the realization becomes quasi-static since, the convergence factor is then mainly scaled by $1/t$.

• Step (4): For each lead gray wolf $\ast =\alpha$, $\beta$, or $\delta$, we generate two random values, $b_j^{*}$ and $d_j^{*},$ in $\mathcal{U}\left([0,1]\right)$ for the calculation of two update coefficients $g_{j,t}^{*}$ (or $g_{j,t}^{*,(r)}$ with respect to each realization or individual r in the pack), and $c_j^{*}$ according to one of the following cases (a) or (b).
• Step (4.a) [GWO or IS-GWO]:

  $$g_{j,t}^{*}=2a_t{b}_j^{*}-a_t,\mathrm{and}{c}_j^{*}=2d_j^{*}.$$

  (34)

In other words, the update coefficients $g_{j,t}^{*}$ and $c_j^{*}$ are assigned random values in $[-a_t,a_t]$ and $[0,2]$, respectively.

• Step (4.b) [GWOEIS]:

  $$g_{j,t}^{*,(r)}=2a_{j,t}^{(r)}{b}_j^{*}-a_{j,t}^{(r)},\mathrm{and}{c}_j^{*}=2d_j^{*}.$$

  (35)

Here, $g_{j,t}^{*,(r)}$ is assigned a random value in $[-a_{j,t}^{(r)},a_{j,t}^{(r)}]$.

• Step (5): Let $\mathrm{dist}(*,(r),j)=|c_j^{*}{({\Sigma }_{t-1}^{*})}_j-{({\Sigma }_{t-1}^{(r)})}_j|$ denote the distance between the lead wolf * and the rth individual in the pack (or search agent) across the j-th dimension. The lead wolves’ positions are then updated with respect to each realization r in the pack through intermediate variables ${\chi }_{*}^{(r)}$ according to one of the following cases (a) or (b).
• Step (5.a) [GWO or IS-GWO]:

  $${({\chi }_{*}^{(r)})}_j={({\Sigma }_{t-1}^{*})}_j-g_{j,t}^{*}\mathrm{dist}(\ast ,(r),j).$$

  (36)
• Step (5.b) [GWOEIS]:

  $${({\chi }_{*}^{(r)})}_j={({\Sigma }_{t-1}^{*})}_j-g_{j,t}^{*,(r)}\mathrm{dist}(\ast ,(r),j).$$

  (37)

Hence, before coming back to Step (2) if $t<T_H$, each individual’s location is updated in either case based on these intermediate variables ${\chi }_{*}^{(r)}$ as follows:

$${({\Sigma }_t^{(r)})}_j={\displaystyle \frac{{({\chi }_{\alpha }^{(r)})}_j+{({\chi }_{\beta }^{(r)})}_j+{({\chi }_{\delta }^{(r)})}_j}{3}}.$$

(38)

Figure 1 depicts the way to update a search agent’s position according to $\alpha$-type, $\beta$-type, and $\delta$-type wolves based on (37) and (38) for the proposed GWOEIS algorithm. Finally, the joint AoA-TD estimate ${\widehat{\Xi }}_{\mathrm{Tech}}=\left[{\widehat{\mathit{\theta }}}_{\mathrm{Tech}},{\widehat{\mathit{\tau }}}_{\mathrm{Tech}}\right]$ is selected as the last position of the lead wolf $\alpha$:

$$\begin{array}{c}\hfill {\widehat{\Xi }}_{\mathrm{Tech}}=[{({\Sigma }_{T_H}^{\alpha })}_1,\dots ,{({\Sigma }_{T_H}^{\alpha })}_Q,{({\Sigma }_{T_H}^{\alpha })}_{Q+1},\dots ,{({\Sigma }_{T_H}^{\alpha })}_{2Q}],\end{array}$$

(39)

where the choice of Tech ∈ {“GW0”, “IS-GWO”, “GWOEIS”} determines the cases considered in Steps (1), (3), (4), and (5). We summarize the GWOEIS algorithm in Figure 2.

4. Simulation Results

In this section, we assess the performance of the proposed GWOEIS solution and other key benchmarks for comparisons in terms of the root mean square error (RMSE) or the normalized MSE (NMSE) over a total number of Monte-Carlo runs $M_c=1000$. Following the IEEE 802.11ac standard (see [7] and first reference therein), we consider a bandwidth $B=80$ MHz with a sub-carrier spacing ${\Delta }_f=312.5$ KHz giving a total of 256 sub-carriers, among which 11 are exploited for network signaling purposes and the remainder are payload carriers (i.e., $K=122$). We also consider $P=6$ antennas and $Q=2$ equi-powered paths with AoAs ${20}^{\circ }$ and ${45}^{\circ }$ and TDs 25 ns and $62.5$ ns, respectively. Moreover, we set ${\rho }_1=4$, ${\delta }_{\tau }=1.25$ ns, ${\delta }_{\theta }={0.1}^{\circ }$, ${\Delta }_{\tau }=18.75$ ns, and ${\Delta }_{\theta }={10}^{\circ }$.

In Figure 3 and Figure 4, we evaluate the RMSE/NMSE performance versus the SNR to compare the new GWOEIS solution against the Cramér–Rao lower bound (CRLB) of [6], the UMP algorithm in [7], the classic GWO in [28], the classic DE [13], the IS technique in [11], IS-DE that simply combines DE with IS in [13], and another benchmark version developed here by simply combining this time IS with GWO, referred to as IS-GWO.

As shown in Figure 3 and Figure 4, our approach outperforms all other estimation techniques, both in terms of TD and AoA estimations. Additionally, it reaches the CRLB, even at low SNR levels and even with a very low value either parameter $R=30$ and $T_H=30$. We also observe a severe performance degradation of the original GWO and DE techniques due to the high dimension (i.e., $2Q$) of the optimization problem. When combined with IS, IS-DE improves a little but is outperformed by IS-GWO, and more so by GWOEIS.

In Figure 3c and Figure 4c, we compare the channel NMSE using the estimates of the TDs and AoAs assuming a perfect knowledge of the channel gains. Our approach remarkably outperforms all other estimation techniques and reaches the lower bound, even at very low SNR levels and even with a very low value either parameter $R=30$ and $T_H=30$.

In Figure 5 and Figure 6, we assess the impact of the samples size R and the hunting duration $T_H$ on channel estimation performance versus the SNR. Here, the sample size R refers to the number of realizations with IS, to the wolves pack size with GWO, IS-GWO, and GWOEIS, or the number of individuals with DE and IS-DE. The number of iterations (e.g., $T_H$) is defined only for iterative approaches, i.e., GWO, IS-GWO, GOWEIS, DE, and IS-DE solutions. We notice that both parameters can have a detrimental effect on the exploration abilities of these techniques. Thus, they need to be set as large as possible to cover the widest area of the multidimensional space.

In Figure 5(a,i,b,i,c,i), we assess the estimation performance of the TD, the AoA, and the channel, respectively. GWOEIS, IS-GWO, and IS performs better than DE, GWO, and IS-DE. Figure 5(a,ii,b,ii,c,ii) show the minimum RMSE over all techniques for TD, AoA, and channel estimation, respectively. The RMSE decreases when R and SNR increase. In Figure 5(a,iii,b,iii,c,iii), we can see that GWOEIS achieves the best performance in terms of TD, AoA, and channel estimation over $R\ge 20$ and all SNR values. IS, IS-GWO, GWO, DE, and IS-DE can not match the performance of GWOEIS, even with $R=1000$, but at the expense of significant increase in computational cost.

In Figure 6, we assess the impact of $T_H$ on RMSE performance of the iterative techniques. Once again, GWOEIS outperforms all other iterative techniques in terms of TD, AoA, and channel estimation. By increasing the number of iterations, we reach the best performance for the all algorithms, as shown in Figure 6(a,ii,b,ii,c,ii). Moreover, in Figure 6(a,iii,b,iii,c,iii), we notice that a small order of 10 iterations is enough to put GWOEIS on the top of the rest, with estimation accuracy gains constantly increasing with $T_H$, making its potential gains in computational complexity remarkably large when compared to other techniques that require a very high number of iterations.

In Figure 7, we investigate the effect of the number of paths on the estimation performance. We observe that the new approach, GWOEIS, outperforms most of the benchmarks in the high and low SNR scenarios for TD, AoA, and channel estimation when $Q\le 4$.

We consider also the same configuration to evaluate the performance of all of the approaches in terms of temporal and angular separations. In Figure 8, we fix the first delay at ${\tau }_1=2T$, and we vary the second delay at ${\tau }_2={\tau }_1+\Delta \tau$. It is clearly seen that our approach is still capable of achieving the CRLB, even in a challenging scenario with a very small temporal separations of $\Delta \tau =0.5T$. In Figure 9, we fix the first AoA at ${\theta }_1=-{20}^{\circ }$, and we vary the second AoA ${\theta }_2={\theta }_1+\Delta \theta$. Here, again, we can highlight the robustness and the super-resolution capacity of our approach, and to appreciate its superiority in challenging scenarios where the paths are closely spaced in both temporal and spatial domains. We have to mention that Figure 8(a,iii,b,iii,c,iii) show the superiority of UMP reaching the best techniques achieving minimum RMSE only when ${\Delta }_{\tau }\ge 10/B$.

5. Conclusions

In this work, we presented a new DA ML JADE estimator over OFDM SIMO multi-path channels referred to as GWOEIS, whose key innovation lies in exploiting and embedding the powerful IS concept to avoid the random initialization issues of the traditional GWO, and to significantly improve the hunting mechanism. GWOEIS ensures faster convergence by providing initial estimates based on a simplified importance function. More importantly, and beyond simple initialization of GWO with IS, we modify and dynamically update the conventional simple expression for the convergence factor of the GWO algorithm that entirely drives its hunting and tracking mechanism by accounting for new CDFs derived from the IS technique. The latter significantly boost the estimation performance. Overall, the simulation results show more accurate estimation performance at faster convergence rates with GWOEIS.