Direction of Arrival Estimation of Generalized Nested Array via Difference–Sum Co-Array

Abstract

To address the weakness that the difference co-array (DCA) only enhances the degrees of freedom (DOFs) to a limited extent, a new configuration called the generalized nested array via difference–sum co-array (GNA-DSCA) is proposed for direction of arrival (DOA) estimation. We consider both the temporal and spatial information of the array output to construct the DSCA model, based on which the DCA and sum co-array (SCA) of the GNA are systematically analyzed. The closed-form expression of the DOFs for the GNA-DSCA is derived under the determined dilation factors. The optimal results show that the GNA-DSCA has a more flexible configuration and more DOFs than the GNA-DCA. Moreover, the larger dilation factors yield significantly wider virtual aperture, which indicates that it is more attractive than the reported DSCA-based sparse arrays. Finally, a hole-filling strategy based on atomic norm minimization (ANM) is utilized to overcome the degradation of the estimation performance due to the non-uniform virtual array, thus achieving accurate DOA estimation. The simulation results verify the superiority of the proposed configuration in terms of virtual array properties and estimation performance.

1. Introduction

Direction of arrival (DOA) estimation has increasingly become a hot topic in the field of array signal processing since it is continually encountered in many applications, such as radar, wireless communication and automatic driving [1,2,3,4,5,6,7,8,9,10,11,12,13]. In the past half century, numerous subspace-based algorithms [10,11] and sparse reconstruction approaches [12,13] have been proposed to estimate the incident direction of multiple sources. It is well known that, for an $N$-sensor uniform linear array (ULA), the above methods can only identify up to $N-1$ sources. Therefore, additional sensors are required in the ULA to achieve the desired estimation performance, which dramatically increases the system’s overhead and hardware costs. Nevertheless, in practical scenarios, such as unmanned driving and 5G communication, the number of sources is greater than that of sensors. Consequently, the contradiction between economic cost and realistic demand leads to underdetermined DOA estimation as a very tricky problem.

To tackle this deficiency, a Khatri–Rao subspace approach was reported in [14], thus $2N-2$ sources can be resolved by an $N$-sensor ULA. The nested array (NA) [15] with $N_1+N_2$ sensors was subsequently proposed in conjunction with the Khatri–Rao product to provide $2N_2\left(N_1+1\right)-1$ degrees of freedom (DOFs), which significantly increases the number of estimable sources. Moreover, the same process was applied to the coprime array (CPA) [16] with $M+N-1$ sensors to generate $MN+M+N-2$ DOFs, where $M$ and $N$ are a pair of integers. Inspired by the Khatri–Rao concept, extensive efforts have been devoted to designing sensor arrays with more DOFs to improve the estimation performance. At present, various new sparse arrays have been derived from NA and CPA, including the super nested array [17,18], augmented nested array [19], generalized nested array (GNA) [20], generalized coprime array [21], thinned coprime array [22], padded coprime array [23], enhanced and generalized sparse arrays [24,25,26], and coprime planar array [27], etc. Unfortunately, some sparse arrays designed to suppress the mutual coupling have a non-uniform difference co-array (DCA), indirectly degrading the performance of the co-array subspace-based algorithms [28,29]. To fully extract all the information contained in the non-uniform virtual array, a sparsity-based DOA estimation method based on the Least Absolute Shrinkage and Selection Operator (LASSO) was proposed in [30], which offers more DOFs than the co-array MUSIC algorithm [28]; yet, the predefined spatial grids result in basis mismatch or enormous complexity. To cope with both the information loss and the high computation requirements, a multifrequency method [31] was proposed to fill the holes in the DCA, and thus all DOFs can be utilized to perform spectra estimation, whereas it requires the sources to have sufficient bandwidth. Most recently, a class of DOA estimation algorithms for coprime arrays via virtual array interpolation [32,33,34,35,36] has triggered wide concern because, in contrast to [30], these approaches do not need to predefine the sampling grids. In [32], the nuclear norm minimization and the matrix completion principle were developed to recover the missing lags at the hole locations; thus, the virtual array is directly expanded to a continuous ULA. Furthermore, the minimum number of virtual arrays required to accomplish the matrix completion was defined in [33]. In [35], the restoration problem of the interpolated virtual sensors is solved by minimizing the atomic norm of the observation vector.

Although the aforementioned sparse arrays and DOA estimation algorithms can identify more sources than the number of physical sensors, only the DCA is considered, while the information contained in the sum co-array (SCA) is completely ignored. However, active sensing shows that the SCA has the capacity to further enhance the DOFs [37,38,39]. With that in mind, a vectorized conjugate-augmented MUSIC estimator for a CPA was presented in [40] by using both the temporal and spatial information of the array output to construct the difference–sum co-array (DSCA), providing more DOFs than the DCA. Following this concept, the DSCA properties of the NA were analyzed in [41], based on which a novel configuration called the diff–sum nested array (DsNA) was proposed. The DsNA is obtained by moving nearly half of the dense sensors in the NA to the right area of the sparse ULA, yielding a larger virtual aperture, while reducing the redundant lags. In [42], the concept of a translation nested array (TNA) was defined. Then, two improved nested arrays (INAwSDCA−I and INAwSDCA−II) with more consecutive DOFs were derived by rearranging the sensor positions of the TNA.

To alleviate the mutual coupling, while increasing the DOFs, we develop the GNA via the DSCA (GNA-DSCA) for DOA estimation. Different to the GNA-DCA [20], which only exploits the spatial information, the GNA-DSCA utilizes both the temporal and spatial information to obtain the delay correlations. Furthermore, the additional information is contained in the sum co-array. Therefore, compared with the GNA-DCA, the GNA-DSCA is an improved method which can form the difference–sum co-array. Specifically, the closed-form expression of the DOFs is derived, which can be expressed as a function of the dilation factors and the number of sensors. The best results show excellent properties as follows: (1) Compared with the GNA-DCA [20], the GNA-DSCA can pick more dilation factors and thus has more flexible configurations. (2) The GNA-DSCA provides more consecutive lags with about twice the maximum DOFs as the GNA-DCA. (3) The GNA-DSCA has a larger virtual array aperture than the existing DSCA-based sparse arrays, including the CPA-DSCA [40], DsNA [41], INAwSDCA−I [42] and INAwSDCA−II [42]. Then, a hole-filling strategy based on atomic norm minimization (ANM) is elaborated, with the aim of overcoming the discontinuity of the virtual domain. Based on the reconstructed Toeplitz matrix, we achieve accurate DOA estimation for the GNA-DSCA.

Notations: Matrices and vectors are represented by upper-case italic bold letters (e.g., $\mathit{A}$) and lower-case italic bold letters (e.g., $\mathit{a}$). In particular, ${\mathit{I}}_M$ is the $M\times M$ identity matrix. The superscripts ${(\mathbf{·})}^T$, ${(\mathbf{·})}^{*}$ and ${(\mathbf{·})}^H$ represent the transpose, conjugate and conjugate–transpose operations, respectively. $\mathcal{J}=\sqrt{-1}$ and $\delta (\mathbf{·})$ imply the imaginary unit and Dirac delta. $\mathrm{diag}\left(\mathit{a}\right)$ denotes the diagonal matrix formed using the entries of $\mathit{a}$. The symbols $\circ$, $\otimes$ and $\oplus$ denote the Khatri–Rao product, Kronecker product and Hadamard product, respectively. $\mathrm{vec}\left(\mathit{A}\right)$ represents the vectorization operator that turns $\mathit{A}$ into a vector by stacking each column in sequence. $\left|\mathbb{A}\right|$ is the cardinality of an integer set $\mathbb{A}$. The atomic norm and Frobenius norm are written as ${\Vert \mathbf{·}\Vert }_{\mathcal{A}}$ and ${\Vert \mathbf{·}\Vert }_{\mathrm{F}}$, respectively. $\mathrm{rank}(\mathit{A})$ and $\mathrm{trace}(\mathit{A})$ denote the trace and rank of $\mathit{A}$. We also define $n\in \langle a,b\rangle$, such that $n$ denotes any integer from the integers $a$ to $b$.

2. Signal Model

Assume $K$ far-field, narrowband and uncorrelated sources with a wavelength $\lambda$ impinging on the $G$-sensor sparse linear array from directions $\mathsf{\Theta }=\left\{{\theta }_k|k=1,2,\cdots ,K\right\}$, where ${\theta }_k\in \left[-\pi /2,\pi /2\right)$. The sensor locations $p_m$ are presented as the integer set $\mathbb{P}=\left\{p_m|m\in \langle 1,G\rangle \right\}$, in which all sensor positions are normalized by the unit inter-sensor spacing $d=\lambda /2$ and the first sensor is chosen as a reference, i.e., $p_1=0$. The array output vector, at time $t$, is modeled as

$$\mathit{x}(t)={\displaystyle \sum _{k=1}^K\mathit{a}\left({\theta }_k\right)s_k\left(t\right)+\mathit{n}\left(t\right)}=\mathit{A}\mathit{s}\left(t\right)+\mathit{n}\left(t\right)$$ (1)

where $\mathit{A}=\left[\mathit{a}\left({\theta }_1\right),\mathit{a}\left({\theta }_2\right),\cdots ,\mathit{a}\left({\theta }_K\right)\right]$ behaves like the array manifold, with $\mathit{a}\left({\theta }_k\right)={\left[1,e^{-\mathcal{J}2\pi p_2\sin {\theta }_k/\lambda },\cdots ,e^{-\mathcal{J}2\pi p_G\sin {\theta }_k/\lambda }\right]}^{\mathrm{T}}$ denoting the steering vector of the $k$-th source. $\mathit{s}\left(t\right)={\left[s_1\left(t\right),s_2\left(t\right),\cdots ,s_K\left(t\right)\right]}^{\mathrm{T}}$ refers to the source vector with $s_k\left(t\right)=u_k{e}^{\mathcal{J}\left(\omega +{\omega }_k\right)t}$, where $\omega$ is the carrier frequency, and $u_k$ and ${\omega }_k$ denote the complex amplitude and a small frequency offset, respectively. After demodulation to IF, the $k$-th signal becomes $s_k\left(t\right)=u_k{e}^{\mathcal{J}{\omega }_{k}t}$. $\mathit{n}\left(t\right)={\left[n_1\left(t\right),n_2\left(t\right),\cdots ,n_G\left(t\right)\right]}^{\mathrm{T}}\sim \mathcal{C}\mathcal{N}\left(\mathbf{0},{\sigma }_n^2{\mathit{I}}_G\right)$ is assumed to be the observed white Gaussian noise vector and uncorrelated with $\mathit{s}\left(t\right)$.

Let $x_m\left(t\right)$ denote the $m$-th sensor output and $\tau$ denote the time lag. By collecting $N_s$ snapshots, the time average function of $x_1^{*}\left(t\right)$ and $x_m\left(t+\tau \right)$ is formulated by

$$\begin{array}{ll}{R}_{x_1^{*}{x}_m}\left(\tau \right)& =\frac{1}{N_s}{\displaystyle \sum _{t=1}^{N_s}{x}_1^{*}\left(t\right)x_m\left(t+\tau \right)}\\ & =\frac{1}{N_s}{\displaystyle \sum _{t=1}^{N_s}\left\{{\left[{\displaystyle \sum _{k=1}^K{a}_1\left({\theta }_k\right)s_k\left(t\right)+n_1\left(t\right)}\right]}^{*}\times \left[{\displaystyle \sum _{q=1}^K{a}_m\left({\theta }_q\right)s_q\left(t+\tau \right)+n_m\left(t+\tau \right)}\right]\right\}}\\ & ={\displaystyle \sum _{k=1}^K{\displaystyle \sum _{q=1}^K\left\{a_1^{*}\left({\theta }_k\right)a_m\left({\theta }_q\right)\frac{1}{N_s}{\displaystyle \sum _{t=1}^{N_s}{s}_k^{*}\left(t\right)s_q\left(t+\tau \right)}\right\}+\frac{1}{N_s}{\displaystyle \sum _{t=1}^{N_s}{n}_1^{*}\left(t\right)}{n}_m\left(t+\tau \right)}}\\ & ={\displaystyle \sum _{k=1}^K{\displaystyle \sum _{q=1}^K\left\{a_1^{*}\left({\theta }_k\right)a_m\left({\theta }_q\right)u_k^{*}{u}_q{e}^{\mathcal{J}{\omega }_q\tau }\frac{1}{N_s}{\displaystyle \sum _{t=1}^{N_s}{e}^{\mathcal{J}\left({\omega }_q-{\omega }_k\right)t}}\right\}+R_{n_1^{*}{n}_m}\left(\tau \right)}}\end{array}$$ (2)

where $R_{n_1^{*}{n}_m}\left(\tau \right)={\sigma }_n^2\delta \left(\tau \right)\delta \left(m-1\right)$. If $\tau \ne 0$, we can obtain $R_{n_1^{*}{n}_m}\left(\tau \right)=0$. Note that in the case $N_s$ is adequately large and ${\omega }_q\ne {\omega }_k$, one has ${\displaystyle \sum _{t=1}^{N_s}{e}^{\mathcal{J}\left({\omega }_q-{\omega }_k\right)t}}/N_s\approx 0$. Thereby, Equation (2) can be simplified as

$$R_{x_1^{*}{x}_m}\left(\tau \right)={\displaystyle \sum _{k=1}^K\left\{a_1^{*}\left({\theta }_k\right)a_m\left({\theta }_k\right)\frac{1}{N_s}{\displaystyle \sum _{t=1}^{N_s}{s}_k^{*}\left(t\right)s_k\left(t+\tau \right)}\right\}}={\displaystyle \sum _{k=1}^K{e}^{-\mathcal{J}2\pi p_m\sin {\theta }_k/\lambda }{R}_{s_k^{*}{s}_k}\left(\tau \right)}$$ (3)

where $R_{s_k^{*}{s}_k}\left(\tau \right)={\displaystyle \sum _{t=1}^{N_s}{s}_k^{*}\left(t\right)s_k\left(t+\tau \right)}/N_s={\left|u_k\right|}^2{e}^{\mathcal{J}{\omega }_k\tau }$ has a similar form to the incident source $s_k\left(t\right)=u_k{e}^{\mathcal{J}{\omega }_{k}t}$; thus, it can be regarded as an equivalent source from ${\theta }_k$ with power ${\left|u_k\right|}^4$.

Combining all the $R_{x_1^{*}{x}_m}\left(\tau \right)$ into a column vector yield

$${\mathit{R}}_x\left(\tau \right)=\mathit{A}{\mathit{R}}_s\left(\tau \right)$$ (4)

where ${\mathit{R}}_x\left(\tau \right)={\left[R_{x_1^{*}{x}_1}\left(\tau \right),R_{x_1^{*}{x}_2}\left(\tau \right),\cdots ,R_{x_1^{*}{x}_G}\left(\tau \right)\right]}^{\mathrm{T}}$ and ${\mathit{R}}_s\left(\tau \right)={\left[R_{s_1^{*}{s}_1}\left(\tau \right),R_{s_2^{*}{s}_2}\left(\tau \right),\cdots ,R_{s_K^{*}{s}_K}\left(\tau \right)\right]}^{\mathrm{T}}$.

Replacing the independent variable $\tau$ in Equation (4) to $-\tau$ and taking the conjugate, one can obtain the following result

$${\mathit{R}}_x^{*}\left(-\tau \right)={\mathit{A}}^{*}{\mathit{R}}_s^{*}\left(-\tau \right)={\mathit{A}}^{*}{\mathit{R}}_s\left(\tau \right)$$ (5)

Then, we stack ${\mathit{R}}_x\left(\tau \right)$ and ${\mathit{R}}_x^{*}\left(-\tau \right)$ to construct the conjugate-augmented correlation vector $\mathit{R}\left(\tau \right)$ as follows

$$\mathit{R}\left(\tau \right)=\left[\begin{array}{c}{\mathit{R}}_x^{*}\left(-\tau \right)\\ {\mathit{R}}_x\left(\tau \right)\end{array}\right]=\left[\begin{array}{c}{\mathit{A}}^{*}\\ \mathit{A}\end{array}\right]{\mathit{R}}_s\left(\tau \right)$$ (6)

Assigning the appropriate pseudo-sampling period $T_p$ and the pseudo-sampling snapshot $N_p$ to the independent variable $\tau$, we can obtain the pseudo-data matrix $\mathit{Y}$ as follows

$$\mathit{Y}=\left[\mathit{R}\left(T_p\right),\mathit{R}\left(2T_p\right),\cdots ,\mathit{R}\left(N_p{T}_p\right)\right]=\mathit{B}\mathit{U}\mathit{E}$$ (7)

where

$$\mathit{E}=\left[\begin{array}{cccc}{e}^{\mathcal{J}{\omega }_1{T}_p}& e^{\mathcal{J}{\omega }_{1}2T_p}& \cdots & e^{\mathcal{J}{\omega }_1{N}_P{T}_p}\\ e^{\mathcal{J}{\omega }_2{T}_p}& e^{\mathcal{J}{\omega }_{2}2T_p}& \cdots & e^{\mathcal{J}{\omega }_2{N}_P{T}_p}\\ ⋮& ⋮& ⋮& ⋮\\ e^{\mathcal{J}{\omega }_K{T}_p}& e^{\mathcal{J}{\omega }_{K}2T_p}& \cdots & e^{\mathcal{J}{\omega }_K{N}_P{T}_p}\end{array}\right]$$ (8)

$\mathit{B}=\left[\mathit{b}\left({\theta }_1\right),\mathit{b}\left({\theta }_2\right),\cdots ,\mathit{b}\left({\theta }_K\right)\right]$ with the $k$-th column being $\mathit{b}\left({\theta }_k\right)={\left[{\mathit{a}}^{\mathrm{H}}\left({\theta }_k\right),{\mathit{a}}^{\mathrm{T}}\left({\theta }_k\right)\right]}^{\mathrm{T}}$, and $\mathit{U}=diag\left(\left[{\left|u_1\right|}^2,{\left|u_2\right|}^2,\cdots ,{\left|u_K\right|}^2\right]\right)$.

By collecting $N_p$ pseudo-sampling snapshots, the covariance matrix of $\mathit{Y}$ can be calculated as

$${\mathit{R}}_{\mathit{Y}}=\frac{1}{N_p}\mathit{Y}{\mathit{Y}}^{\mathrm{H}}=\mathit{B}\mathit{U}\left(\frac{1}{N_p}\mathit{E}{\mathit{E}}^{\mathrm{H}}\right){\mathit{U}}^{\mathrm{H}}{\mathit{B}}^{\mathrm{H}}$$ (9)

where

$$\frac{1}{N_p}\mathit{E}{\mathit{E}}^{\mathrm{H}}=\left[\begin{array}{cccc}1& {\displaystyle \sum _{n=1}^{N_p}\frac{e^{\mathcal{J}\left({\omega }_1-{\omega }_2\right)n{T}_p}}{N_p}}& \cdots & {\displaystyle \sum _{n=1}^{N_p}\frac{e^{\mathcal{J}\left({\omega }_1-{\omega }_K\right)n{T}_p}}{N_p}}\\ {\displaystyle \sum _{n=1}^{N_p}\frac{e^{\mathcal{J}\left({\omega }_2-{\omega }_1\right)n{T}_p}}{N_p}}& 1& \cdots & {\displaystyle \sum _{n=1}^{N_p}\frac{e^{\mathcal{J}\left({\omega }_2-{\omega }_K\right)n{T}_p}}{N_p}}\\ ⋮& ⋮& ⋮& ⋮\\ {\displaystyle \sum _{n=1}^{N_p}\frac{e^{\mathcal{J}\left({\omega }_K-{\omega }_1\right)n{T}_p}}{N_p}}& {\displaystyle \sum _{n=1}^{N_p}\frac{e^{\mathcal{J}\left({\omega }_K-{\omega }_2\right)n{T}_p}}{N_p}}& \cdots & 1\end{array}\right]$$ (10)

When $N_p$ is adequately large, we have ${\displaystyle \sum _{n=1}^{N_p}{e}^{\mathcal{J}\left({\omega }_2-{\omega }_1\right)n{T}_p}}/N_p\approx 0$. Thus, Equation (10) can be approximated as

$$\frac{1}{N_p}\mathit{E}{\mathit{E}}^{\mathrm{H}}\approx {\mathit{I}}_K$$ (11)

As a result, Equation (9) can be reformulated as

$${\mathit{R}}_{\mathit{Y}}=\mathit{B}\mathit{V}{\mathit{B}}^{\mathrm{H}}$$ (12)

where $\mathit{V}=\mathit{U}{\mathit{I}}_K{\mathit{U}}^{\mathrm{H}}=\mathrm{diag}\left(\left[{\left|u_1\right|}^4,{\left|u_2\right|}^4,\cdots ,{\left|u_K\right|}^4\right]\right)$.

Vectorizing ${\mathit{R}}_{\mathit{Y}}$ yields

$$\begin{array}{cc}\hfill \mathit{r}& =\mathrm{vec}\left({\mathit{R}}_{\mathit{Y}}\right)=\mathrm{vec}\left(\mathit{B}\mathit{V}{\mathit{B}}^{\mathrm{H}}\right)\hfill \\ & ={\displaystyle \sum _{k=1}^K{\left|u_k\right|}^4\mathrm{vec}\left(\mathit{b}\left({\theta }_k\right){\mathit{b}}^{\mathrm{H}}\left({\theta }_k\right)\right)}\hfill \\ & =\left({\mathit{B}}^{*}\circ \mathit{B}\right)\mathit{u}=\mathit{C}\mathit{u}\hfill \end{array}$$ (13)

where $\mathit{u}={\left[{\left|u_1\right|}^4,{\left|u_2\right|}^4,\cdots ,{\left|u_K\right|}^4\right]}^H$. The $k$-th column of $\mathit{C}={\mathit{B}}^{*}\circ \mathit{B}$ can be expressed as

$${\mathit{b}}^{*}\left({\theta }_k\right)\otimes \mathit{b}\left({\theta }_k\right)={\left[\begin{array}{c}{\mathit{a}}^{*}\left({\theta }_k\right)\\ \mathit{a}\left({\theta }_k\right)\end{array}\right]}^{*}\otimes \left[\begin{array}{c}{\mathit{a}}^{*}\left({\theta }_k\right)\\ \mathit{a}\left({\theta }_k\right)\end{array}\right]=\left[\begin{array}{c}\mathit{a}\left({\theta }_k\right)\otimes {\mathit{a}}^{*}\left({\theta }_k\right)\\ \mathit{a}\left({\theta }_k\right)\otimes \mathit{a}\left({\theta }_k\right)\\ {\mathit{a}}^{*}\left({\theta }_k\right)\otimes {\mathit{a}}^{*}\left({\theta }_k\right)\\ {\mathit{a}}^{*}\left({\theta }_k\right)\otimes \mathit{a}\left({\theta }_k\right)\end{array}\right]=\left[\begin{array}{c}diff1\\ sum1\\ sum2\\ diff2\end{array}\right]$$ (14)

where $diff1=e^{-\mathcal{J}2\pi \left(p_m-p_n\right)\sin {\theta }_k/\lambda }$, $sum1=e^{-\mathcal{J}2\pi \left(p_m+p_n\right)\sin {\theta }_k/\lambda }$, $sum2=e^{-\mathcal{J}2\pi \left(-p_m-p_n\right)\sin {\theta }_k/\lambda }$ and $diff2=e^{-\mathcal{J}2\pi \left(-p_m+p_n\right)\sin {\theta }_k/\lambda }$. It is obvious that the virtual sensor positions in $\mathit{C}$ are collected as the difference–sum co-array, which is the union set of the difference co-array and the sum co-array. The exact descriptions of them are given in Section 3.

3. Generalized Nested Array

We start by introducing the following terminologies to facilitate the description of the physical configuration and the corresponding virtual array characteristics in the sequel. Hereafter, the sensor locations are normalized by the underlying inter-sensor spacing $d$.

Definition 1. 

(Set Operations). For two given integer sets ${\mathbb{X}}_1$and${\mathbb{X}}_2$, while denoting $\mathbb{X}={\mathbb{X}}_1\cup {\mathbb{X}}_2$, we can define the following operations:

• (a)Self-difference: ${\mathbb{D}}_{\mathbb{X}-sd}={\mathbb{X}}_i-{\mathbb{X}}_i$, where $i\in \langle 1,2\rangle$.
• (b)Cross-difference: ${\mathbb{D}}_{\mathbb{X}-cd}={\mathbb{X}}_i-{\mathbb{X}}_j$, where $i\in \langle 1,2\rangle ,j\in \langle 1,2\rangle$, while $i\ne j$.
• (c)Self-sum: ${\mathbb{S}}_{\mathbb{X}-ss}={\mathbb{X}}_i+{\mathbb{X}}_i$, where $i\in \langle 1,2\rangle$.
• (d)Cross-sum: ${\mathbb{S}}_{\mathbb{X}-cs}={\mathbb{X}}_i+{\mathbb{X}}_j$, where $i\in \langle 1,2\rangle ,j\in \langle 1,2\rangle$, while $i\ne j$.

Definition 2. 

(Co-array). For a linear sparse array $\mathbb{P}=\left\{p_i|i\in \langle 1,G\rangle \right\}$, one can define the following concepts:

• (a)Difference co-array: ${\mathbb{D}}_{\mathbb{P}}=\mathbb{P}-\mathbb{P}=\left\{p_i-p_j|i\in \langle 1,G\rangle ,j\in \langle 1,G\rangle \right\}$.
• (b)Sum co-array: ${\mathbb{S}}_{\mathbb{P}}=\pm \left(\mathbb{P}+\mathbb{P}\right)=\left\{\pm \left(p_i+p_j\right)|i\in \langle 1,G\rangle ,j\in \langle 1,G\rangle \right\}$.
• (c)Difference–sum co-array: ${\mathbb{L}}_{\mathbb{P}}={\mathbb{D}}_{\mathbb{P}}\cup {\mathbb{S}}_{\mathbb{P}}$.

Using ${\mathbb{L}}_{\mathbb{P}}$, we can calculate the number of degrees of freedom as $\mathrm{DOFs}=\left|{\mathbb{L}}_{\mathbb{P}}\right|$, the DOF ratio as $\gamma \left(G\right)=G^2/\left|{\mathbb{L}}_{\mathbb{P}}\right|$ and the virtual aperture as $L=\max \left({\mathbb{L}}_{\mathbb{P}}\right)$, respectively. Note that $\left|{\mathbb{L}}_{\mathbb{P}}\right|\ge \left|{\mathbb{D}}_{\mathbb{P}}\right|$ when $G\ge 2$. As a result, the DSCA of a sparse array has more DOFs than the DCA, which has the potential to identify more sources.

3.1. Review of GNA-DCA

As shown in Figure 1, a GNA, with $G=N_1+N_2$ sensors, is composed of two cascaded subarrays. The inner ULA has $N_1$ sensors with spacing $\alpha$ and the outer is a ULA of $N_2$ sensors with spacing $\beta$, where the spacing of the adjacent ULA is $\alpha$. Then, the sensor locations, consisting of two integer sets, are collected as

$$\{\begin{array}{l}\mathbb{P}={\mathbb{P}}_1\cup {\mathbb{P}}_2\hfill \\ {\mathbb{P}}_1=\left\{\alpha n_1|n_1\in \langle 0,N_1-1\rangle \right\}\hfill \\ {\mathbb{P}}_2=\left\{\alpha N_1+\beta n_2|n_2\in \langle 0,N_2-1\rangle \right\}\hfill \end{array}$$ (15)

where ${\mathbb{P}}_1$ and ${\mathbb{P}}_2$ denote the sensor locations of the inner ULA and outer ULA, respectively. $\alpha$ and $\beta$ are a pair of integers.

Figure 1.

Generalized nested array, where we assume $N_1=N_2=4$. Black circles and red diamonds denote the inner ULA and outer ULA, respectively. Black crosses imply empty space when $\alpha >1,\beta >1$.

Lemma 1. 

In the GNA, the DCA is generated only by vectorizing the covariance matrix of the array output. Hence, the following properties hold for the GNA-DCA [20]:

• (a)When$\alpha \in \langle 1,N_2\rangle ,\beta \in \langle 1,N_1+1\rangle$, the range of positive and negative consecutive lags can be presented as$\langle l_1,l_2\rangle$and$\langle -l_2,-l_1\rangle$, respectively, where$l_1=\left(\alpha -1\right)\left(\beta -1\right)$and$l_2=\alpha N_1+\beta N_2-\alpha \beta +\alpha -1$.
• (b)If$\alpha \in \langle 1,N_2\rangle ,\beta \in \langle 1,N_1+1\rangle$, the number of unique lags reaches$2l+1$, where$l=\alpha N_1+\beta N_2-\alpha \beta +\alpha -1$.
• (c)In the case$\alpha \in \langle 1,N_2\rangle ,\beta =N_1+1$or$\alpha =N_2,\beta \in \langle 1,N_1+1\rangle$, the maximum DOFs can be obtained, as detailed inTable 1.

Table 1.

Optimal configuration and maximum DOFs for GNA-DCA.

$\mathit{G}={\mathit{N}}_1+{\mathit{N}}_2$	$\mathbf{Optimal} {\mathit{N}}_1,{\mathit{N}}_2$	$\mathbf{Optimal} \mathit{\alpha },\mathit{\beta }$	Maximum DOFs
Even	$N_1=N_2=G/2$	$\alpha \in \langle 1,N_2\rangle ,\beta =N_1+1$ or $\alpha =N_2,\beta \in \langle 1,N_1+1\rangle$	$\left(G^2-2\right)/2+G$
Odd	$N_1=\left(G-1\right)/2,N_2=\left(G+1\right)/2$		$\left(G^2-1\right)/2+G$

3.2. Proposed GNA-DSCA

In this subsection, we propose the generalized nested array via the difference–sum co-array (GNA-DSCA), which, unlike the GNA-DCA, which only considers the DCA, is a union of the DCA and the SCA. The closed-form expressions for the dilation factors and the number of DOFs are derived by analyzing both the DCA and SCA. Finally, the optimal physical configuration and the maximum DOFs are determined by solving a linear optimization problem. Since the GNA-DSCA can provide more DOFs and virtual aperture than the GNA-DCA, it can be used to achieve DOA estimation with superior performance.

Based on Definition 2 and Equation (15), the GNA-DSCA can be readily given by the following definition.

Definition 3. 

(GNA-DSCA). For a generalized nested array $\mathbb{P}=\left\{p_i|i\in \langle 1,G\rangle \right\}$, the DSCA can be defined as

$$\{\begin{array}{l}{\mathbb{L}}_{\mathbb{P}}={\mathbb{L}}_{\mathbb{P}}^{+}\cup {\mathbb{L}}_{\mathbb{P}}^{-}\hfill \\ {\mathbb{L}}_{\mathbb{P}}^{+}={\mathbb{D}}_{\mathbb{P}}^{+}\cup {\mathbb{S}}_{\mathbb{P}}^{+},{\mathbb{L}}_{\mathbb{P}}^{-}={\mathbb{D}}_{\mathbb{P}}^{-}\cup {\mathbb{S}}_{\mathbb{P}}^{-}\hfill \end{array}$$ (16)

where${\mathbb{L}}_{\mathbb{P}}^{+}$and${\mathbb{L}}_{\mathbb{P}}^{-}$denote the positive and negative halves of${\mathbb{L}}_{\mathbb{P}}$, respectively.${\mathbb{D}}_{\mathbb{P}}^{+}=\left\{p_i-p_j|i\in \langle 1,G\rangle ,j\in \langle 1,G\rangle ,i\ge j\right\}$,${\mathbb{S}}_{\mathbb{P}}^{+}=\left\{p_i+p_j|i\in \langle 1,G\rangle ,j\in \langle 1,G\rangle \right\}$. ${\mathbb{D}}_{\mathbb{P}}^{-}$and${\mathbb{S}}_{\mathbb{P}}^{-}$are their mirrored versions, i.e.,${\mathbb{D}}_{\mathbb{P}}={\mathbb{D}}_{\mathbb{P}}^{+}\cup {\mathbb{D}}_{\mathbb{P}}^{-}$and${\mathbb{S}}_{\mathbb{P}}={\mathbb{S}}_{\mathbb{P}}^{+}\cup {\mathbb{S}}_{\mathbb{P}}^{-}$. Clearly,${\mathbb{L}}_{\mathbb{P}}$is symmetric, i.e.,${\mathbb{L}}_{\mathbb{P}}^{+}=-{\mathbb{L}}_{\mathbb{P}}^{-}$, where$0\in {\mathbb{L}}_{\mathbb{P}}^{+}$and$0\in {\mathbb{L}}_{\mathbb{P}}^{-}$.

Remark 1. 

From Definition 2 and Definition 3, we can well explain that ${\mathbb{D}}_{\mathbb{P}}$ and ${\mathbb{S}}_{\mathbb{P}}$ are two incomplete equal sets and both of them are the subsets of ${\mathbb{L}}_{\mathbb{P}}$ . Therefore, compared with the GNA-DCA, the GNA-DSCA can also obtain DOFs from the SCA, which provides the capacities to detect more sources.

Next, we present some properties of the GNA-DSCA and provide rigorous proofs.

Lemma 2. 

Based on Definition 3, the properties of ${\mathbb{L}}_{\mathbb{P}}$ can be derived as below:

• (a)Provided that$\alpha \in \langle 1,N_2\rangle ,\beta \in \langle 2,2N_1+1\rangle$,${\mathbb{L}}_{\mathbb{P}}^{+}$possesses all the consecutive lags in the range$\langle g_1,g_2\rangle$, where$g_1=\left(\alpha -1\right)\left(\beta -1\right)$and$g_2=2\alpha N_1+\beta N_2-\alpha \beta +\alpha -1$. Provided that$\alpha \in \langle 1,N_2\rangle ,\beta =1$,${\mathbb{L}}_{\mathbb{P}}^{+}$enjoys all the consecutive lags in the range$\langle 0,2\left(\alpha N_1+N_2-1\right)\rangle$.
• (b)In the case$\alpha \in \langle 1,N_2\rangle ,\beta \in \langle 1,2N_1+1\rangle$, the total number of unique lags in${\mathbb{L}}_{\mathbb{P}}$reaches$2g-1$, where$g=2\alpha N_1+\left(\beta +1\right)N_2-\alpha \beta +\alpha -1$.

Proof. 

See Appendix A. □

Remark 2. 

Based on the proof of Lemma 2, we know that the number of inconsecutive lags in${\mathbb{L}}_{\mathbb{P}}^{+}$is${\kappa }_1+{\kappa }_3+{\kappa }_4=\left(\alpha -1\right)\left(\beta -1\right)+N_2-1$, where$\alpha \in \langle 1,N_2\rangle ,\beta \in \langle 2,2N_1+1\rangle$. Thus, when$\alpha =1$, the number of inconsecutive lags equals$N_2-1$, and all of them are distributed in the segment${\mathsf{\Gamma }}_4$. Inconsecutive lags also exist in the segment${\mathsf{\Gamma }}_1$and${\mathsf{\Gamma }}_3$when$\alpha \ne 1$, which increase as the dilation factors$\alpha$and$\beta$increase. Moreover, in the case$\alpha \in \langle 1,N_2\rangle ,\beta =1$, all the virtual sensors in${\mathbb{L}}_{\mathbb{P}}^{+}$are consecutive lags, which increase with the increase of$\alpha$.

In order to determine the maximum DOFs of the GNA-DSCA, we solve the closed-form expressions for $g$ by choosing the optimal $\alpha$ and $\beta$. The optimization model is developed as

$$\begin{array}{ll}\underset{\alpha ,\beta }{\max } & g=2\alpha N_1+\left(\beta +1\right)N_2-\alpha \beta +\alpha -1\\ \mathrm{s.t.}& 1\le \alpha \le N_2,\\ & 1\le \beta \le 2N_1+1,\\ & G=N_1+N_2\end{array}$$ (17)

The solution of Equation (17) is $g_{\max }=2N_1{N}_2+2N_2-1$ , where $\alpha \in \langle 1,N_2\rangle ,\beta =2N_1+1$ or $\alpha =N_2,\beta \in \langle 1,2N_1+1\rangle$.

Proof. 

See Appendix B. □

Consequently, the optimal configuration and maximum DOFs obtained using the Arithmetic Mean–Geometric Mean (AM-GM) inequalities are summarized in Table 2.

Table 2.

Optimal configuration and maximum DOFs for GNA-DSCA.

$\mathit{G}={\mathit{N}}_1+{\mathit{N}}_2$	$\mathbf{Optimal} {\mathit{N}}_1,{\mathit{N}}_2$	$\mathbf{Optimal} \mathit{\alpha },\mathit{\beta }$	Maximum DOFs
Even	$N_1=N_2=G/2$	$\alpha \in \langle 1,N_2\rangle ,\beta =2N_1+1$ or $\alpha =N_2,\beta \in \langle 1,2N_1+1\rangle$	$G^2+2G-3$
Odd	$N_1=\left(G-1\right)/2,N_2=\left(G+1\right)/2$		$G^2+2G-2$

Remark 3. 

Compared with the GNA-DCA, the GNA-DSCA has the following superior properties: (1) The dilation factor $\beta$ in the GNA-DSCA can take more values, which means that the GNA-DSCA has more flexible physical configurations. (2) The larger $\beta$ can further weaken the mutual coupling, thus making the GNA-DSCA more favorable for practical applications. (3) The GNA-DSCA keeps the virtue of a simple closed-form expression of DOFs. (4) The GNA-DSCA provides about twice as many maximum DOFs as the GNA-DCA with the same number of sensors. (5) The GNA-DSCA can further extend the virtual aperture using the sum co-array.

To visualize the unique lags in the GNA-DCA and the GNA-DSCA, a family of six-sensor generalized nested arrays is considered in Figure 2, where $\alpha$ and $\beta$ can take various values. We can see that the GNA-DSCA has more DOFs and a larger virtual aperture than the NA-DCA for any physical configuration. In addition, provided that $\beta >4$, the GNA-DCA no longer satisfies Lemma 1, while the GNA-DSCA meets Lemma 2. Therefore, the GNA-DSCA has more flexible array configurations.

Figure 2.

A family of six-sensor generalized nested arrays and their unique lags of the GNA-DCA and GNA-DSCA. Diamonds denote the sensor locations. Squares and circles indicate the unique lags in the GNA-DCA and GNA-DSCA, respectively, while crosses denote the hole locations.

4. DOA Estimation

In this section, we elaborate an efficient DOA estimation algorithm for the GNA-DSCA. The core of the algorithm lies in the construction of a Toeplitz matrix for two different cases of the observed vectors, which can be explained by the dilation factors. In particular, when $\alpha$ and $\beta$ take larger values, we need to first fill additional virtual sensors at the hole locations and then recover the equivalent received signals based on the atomic norm minimization theory, so that we can obtain a covariance matrix similar to the ULA and then perform DOA estimation using the MUSIC algorithm.

The virtual array, obtained by the DSCA of the physical sensors, has many repeated lags, corresponding to the non-unique steer vectors in $\mathit{C}$. Therefore, the redundant values in $\mathit{r}$ must be averaged [43] and then sorted in ascending order by virtual array locations to obtain a new observed vector as

$$\tilde{\mathit{r}}=\tilde{\mathit{C}}\mathit{u}={\displaystyle \sum _{k=1}^K\tilde{\mathit{c}}\left({\theta }_k\right){\left|u_k\right|}^4}$$ (18)

where $\tilde{\mathit{r}}\in {ℂ}^{\left(2g-1\right)\times 1}$.

Depending on the type of observed vector corresponding to the DSCA, we can divide it into two cases to construct the Toeplitz matrix for DOA estimation.

Case 1. 

Based on Remark 2, if$\alpha \in \langle 1,N_2\rangle ,\beta =1$, we can obtain a hole-free GNA-DSCA. In this case, the following Toeplitz matrix can be constructed by referring to [29]

$$\tilde{\mathit{R}}=\left[\begin{array}{llll}{\langle \tilde{\mathit{r}}\rangle }_0\hfill & {\langle \tilde{\mathit{r}}\rangle }_{-1}\hfill & \cdots \hfill & {\langle \tilde{\mathit{r}}\rangle }_{-\left(g-1\right)}\hfill \\ {\langle \tilde{\mathit{r}}\rangle }_1\hfill & {\langle \tilde{\mathit{r}}\rangle }_0\hfill & \cdots \hfill & {\langle \tilde{\mathit{r}}\rangle }_{-\left(g-1\right)+1}\hfill \\ ⋮\hfill & ⋮\hfill & \ddots \hfill & ⋮\hfill \\ {\langle \tilde{\mathit{r}}\rangle }_{g-1}\hfill & {\langle \tilde{\mathit{r}}\rangle }_{g-2}\hfill & \cdots \hfill & {\langle \tilde{\mathit{r}}\rangle }_0\hfill \end{array}\right]$$ (19)

where${\langle \tilde{\mathit{r}}\rangle }_i,i\in \langle -\left(g-1\right),g-1\rangle$denotes the$i+g$-th element in$\tilde{\mathit{r}}$.

Case 2. 

When Case 1 does not hold, some holes appear in the DSCA, which more or less affect the estimation performance. Therefore, we need to transform the non-uniform virtual array into a virtual ULA by filling zero statistics at the hole locations, i.e., use a hole-filling strategy. Then, the observation vector $\tilde{\mathit{r}}$ is updated as

$${\tilde{\mathit{r}}}_0={\tilde{\mathit{C}}}_0\mathit{u}={\displaystyle \sum _{k=1}^K{\tilde{\mathit{c}}}_0\left({\theta }_k\right){\left|u_k\right|}^4}$$ (20)

where ${\tilde{\mathit{r}}}_0\in {ℂ}^{\left(2g-1+2h\right)\times 1}$ with $2h$ represents the number of zero statistics filled.

Then, the Toeplitz matrix is constructed using ${\tilde{\mathit{r}}}_0$ as follows

$${\tilde{\mathit{R}}}_0=\left[\begin{array}{cccc}{\langle {\tilde{\mathit{r}}}_0\rangle }_0& {\langle {\tilde{\mathit{r}}}_0\rangle }_{-1}& \cdots & {\langle {\tilde{\mathit{r}}}_0\rangle }_{-\left(g-1\right)-h}\\ {\langle {\tilde{\mathit{r}}}_0\rangle }_1& {\langle {\tilde{\mathit{r}}}_0\rangle }_0& \cdots & {\langle {\tilde{\mathit{r}}}_0\rangle }_{-\left(g-1\right)-h+1}\\ ⋮& ⋮& ⋮& ⋮\\ {\langle {\tilde{\mathit{r}}}_0\rangle }_{\left(g-1\right)+h}& {\langle {\tilde{\mathit{r}}}_0\rangle }_{\left(g-1\right)+h-1}& \cdots & {\langle {\tilde{\mathit{r}}}_0\rangle }_0\end{array}\right]$$ (21)

where ${\langle {\tilde{\mathit{r}}}_0\rangle }_i,i\in \langle -\left(g-1\right)-h,\left(g-1\right)+h\rangle$ denotes the $i+g+h$-th element in ${\tilde{\mathit{r}}}_0$. Since ${\tilde{\mathit{r}}}_0$ contains several filled zero statistics, the diagonal entries at the corresponding positions in ${\tilde{\mathit{R}}}_0$ are also zero statistics.

Meanwhile, a binary vector $\mathcal{z}\in {ℝ}^{\left(2g-1+2h\right)\times 1}$ is defined to distinguish the original lags from the filled zero statistics, i.e., the original lags correspond to 1 and the filled zero statistics correspond to 0, respectively. Next, we discuss the equivalent recovery of the zero statistics. The atomic set is first defined as follows

$$\mathcal{A}=\left\{{\tilde{\mathit{c}}}_0^1\left({\theta }_k\right)|{\theta }_k\in \left[-\pi /2,\pi /2\right)\right\}$$ (22)

where ${\tilde{\mathit{c}}}_0^1\left({\theta }_k\right)\in {ℂ}^{\left(g+h\right)\times 1}$ is formed by picking the $g+h$-th row to the $2g-1+2h$-th row in ${\tilde{\mathit{c}}}_0\left({\theta }_k\right)$.

The atomic norm of ${\tilde{\mathit{r}}}_0^1$ is defined as

$${\Vert {\tilde{\mathit{r}}}_0^1\Vert }_{\mathcal{A}}=\inf \left\{{\displaystyle \sum _{k=1}^K{p}_k|{\tilde{\mathit{r}}}_0^1={\displaystyle \sum _{k=1}^K{\tilde{\mathit{c}}}_0^1({\theta }_k)p_k,p_k>}0}\right\}$$ (23)

where $\inf \{\mathbf{·}\}$ represents the infimum. ${\tilde{\mathit{r}}}_0^1\in {ℂ}^{\left(g+h\right)\times 1}$ is constructed by selecting the $g+h$-th row to the $2g-1+2h$-th row in ${\tilde{\mathit{r}}}_0$.

Since the filled zero statistics actually do not receive sources, we can find a positive semi-definite (PSD) Hermitian Toeplitz matrix $\mathcal{T}\left({\tilde{\mathit{r}}}_0^1\right)$ with the smallest difference from the corresponding elements of ${\tilde{\mathit{R}}}_0$ as the reconstructed covariance matrix; thus, the optimization model based on ANM is established as

$$\begin{array}{ll}\underset{{\tilde{\mathit{r}}}_0^1\in {ℂ}^{g+h}}{\min }& {\Vert {\tilde{\mathit{r}}}_0^1\Vert }_{\mathcal{A}}\\ \hspace{0.17em}\mathrm{s.t.}& {\Vert \mathcal{T}\left({\tilde{\mathit{r}}}_0^1\right)\oplus \mathit{Z}-{\tilde{\mathit{R}}}_0\Vert }_{\mathrm{F}}^2\le \delta ,\\ & \mathcal{T}\left({\tilde{\mathit{r}}}_0^1\right)\ge \mathbf{0}\end{array}$$ (24)

where $\mathit{Z}=\mathcal{z}{\mathcal{z}}^{\mathrm{T}}$ is a binary matrix, which is used to distinguish the non-zero (original) and zero (filled) elements in ${\tilde{\mathit{R}}}_0$. $\delta$ is a threshold.

Using Lagrange multipliers, Equation (24) can be further transformed as

$$\begin{array}{ll}\underset{{\tilde{\mathit{r}}}_0^1\in {ℂ}^{g+h}}{\min }& \hspace{0.17em} \frac{1}{2}\hspace{0.17em}{\Vert \mathcal{T}\left({\tilde{\mathit{r}}}_0^1\right)\oplus \mathit{Z}-{\tilde{\mathit{R}}}_0\Vert }_{\mathrm{F}}^2+\zeta {\Vert {\tilde{\mathit{r}}}_0^1\Vert }_{\mathcal{A}}\\ \hspace{0.17em}\mathrm{s.t.}& \mathcal{T}\left({\tilde{\mathit{r}}}_0^1\right)\ge \mathbf{0}\end{array}$$ (25)

where $\zeta$ is a regularization parameter.

Base on the PSD identity of $\mathcal{T}\left({\tilde{\mathit{r}}}_0^1\right)$, in the case $\mathrm{rank}\left(\mathcal{T}\left({\tilde{\mathit{r}}}_0^1\right)\right)<g+h$, $\mathcal{T}\left({\tilde{\mathit{r}}}_0^1\right)$ can be decomposed by Vandermond as

$$\mathcal{T}\left({\tilde{\mathit{r}}}_0^1\right)={\displaystyle \sum _{k=1}^K{p}_k{\tilde{\mathit{c}}}_0^1\left({\theta }_k\right){\left[{\tilde{\mathit{c}}}_0^1\left({\theta }_k\right)\right]}^{\mathrm{H}}}$$ (26)

It follows naturally that the trace of $\mathcal{T}\left({\tilde{\mathit{r}}}_0^1\right)$ can be obtained as

$$\mathrm{trance}\left(\mathcal{T}\left({\tilde{\mathit{r}}}_0^1\right)\right)=\left(\eta +h+1\right){\displaystyle \sum _{k=1}^K{p}_k}$$ (27)

Observing ${\Vert {\tilde{\mathit{r}}}_0^1\Vert }_{\mathcal{A}}$ in Equation (23) and $\mathrm{trace}\left(\mathcal{T}\left({\tilde{\mathit{r}}}_0^1\right)\right)$ in Equation (27), we have

$${\Vert {\tilde{\mathit{r}}}_0^1\Vert }_{\mathcal{A}}=\mathrm{trace}\left(\mathcal{T}\left({\tilde{\mathit{r}}}_0^1\right)\right)/\left(g+h\right)$$ (28)

As a result, the ANM problem in Equation (25) can be equivalently expressed as

$$\begin{array}{ll}\underset{{\tilde{\mathit{r}}}_0^1\in {ℂ}^{g+h}}{\min }& \frac{1}{2}\hspace{0.17em}{\Vert \mathcal{T}\left({\tilde{r}}_0^1\right)\oplus \mathit{Z}-{\tilde{\mathit{R}}}_0\Vert }_{\mathrm{F}}^2+\epsilon \times \mathrm{trace}\left(\mathcal{T}\left({\tilde{\mathit{r}}}_0^1\right)\right)\\ \hspace{0.17em}\mathrm{s.t.}& \mathcal{T}\left({\tilde{\mathit{r}}}_0^1\right)\ge \mathbf{0}\end{array}$$ (29)

where $\epsilon =\zeta /\left(g+h\right)$. Here, the convex optimization problem in Equation (29) can be easily solved by the CVX toolbox [44].

Up to now, we have obtained the Toeplitz matrices for the two cases, which are $\tilde{\mathit{R}}$ and $\mathcal{T}\left({\tilde{r}}_0^1\right)$, respectively. Since $\tilde{\mathit{R}}$ and $\mathcal{T}\left({\tilde{\mathit{r}}}_0^1\right)$ correspond to the reference virtual array (i.e., a ULA), existing DOA estimation algorithms, including MUSIC [10], ESPRIT [11] and the sparsity-based technique [30], can be incorporated into the virtual domain for DOA estimation. For example, here, we present the MUSIC spectrum of $\mathcal{T}\left({\tilde{\mathit{r}}}_0^1\right)$ as

$${\mathit{P}}_{\mathrm{MUSIC}}\left(\theta \right)=\frac{1}{{\left[{\tilde{\mathit{c}}}_0^1\left(\theta \right)\right]}^{\mathrm{H}}{N}_{\mathcal{T}\left({\tilde{r}}_0^1\right)}{N}_{\mathcal{T}\left({\tilde{\mathit{r}}}_0^1\right)}^{\mathrm{H}}{\tilde{c}}_0^1\left(\theta \right)}$$ (30)

where $N_{\mathcal{T}\left({\tilde{r}}_0^1\right)}$ denotes the noise subspace of $\mathcal{T}\left({\tilde{r}}_0^1\right)$. Note that the MUSIC spectrum of $\tilde{\mathit{R}}$ can be obtained in the same way.

It is important to note that Case 2 can recover the information contained in the missing lags, which is equivalent to improving the number of DOFs. Therefore, Case 2 has a better estimation performance than Case 1, which only utilizes the consecutive lags.

5. Simulation Results

In this section, four sets of numerical simulations involving virtual array properties, MUSIC spectra, Root-Mean-Square Error (RMSE) and resolution performance are conducted to evaluate the superiority of the GNA-DSCA. Several recently proposed configurations, including the NA-DCA [15], CPA-DCA [16], GNA-DCA [20], NA-DSCA [41], CPA-DSCA [40], DsNA [41], INAwSDCA−I [42] and INAwSDCA−II [42], are provided for comparison. The peak search range for the MUSIC spectra is from $-90°$ to $90°$ with a small grid of $0.01°$.

5.1. Virtual Array Properties

In the underlying numerical simulations, the DOF ratio and virtual aperture for different DSCA-based sparse arrays are compared in Figure 3a,b, respectively, where the number of sensors varies from 10 to 30. It is observed from Figure 3a that the NA-DSCA possesses the smallest DOFs, followed by the CPA-DSCA, while the GNA-DSCA, DsNA, INAwSDCA−I and INAwSDCA−II have the highest DOFs and basically remain at the same level. It is worth noting that the GNA-DSCA can significantly increase the DOFs than the NA-DSCA. This phenomenon is attributed to the dense subarray, which causes the NA-DSCA to have many redundant lags, while the GNA-DSCA uses the dilation factors to reduce the number of dense sensors, thus achieving more DOFs. It is also determined from Figure 3b that the order of the virtual aperture size corresponding to each configuration is: GNA-DSCA ($\alpha =N_2,\beta =2N_1+1$) > DsNA > GNA-DSCA ($\alpha =1,\beta =2N_1+1$) = GNA-DSCA ($\alpha =N_2,\beta =N_1+1$) > INAwSDCA−I > INAwSDCA−II > NA-DSCA > CPA-DSCA. By introducing the dilation factors, the GNA-DSCA can significantly enlarge the virtual aperture. Therefore, the inter-sensor spacing is an essential factor affecting the virtual aperture.

Figure 3.

Comparison of virtual array properties. (a) DOF ratio $\gamma \left(G\right)$ versus the number of sensors $G$; (b) Virtual aperture $L$ versus the number of sensors $G$.

5.2. MUSIC Spectra

In the second numerical simulations, we evaluate the DOA estimation performance by presenting the MUSIC spectra of various sparse arrays specified in Table 3, where the coupling coefficients used in Refs. [17,25] are as follows: $c_0=1$, $c_1=0.3e^{\mathcal{J}\pi /3}$ and $c_l=c_1{e}^{-\mathcal{J}(l-1)\pi /8}/l,2\le l\le B,B=100$. Note that, when using the hole-filling strategy for DOA estimation, the virtual aperture is equivalent to the effective DOFs.

Table 3.

Comparisons of configuration, DOFs, virtual aperture and coupling leakage; number of sensors $G=10$.

Sparse Array	Configuration	DOFs	Virtual Aperture	Coupling Leakage
NA-DCA	{0, 1, 2, 3, 4, 5, 11, 17, 23, 29}	59	29	0.5022
CPA-DCA	{0, 5, 6, 10, 12, 15, 18, 20, 24, 25}	39	25	0.2929
GNA-DCA ($\alpha =5,\beta =6$)	{0, 5, 10, 15, 20, 25, 31, 37, 43, 49}	59	49	0.1215
CPA-DSCA	{0, 5, 6, 10, 12, 15, 18, 20, 24, 25}	95	50	0.2929
DsNA	{0, 3, 5, 7, 8, 17, 26, 35, 44, 53}	125	106	0.3187
INAwSDCA−I	{0, 16, 17, 18, 19, 20, 26, 32, 38, 44}	117	88	0.4806
INAwSDCA−II	{0, 9, 15, 21, 27, 28, 29, 30, 31, 32}	119	64	0.5022
GNA-DSCA ($\alpha =1,\beta =11$)	{0, 1, 2, 3, 4, 5, 16, 27, 38, 49}	117	98	0.4991
GNA-DSCA ($\alpha =5,\beta =6$)	{0, 5, 10, 15, 20, 25, 31, 37, 43, 49}	117	98	0.1215
GNA-DSCA ($\alpha =5,\beta =11$)	{0, 5, 10, 15, 20, 25, 36, 47, 58, 69}	117	138	0.1126

Assume that there are $K=21$ far-field, narrowband and uncorrelated incident sources distributed from $-50°$ to $50°$ with an interval of $5°$. The normalized MUSIC spectra are depicted in Figure 4, where the input signal-to-noise ratio (SNR) is 0dB, and the number of pseudo-sampling snapshots is set to $N_p=100$. We can observe from Figure 4 that the CPA-DCA can only estimate 19 sources, and the individual results seriously deviate from the actual source angels. The reason lies in that the CPA-DCA only utilizes the smallest virtual aperture generated by the DCA, which has a detrimental effect on the spectra. In contrast, the GNA-DSCA and the other six configurations are capable of estimating all the 21 sources. Since the virtual aperture of the NA-DCA and GNA-DCA ($\alpha =5,\beta =6$) are relatively small, their spectra are not as prominent as those of the DSCA-based sparse arrays. As a result, the sparse arrays based on the DSCA can effectively improve the DOA estimation performance.

Figure 4.

Comparison of normalized spatial spectra, where $K=21$, $\mathrm{SNR}=0 \mathrm{dB}$ and $N_p=100$. The blue solid line and the red dashed line represent the estimation results and the actual angels, respectively. (a) NA-DCA; (b) CPA-DCA; (c) GNA-DCA ($\alpha =5,\beta =6$); (d) CPA-DSCA; (e) DsNA; (f) INAwSDCA−I; (g) INAwSDCA−II; (h) GNA-DSCA ($\alpha =1,\beta =11$); (i) GNA-DSCA ($\alpha =5,\beta =6$); (j) GNA-DSCA ($\alpha =5,\beta =11$).

5.3. Root-Mean-Square Error

To examine the accuracy of the GNA-DSCA in DOA estimation, we compare the RMSE of the 21 sources described in Section 5.2 through 200 Monte Carlo trials. The RMSE is calculated by

$$\mathrm{RMSE}=\sqrt{\frac{1}{200\times 21}{\displaystyle \sum _{i=1}^{200}{\displaystyle \sum _{k=1}^{21}{\left({\widehat{\theta }}_k^i-{\theta }_k\right)}^2}}}$$ (31)

where ${\widehat{\theta }}_k^i$ represents the estimated DOA of ${\theta }_k$ in the $i$-th Monte Carlo trial.

The RMSE curves as a function of the SNR and the number of pseudo-sampling snapshots are depicted in Figure 5, where we assume $N_p=100$ for Figure 5a and $\mathrm{SNR}=0 \mathrm{dB}$ for Figure 5b. We can observe from Figure 5a that the estimation accuracy of all configurations improves with the increasing SNR. The RMSE curves of all configurations begin to level off when $\mathrm{SNR}\ge 6 \mathrm{dB}$. For each RMSE point, the GNA-DSCA ($\alpha =5,\beta =11$) outperforms the others, while the CPA-DCA has the worst performance. Noteworthily, although the three GNA-DSCA configurations have the same number of DOFs, the GNA-DSCA ($\alpha =5,\beta =11$) has the best estimation performance over the GNA-DSCA ($\alpha =1,\beta =11$) and GNA-DSCA ($\alpha =5,\beta =6$). The reason for this phenomenon is that the GNA-DSCA ($\alpha =5,\beta =11$) can generate a larger virtual aperture by using the larger dilation factors, which can be considered an equivalent increase in the number of DOFs when the hole-filling strategy is adopted for DOA estimation. Moreover, compared with the DCA-based sparse arrays, the DSCA-based sparse arrays can exploit the DOFs contained in the SCA; thus, they have a superior estimation performance. Therefore, the accuracy of DOA estimation is positively relevant to the number of DOFs. Similar estimation results can also be observed in Figure 5b, where the RMSE curves of all configurations tend to be flat when $N_p\ge 300$.

Figure 5.

Comparison of RMSE, where $K=21$. (a) RMSE versus SNR with $N_p=100$; (b) RMSE versus the number of pseudo-sampling snapshots with $\mathrm{SNR}=0 \mathrm{dB}$.

5.4. Resolution Performance

In the fourth numerical simulations, we compare the resolution performance by estimating two incident sources within a 3dB beam width, which is defined as

$$2{\theta }_{0.5}=2{\sin }^{-1}\left(\frac{1.4\lambda }{\pi Ld}\right)=2{\sin }^{-1}\left(\frac{2.8}{L\pi }\right)$$ (32)

where $L$ denotes the available virtual aperture for DOA estimation. From Table 3, the virtual aperture of the GNA-DSCA ($\alpha =5,\beta =11$) equals 138, which leads to its 3 dB beam width of about $0.740°$.

Figure 6 depicts the normalized spatial spectra, where two close sources are located at $-0.25°$ and $0.25°$ with $\mathrm{SNR}=0 \mathrm{dB}$ and $N_p=100$. We can observe from Figure 6 that the DCA-based sparse arrays and the CPA-DSCA fail to identify the two incident sources within a 3 dB beam width. In contrast, other DSCA-based sparse arrays achieve accurate super-resolution estimation, which is mainly attributed to the larger available virtual aperture. Since a larger virtual aperture can be obtained in the DsNA and GNA-DSCA, their normalized spatial spectra, plotted in Figure 6e,h,i,j, have sharper peaks and more precise estimates than the INAwSDCA−I and INAwSDCA−II. As a result, the larger the virtual aperture is, the higher the resolution is.

Figure 6.

Comparison of resolution, where $K=2$, $\mathrm{SNR}=0 \mathrm{dB}$ and $N_p=100$. The blue solid line and the red dashed line represent the estimation results and the actual angels, respectively. (a) NA-DCA; (b) CPA-DCA; (c) GNA-DCA ($\alpha =5,\beta =6$); (d) CPA-DSCA; (e) DsNA; (f) INAwSDCA−I; (g) INAwSDCA−II; (h) GNA-DSCA ($\alpha =1,\beta =11$); (i) GNA-DSCA ($\alpha =5,\beta =6$); (j) GNA-DSCA ($\alpha =5,\beta =11$).

6. Conclusions

In this paper, we consider the DSCA involving both the temporal and spatial information of the received signal to conduct DOA estimation. We first investigate the generalized nested array based on the DSCA (GNA-DSCA), where the closed-form expression for DOFs is derived as a function of the dilation factors and the number of sensors. The best results, including the dilation factors and DOFs, are presented to exhibit the excellent properties of the GNA-DSCA. Then, a hole-filling strategy is introduced to deal with the virtual array discontinuity caused by the larger dilation factors. Finally, DOA estimation is performed based on the reconstructed Toeplitz matrix. The superiorities of the GNA-DSCA are verified by extensive numerical simulations.

Appendix A. Proof of Lemma 2

• (a)For Lemma 2(a), since ${\mathbb{L}}_{\mathbb{P}}^{+}={\mathbb{D}}_{\mathbb{P}}^{+}\cup {\mathbb{S}}_{\mathbb{P}}^{+}$, we need to analyze the elements in ${\mathbb{D}}_{\mathbb{P}}^{+}$ and ${\mathbb{S}}_{\mathbb{P}}^{+}$, respectively. The set ${\mathbb{D}}_{\mathbb{P}}^{+}$ can be expressed as [20]

$${\mathbb{D}}_{\mathbb{P}}^{+}=\left\{\alpha n_1+\beta n_2|n_1\in \langle 0,N_1\rangle ,n_2\in \langle 0,N_2-1\rangle \right\}$$ (A1)

Since ${\mathbb{S}}_{\mathbb{P}}^{+}$ is the union of self-sum ${\mathbb{S}}_{\mathbb{P}-ss}^{+}$ and cross-sum ${\mathbb{S}}_{\mathbb{P}-cs}^{+}$, it can be given by

$$\{\begin{array}{l}{\mathbb{S}}_{\mathbb{P}}^{+}={\mathbb{S}}_{\mathbb{P}-ss}^{+}\cup {\mathbb{S}}_{\mathbb{P}-cs}^{+}\hfill \\ {\mathbb{S}}_{\mathbb{P}-ss}^{+}=\left({\mathbb{P}}_1+{\mathbb{P}}_1\right)\cup \left({\mathbb{P}}_2+{\mathbb{P}}_2\right)\hfill \\ {\mathbb{S}}_{\mathbb{P}-cs}^{+}=\left({\mathbb{P}}_1+{\mathbb{P}}_2\right)\hfill \end{array}$$ (A2)

where

$${\mathbb{P}}_1+{\mathbb{P}}_1=\left\{\alpha n_1|n_1\in \langle 0,2\left(N_1-1\right)\rangle \right\}$$ (A3)

$${\mathbb{P}}_2+{\mathbb{P}}_2=\left\{2\alpha N_1+\beta n_2|n_2\in \langle 0,2\left(N_2-1\right)\rangle \right\}$$ (A4)

$$\begin{array}{cc}\hfill {\mathbb{P}}_1+{\mathbb{P}}_2& =\left\{\alpha N_1+\alpha n_1+\beta n_2|n_1\in \langle 0,N_1-1\rangle ,n_2\in \langle 0,N_2-1\rangle \right\}\hfill \\ & =\left\{\alpha n_1+\beta n_2|n_1\in \langle N_1,2N_1-1\rangle ,n_2\in \langle 0,N_2-1\rangle \right\}\hfill \end{array}$$ (A5)

According to Equations (16) and (A1)–(A5), the set ${\mathbb{L}}_{\mathbb{P}}^{+}$ can be specified as

$$\begin{array}{cc}{\mathbb{L}}_{\mathbb{P}}^{+}\hfill & ={\mathbb{D}}_{\mathbb{P}}^{+}\cup {\mathbb{S}}_{\mathbb{P}}^{+}={\mathbb{D}}_{\mathbb{P}}^{+}\cup {\mathbb{S}}_{\mathbb{P}-cs}^{+}\cup {\mathbb{S}}_{\mathbb{P}-ss}^{+}\hfill \\ & =\left({\mathbb{D}}_{\mathbb{P}}^{+}\cup {\mathbb{S}}_{\mathbb{P}-cs}^{+}\cup \left({\mathbb{P}}_1+{\mathbb{P}}_1\right)\right)\cup \left({\mathbb{P}}_2+{\mathbb{P}}_2\right)\hfill \\ & =\left\{\alpha n_1+\beta n_2|n_1\in \langle 0,2N_1-1\rangle ,n_2\in \langle 0,N_2-1\rangle \right\}\cup \left\{2\alpha N_1+\beta n_2|n_2\in \langle 0,2\left(N_2-1\right)\rangle \right\}\hfill \\ & =\left\{\alpha n_1+\beta n_2|n_1\in \langle 0,2N_1-1\rangle ,n_2\in \langle 0,N_2-1\rangle \right\}\cup \left\{\alpha n_1+\beta n_2|n_1=2N_1,n_2\in \langle 0,2\left(N_2-1\right)\rangle \right\}\hfill \\ & =\left\{\alpha n_1+\beta n_2|n_1\in \langle 0,2N_1\rangle ,n_2\in \langle 0,N_2-1\rangle \right\}\cup \left\{\alpha n_1+\beta n_2|n_1=2N_1,n_2\in \langle 0,2\left(N_2-1\right)\rangle \right\}\hfill \\ & ={\mathbb{L}}_1^{+}\cup {\mathbb{L}}_2^{+}\hfill \end{array}$$ (A6)

where ${\mathbb{L}}_1^{+}=\left\{\alpha n_1+\beta n_2|n_1\in \langle 0,2N_1\rangle ,n_2\in \langle 0,N_2-1\rangle \right\}$, ${\mathbb{L}}_2^{+}=\left\{\alpha n_1+\beta n_2|n_1=2N_1,n_2\in \langle N_2,2\left(N_2-1\right)\rangle \right\}$.

From Equation (A6), we know that the consecutive lags can only be generated in ${\mathbb{L}}_1^{+}$ for the case $\alpha \in \langle 1,N_2\rangle ,\beta \in \langle 2,2N_1+1\rangle$. Hence, we need proof that there exist $n_1\in \langle 0,2N_1\rangle$ and $n_2\in \langle 0,N_2-1\rangle$, so that $s=\alpha n_1+\beta n_2$ traverses all the integers in the range $\langle g_1,g_2\rangle$, where $g_1=\left(\alpha -1\right)\left(\beta -1\right)$ and $g_2=2\alpha N_1+\beta N_2-\alpha \beta +\alpha -1$.

The independent variable $n_2\in \langle 0,N_2-1\rangle$ can be reformulated as

$$0\le \beta n_2\le \beta \left(N_2-1\right)$$ (A7)

Introducing $\alpha n_1=s-\beta n_2$ and $\left(\alpha -1\right)\left(\beta -1\right)\le s\le 2\alpha N_1+\beta N_2-\alpha \beta +\alpha -1$ into Equation (A7), we can obtain

$$\beta \left(\alpha -N_2\right)-\alpha +1\le \alpha n_1\le \beta \left(N_2-\alpha \right)+2\alpha N_1+\alpha -1$$ (A8)

Since $\alpha \in \langle 1,N_2\rangle$, we have $\alpha -N_2\le 0$ and $N_2-\alpha \ge 0$. Thus, Equation (A8) can be simplified as

$$-\alpha +1\le \alpha n_1\le 2\alpha N_1+\alpha -1$$ (A9)

Dividing Equation (A9) by $\alpha$ yields

$$-1+1/\alpha \le n_1\le 2N_1+1-1/\alpha$$ (A10)

Since $1/\alpha \le 1$, Equation (A10) can be further expressed as $0\le n_1\le 2N_1$, which is satisfied with the set ${\mathbb{L}}_1^{+}$.

Notice that if $\alpha \in \langle 1,N_2\rangle ,\beta =1$, we can easily prove that the range of consecutive lags in ${\mathbb{L}}_1^{+}$ and ${\mathbb{L}}_2^{+}$ are $\langle 0,2\alpha N_1+N_2-1\rangle$ and $\langle 0,2\alpha N_1+N_2-1\rangle$, respectively. Therefore, ${\mathbb{L}}_{\mathbb{P}}^{+}$ enjoys all the consecutive lags in the range $\langle 0,2\left(\alpha N_1+N_2-1\right)\rangle$.

• (b)For Lemma 2(b), we take the positive set ${\mathbb{L}}_{\mathbb{P}}^{+}$ as an example. We need proof that ${\mathbb{L}}_{\mathbb{P}}^{+}$ possesses $g$ unique lags for the case $\alpha \in \langle 1,N_2\rangle ,\beta \in \langle 1,2N_1+1\rangle$, where $g=2\alpha N_1+\left(\beta +1\right)N_2-\alpha \beta +\alpha -1$.

The maximum lags in the set ${\mathbb{L}}_1^{+}$ are calculated as

$$s_{\max }=2\alpha N_1+\beta \left(N_2-1\right)$$ (A11)

In the case $\alpha \in \langle 1,N_2\rangle ,\beta \in \langle 2,2N_1+1\rangle$, the distributions of the unique lags in the positive set ${\mathbb{L}}_{\mathbb{P}}^{+}$ are depicted in Figure A1, which is composed of four segments (${\mathsf{\Gamma }}_1,{\mathsf{\Gamma }}_2,{\mathsf{\Gamma }}_3,{\mathsf{\Gamma }}_4$). Based on Lemma 2(a), we can conclude that only ${\mathsf{\Gamma }}_2$ is a continuous segment, while holes exist in ${\mathsf{\Gamma }}_1$, ${\mathsf{\Gamma }}_3$ and ${\mathsf{\Gamma }}_4$. Thereby, the number of unique lags in the segment ${\mathsf{\Gamma }}_3$ satisfies

$$\begin{array}{l}0\le {\kappa }_3\le s_{\max }-g_2\\ \Rightarrow 0\le {\kappa }_3\le \left(\alpha -1\right)\left(\beta -1\right)\end{array}$$ (A12)

Figure A1.

The distributions of the unique lags in the positive set ${\mathbb{L}}_{\mathbb{P}}^{+}$, where circles and crosses denote the unique lags and holes, respectively.

Due to the coprime characteristic of $\alpha$ and $\beta$ in [24], we can draw the conclusion that ${\kappa }_3=\left(\alpha -1\right)\left(\beta -1\right)/2$. Likewise, the number of unique lags in the segment ${\mathsf{\Gamma }}_1$ equals ${\kappa }_1=\left(\alpha -1\right)\left(\beta -1\right)/2$. From Equation (A6), we can know the number of unique lags in the segment ${\mathsf{\Gamma }}_4$ when ${\kappa }_4=N_2-1$.

Therefore, the number of unique lags in the positive set ${\mathbb{L}}_{\mathbb{P}}^{+}$ is equal to

$$\begin{array}{ll}g& =g_2-g_1+1+{\kappa }_1+{\kappa }_3+{\kappa }_4\\ & =2\alpha N_1+\left(\beta +1\right)N_2-\alpha \beta +\alpha -1\end{array}$$ (A13)

Note that, if $\alpha \in \langle 1,N_2\rangle ,\beta =1$, the set ${\mathbb{L}}_{\mathbb{P}}^{+}$ includes all the consecutive lags in the range $\langle 0,2\left(\alpha N_1+N_2-1\right)\rangle$. Thus, the number of unique lags in ${\mathbb{L}}_{\mathbb{P}}^{+}$ equals

$$g=2\left(\alpha N_1+N_2-1\right)+1$$ (A14)

In summary, in the case $\alpha \in \langle 1,N_2\rangle ,\beta \in \langle 1,2N_1+1\rangle$, the total number of unique lags in the set ${\mathbb{L}}_{\mathbb{P}}^{+}$ reaches

$$g=2\alpha N_1+\left(\beta +1\right)N_2-\alpha \beta +\alpha -1$$ (A15)

This completes the proof. □

Appendix B. Solution of Equation (17)

The partial derivatives of $g$ with respect to $\alpha$ and $\beta$ can be calculated as

$$\{\begin{array}{l}\frac{\partial g}{\partial \alpha }=2N_1+1-\beta >0\hfill \\ \frac{\partial g}{\partial \beta }=N_2-\alpha \ge 0\hfill \end{array}$$ (A16)

We can observe from Equation (A16) that the function $g$ increases monotonically, which indicates that the DOFs are the maximum when $\alpha$ or $\beta$ take the maximum value. To further determine the exact value, $g$ can be reformulated as

$$\begin{array}{cc}\hfill g& =2\alpha N_1+\left(\beta +1\right)N_2-\alpha \beta +\alpha -1\hfill \\ & =\alpha \left(2N_1+1-\beta \right)+\left(\beta +1\right)N_2-1\hfill \\ & =\beta \left(N_2-\alpha \right)+\alpha \left(2N_1+1\right)+N_2-1\hfill \end{array}$$ (A17)

We can see from Equations (A16) and (A17) that, when $\alpha =N_2$ or $\beta =2N_1+1$, $g$ can always obtain the maximum value, i.e., $g_{\max }=2N_1{N}_2+2N_2-1$.

This completes the proof. □

Author Contributions

Conceptualization, Y.Z. and G.H.; methodology, Y.Z. and C.Z.; software, C.Z.; validation, Y.Z.; formal analysis, J.B.; investigation, J.B.; resources, G.H. and H.Z.; data curation, Y.Z. and G.H.; writing—original draft preparation, Y.Z. and G.H.; writing—review and editing, Y.Z. and G.H.; visualization, S.G.; supervision, G.H. and H.Z.; project administration, G.H.; funding acquisition, G.H. and H.Z. All authors have read and agreed to the published version of the manuscript.

Data Availability Statement

The data that support the findings of this research are available from the corresponding author.

Conflicts of Interest

The authors declare no conflict of interest.

Funding Statement

This research received no external funding.