Abstract

In this paper, a sparse array design problem for non-Gaussian signal direction of arrival (DOA) estimation is investigated. Compared with conventional second-order cumulant- (SOC-) based methods, fourth-order cumulant- (FOC-) based methods achieve improved DOA estimation performance by utilizing all information from received non-Gaussian sources. Considering the virtual sensor location of vectorized FOC-based methods can be calculated from the second order difference coarray of sum coarray (2-DCSC) of physical sensors, it is important to devise a sparse array design principle to obtain extended degree of freedom (DOF). Based on the properties of unfolded coprime linear array (UCLA), we formulate the sparse array design problem as a global postage-stamp problem (GPSP) and then present an array design method from GPSP perspective. Specifically, for vectorized FOC-based methods, we divide the process of obtaining physical sensor location into two steps; the first step is to obtain the two consecutive second order sum coarrays (2-SC), which can be modeled as GPSP, and the solutions to GPSP can also be utilized to determine the physical sensor location sets without interelement spacing coefficients. The second step is to adjust the physical sensor sets by multiplying the appropriate coprime coefficients, which is determined by the structure of UCLA. In addition, the 2-DCSC can be calculated from physical sensors directly, and the properties of UCLA are given to confirm the degree of freedom (DOF) of the proposed geometry. Simulation results validate the effectiveness and superiority of the proposed array geometry.

1. Introduction

In array signal processing, direction of arrival (DOA) estimation has drawn considerable attention, which has been widely applied in various fields, such as communication, radar, and navigation [1, 2]. To obtain improved DOA estimation performance, the sparse arrays with reduced mutual coupling and enhanced degree of freedom (DOF) have been proposed, whose adjacent sensor spacing is no longer limited to half wavelength, as compared with uniform linear array (ULA). Minimum redundancy array (MRA) [3], minimum holes array (MHA) [4], coprime array (CA) [5], and nested array (NA) [6] have been proposed, which are designed based on the second-order cumulant (SOC) for Gaussian signals. Besides, these arrays utilize second order difference coarray (2-DC) or second order difference coarray of sum coarray (2-DCSC) generated by vectorization operation to obtain virtual sensors, which can be used to construct virtual nonuniform linear array (NLA) or ULA. Once the equivalent received signal of the virtual array is constructed, the DOA estimates can be obtained by compressed sensing (CS) [7], discrete Fourier transform (DFT) algorithm [8], and other algorithms. Nevertheless, there still exist some drawbacks for these sparse arrays. Specifically, there is no closed-form expression of physical sensor positions for the MRA and MHA. The CA structures generate holes in the difference coarray which decreases the consecutive DOF, and the NA structures suffer from severe mutual coupling due to the dense part. In order to tackle these issues, some sparse arrays with enhanced DOA estimation performance based on NA or CA have been proposed, such as augmented NA (ANA) [9], the generalized CA with displaced subarrays (CADiS) [10], unfolded coprime linear array (UCLA) [11, 12], and augmented CA (ACA) [13].

It is noteworthy that all aforementioned sparse arrays mentioned above are all designed based on SOC, which is available for Gaussian signals. In practice, most sources are non-Gaussian, and fourth-order cumulant (FOC) matrix is exploited instead of SOC to calculate correlation matrix [14, 15]. In particular, the FOC-based methods employ second order difference coarray of sum coarray (2-DCSC) to obtain virtual sensors with vectorization operation [16, 17]. As the 2-DC and second order sum coarray (2-SC) are utilized successively, it is complicated to obtain the location relationship between physical sensors and 2-DCSC. In [17], Fu et al. employed virtual nested multiple-input multiple-output (MIMO) array [18], which utilized fourth order difference coarray of sum coarray (4-DCSC), termed as NA-MIMO-DCSC. The authors optimized the process of obtaining 4-DCSC separately, i.e., fourth order sum coarray (4-SC) and 2-DC, which further improved DOF greatly when FOC was employed in MIMO systems. Unfortunately, limited to the properties of NA, the virtual sensors still suffered from a lot of redundancy in the steps of optimizing 2-DC. More importantly, the design principle of NA-MIMO-DCSC neglected the discussion of cross-sum coarray generated in the process of obtaining 4-SC.

In this paper, we propose a sparse array design method for non-Gaussian signal from the perspective of global postage-stamp problem (GPSP) [19, 20]. To further illustrate this method, the two steps of obtaining sparse array geometry based on the structure of UCLA are described. Specifically, the first step is to get the longest possible two 2-SC from given sensor number of each subarray, which can be modeled as a GPSP. The solution to GPSP can also be used to obtain initial physical sensor location sets with half-wavelength interelement spacing. Subsequently, the second step is to adjust the physical sensor location sets by multiplying the appropriate coefficients, which can be determined based on the structure of UCLA. To verify the priority of the proposed array geometry, the properties of UCLA about DOF and consecutive virtual sensors are also provided. Furthermore, the expression between the DOF of proposed geometry and physical sensors is presented, and the relationship between 2-SC and cross-sum coarray is also analyzed in Section 4.1.

In particular, the contributions of this paper are summarized as follows: (1)We investigate the array design problem of sparse array with non-Gaussian signals and tackle this problem by obtaining the longest possible virtual 2-SC and exploiting the properties of UCLA(2)We formulate the obtaining longest possible 2-SC problem as a GPSP and give a simple solution to the GPSP, which can be used to determine the location sets. Furthermore, we provide the closed-form expression of maximum DOF and consecutive virtual sensors of UCLA with 2-DC, which is used to analyze the DOF of proposed array geometry(3)We devise a sparse design principle which divides the process of obtaining sparse array location into two steps, i.e., obtaining the 2-SC from the given number of subarray and determining the location of physical sensors with multiplication operation

We outline this paper as follows. In Section 2, we present the sparse array model and mutual coupling effect; besides, the properties of UCLA are also investigated. Section 3 elaborates the GPSP and proposed array geometry with enhanced DOF. Section 4 gives the performance analysis. Section 5 provides simulation results, and the conclusions are drawn in Section 6.

Notations. Vectors and matrices are represented by utilizing bold low-case and bold-case characters, respectively. is Kronecker product, and denotes Khatri-Rao product. , , , and stand for the transpose, conjugate transpose, inverse, and complex conjugation of a vector or matrix, respectively. denotes the vectorization operation. is the diagonal matrix operator, and means the Frobenius norm.

2. Preliminaries

In this section, we first present the definitions of 2-DC, 2-SC, and 2-DCSC. Subsequently, considering that the 2-SC of proposed array geometry is constructed based on the UCLA, we exploit the properties of UCLA in terms of DOF and consecutive lag location. Finally, we provide the sparse array model without mutual coupling and with mutual coupling, respectively.

2.1. 2-DC, 2-SC, and 2-DCSC

For a linear array with physical sensors, whose location set can be denoted as , where represents the location of -th sensor.

Definition 1 (2-DC). The second order difference coarray location can be defined as [6] where and represent the positive and negative elements of , respectively.

Definition 2 (2-SC). The second order sum coarray location can be defined as [17]

Definition 3 (2-DCSC). The second order difference coarray of sum coarray location can be defined as where and represent the physical sensors and 2-DC location sets, respectively.

2.2. The Properties of UCLA

Figure 1 shows the configuration of UCLA, which is composed of two sparse uniform subarrays that overlap at the origin. The sensor position of UCLA can be represented as [11, 12] where and represent the physical sensors of subarray 1 and subarray 2, respectively. , and is the wavelength.

According to Definition 1, the 2-DC of UCLA can be denoted as , and . In addition, the properties of UCLA are derived in the Lemma 4.

Lemma 4. The following properties hold for UCLA: (a)There are distinct lags in set or (b) contains the consecutive lags with element spacing in the range of

Proof. See the Appendix A.
As described in Lemma 4, the DOF of UCLA can be given by

2.3. Sparse Array Model without Mutual Coupling

Assume that there are far-field narrowband uncorrelated non-Gaussian signals impinging on a nonuniform linear array with DOAs where denotes the elevation angle of the -th target. The location set of nonuniform linear array with physical sensors can be denoted as ; then, the received signal can be expressed as [21]. where represents the steering matrix, and is the steering vector, denotes wavelength. deotes the non-Gaussian signals matrix with mean zero, where represents the total number of snapshots and is the additive Gaussian noise with variance and mean zero.

The FOC matrix of the received signal can be calculated by [14, 15] where whose elements can be constructed by with the specific form . denotes the FOC of , where is the cumulant operator.

To obtain the equivalent received signal from the virtual array, we vectorize as [17, 22] where whose elements are constructed by with the specific form , and , denotes the power of -th source.

2.4. Sparse Array Model with Mutual Coupling

In practice, each sensor will inevitably be affected by the radiation of from its adjacent sensors, and consequently, the received signal should be modified in the presence of mutual coupling. That means the mutual coupling effect must be taken into consideration. Specifically, the signal model in (6) can be refined as where represents the mutual coupling matrix. By utilizing the -band model in [23], the elements in the mutual coupling matrix can be represented by where and , represents the maximum spacing between the coupled sensor pairs [23]. In order to measure the strength of the mutual coupling effect, the coupling leakage is introduced and is defined as

Based on the mutual coupling model in (12), the equivalent signal model in (9) can be reconstructed as where .

3. Sparse Array Design Principle

Motivated by the advantages of the sparse arrays over the uniform arrays, several sparse array configurations as well as design methods have been proposed. Unfortunately, most existing array design methods generate the difference coarray based on the SOC while the FOC with great potentiality in improving array performance is neglected. In this part, we devise a sparse array principle based on 2-DCSC employed by vectorized FOC-based method.

In fact, because 2-DCSC performs twice 2-DC operations on physical sensors, which can also be converted into 2-SC and 2-DC operations, successively, as described in (3). The relationship between virtual sensors and physical sensors is complicated; it is difficult to obtain the closed-form expression of physical location with large DOF. We optimize the process of obtaining the location of physical sensor location into two steps, i.e., obtaining longest possible 2-SC of each subarray, constructing physical sensor location set based on the structure of UCLA. Specifically, the first step can be modeled as GPSP, whose solution can be used to determine the physical sensor set lacking interelement spacing coefficients. The second step employs the structure of UCLA to adjust the self-sum coarray set obtained by the first step, which can also be used to determine the spacing of physical sensors. As a result, the physical sensor location set can be obtained. According to (3), the 2-DCSC can be calculated from physical sensor set directly.

3.1. Global Postage-Stamp Problem (GPSP)

The GPSP is a well-known combination problem that has not yet been fully solved, which can be described as follows: for given positive integers and , a set with nonnegative integers is determined by

Remark 5. The elements in need to be summed times to realize the consecutive numbers . Besides, the value of should be as large as possible.
The solution to the GPSP has been investigated in [19, 20]. Herein, we also give a simple method to solve GPSP. Specifically, can be considered as the maximum number of stamps on an envelope; is the set of stamp denominations with non-negative value. Then, the computational complexity of obtaining all possible combinations is . An example is given to illustrate the solution method to GPSP explicitly. When , in this case, 1 and 2 stamps are required to obtain postages 1 and 2, respectively. For postage 3, there are two combinations, i.e., one stamp with postage 3 or three stamps with postage 1. According to Remark 5, because of the existence of postage 0, the number of stamps currently required should be as small as possible. Besides, it can be concluded that the minimum can be obtained by comparing all the postage combinations. The process of this method is summarized in Algorithm 1, where . It is noteworthy that is treated as prior information to obtain . When is unknown, its ()-th element should satisfy where represents -th element of , . Then, all elements of can be obtained by enumerating all the values of . The result of Algorithm 1 is listed in Table 1, which is also provided in [20].

Input: stamps value set , number of stamps types , sum times
Output: Maximum consecutive postage
1: initialize:
2: whiledo
3: , ,
4: whiledo
5:  ifthen
6:   :  end if
8: end while
9: end while
10: return
3.2. Sparse Array Design Based on UCLA

The design methods for sparse arrays based on SOC only utilize 2-DC or 2-SC once, which can be extended to FOC-based array directly by adding 2-DC calculation. But this approach neglects the specifical output of first operation, resulting in a large amount of redundancy, and the DOF loss is inevitable. Suppose that the physical sensors are composed of multiple linear subarrays, and the number of elements in each subarray has been given.

Without loss of generality, assume that the physical sensors are composed of two subarrays with and elements, respectively. As illustrated in Section 3, to obtain the longest possible 2-SC of each subarray, the integer sets and are solved from GPSP in (15) with , which can be used to determine the largest possible lags and . It is noteworthy that the sets and can be considered as the initial physical location sets without coefficients. Based on Remark 5, if all elements of are negative, the consecutive integer set obtained from is where represents a set with elements and is the largest possible integer mentioned in Remark 5. Similarly, the consecutive positive integer set obtained from is

Based on the structure of UCLA, we multiply all the elements in (17) and (18) by certain coefficients and , respectively; then, the new sets can be constructed as the two cosubarrays of UCLA. Specifically, the cosubarray 1 of UCLA location set associated with (17) can be expressed as where is the interelement spacing of cosubarray 1; , and is wavelength. The cosubarray 2 location set associated with (18) can be expressed as where is the interelement spacing of cosubarray 2. Note that and should be set as coprime integers.

Finally, we calculate the location set of physical sensors according to the correspondence between the physical array and coarrays . The coarrays determined by (19) and (20) can be considered as the 2-SC result of each subarray or the self-sum coarray of . Considering that the 2-SC of and have been multiplied by or , then the physical sensor location can be determined by multiplication operation,

Based on the discussion described above, we give an example of the proposed geometry shown in Figure 2 to verify. For given element number in two subarrays with , firstly, the initial consecutive integer sets , , and the largest possible values can be obtained by the solution to GPSP, which have been listed in Table 1. Subsequently, the cosubarrays spacing can be obtained by the specifical structure of UCLA. The two 2-SC cosubarray locations can be expressed as , . Consequently, the physical sensor location set is represented by .

3.3. The Design Procedure of the Proposed Array Structure

We summarize the detailed steps for implementation of obtaining the proposed array geometry as follows: (1)Based on Table 1, the integer sets and and the longest possible consecutive numbers and can be determined by the solution to GPSP from given number of sensors and (2)Obtain the location sets of two 2-SC and (3)Determine the physical sensor set by performing multiplication operation on and

4. Performance Analysis

In this part, we evaluate the performance of the proposed array geometry compared to other arrays from the viewpoints of achievable DOF, mutual coupling, redundancy ratio, and Cramer-Rao Bound.

4.1. Achievable DOF

We analyze the achievable DOF of the proposed array geometry. Considering that the and can be associated with the cosubarrays of UCLA , then according to Lemma 4, the DOF for the 2-DC of is . Based on Definition 1, the position of 2-DC is symmetric about the origin. To illustrate this, we present the nonnegative part of the 2-DC of , as shown in the upper part of Figure 3. Besides, the DOF of NA-MIMO-DCSC has been given in [17], which can be expressed as where represents the DOF of array NA-MIMO-DCSC. As for the proposed array geometry, we can obtain the following relationship where represents the DOF of the proposed array geometry.

As expounded in the appendix, the 2-DC can be decomposed into self-difference coarray and cross-difference coarray; similarly, the 2-SC can also be decomposed into self-sum coarray and cross-sum coarray. For the proposed geometry, the processes of obtaining two 2-SC of the two subarrays are separated, where only self-sum coarray is utilized while the cross-sum coarray is neglected, i.e., all elements in are included in the 2-SC of . Thus, the 2-DCSC of contains all elements in the 2-DC of . Consequently, equation (23) is established. The nonnegative part of 2-DCSC of the proposed geometry is also given in the bottom part of Figure 3 to verify analysis mentioned above.

However, the DOF of proposed geometry only has lower bound without closed-form expression, because the location of cross-sum coarray of the 2-SC is not available. Interestingly, for NA-MIMO-DCSC, the 2-DCSC and the 2-DC of exactly coincide.

According to (22) and (23), we have

It can be concluded that the proposed array geometry can offer larger DOF than NA-MIMO-DCSC, which is also verified in Figure 4 below.

Definition 6 (redundancy ratio). For a physical array with total number of virtual sensors obtained from difference coarray and the achievable DOF is given by , we define the redundancy ratios as For a linear array with physical sensors, in general, the number of virtual sensors is when the correlation matrix is calculated by SOC-based method, and when FOC-based method is exploited, . Redundancy ratio can be considered as an important indicator which reflects the efficiency of virtual sensors.

4.2. Cramer-Rao Bound

The Cramer-Rao Bound (CRB) can be obtained from the inverse of the Fisher information matrix (FIM). According to [24, 25], we give the FIM for the signal model in (9) via vectorization-based methods as where denotes the number of snapshots, and can be obtained by (7). , , represent the power of non-Gaussian signals. Consequently, the CRB of the DOA estimation with the proposed geometry via vectorization operation can be expressed as

5. Simulation Results

In this section, 500 Monte-Carlo simulations via CS algorithm are employed to validate the superiority of the proposed array geometry in the presence of mutual coupling. Define the root mean square error (RMSE) as where denotes the true elevation of the -th target and is the estimated value of in the -th Monte Carlo simulation. is the total number of the incident signals which are uncorrelated far-field non-Gaussian. Besides, the searching interval of CS algorithm is , and the coefficients of mutual coupling are set as shown in Section 2.4.

5.1. RMSE Performance Comparison of Different Sparse Arrays versus SNR

In this part, we compare the RMSE performance of the different sparse arrays involved in Figure 4, including the CA [5], NA [6], ACA [13], unfolded ACA, UCLA [11], ANAI-1 [9], ANAI-2 [9], MRA [3], proposed geometry, and NA-MIMO-DCSC [17]. Besides, the location sets of physical sensors in the above arrays with 8 sensors are also given in Figure 4. Figures 5 and 6 depict the DOA estimation performance and CRB performance comparison of different arrays versus SNR, respectively, where and .

As shown in Figures 5 and 6, it is observed that the DOA estimation performance of all arrays improves with the increase of SNR, and in particular, the proposed array geometry outperforms the other sparse arrays. The ACA and CA achieve the worst RMSE performance due to the reduced DOF, and the dense part of the NA results in significantly higher mutual coupling. The UCLA enjoys the maximum DOF and the minimum coupling leakage among the arrays design based on SOC, leading to better performance. The self-sum coarray of proposed array geometry is devised to the UCLA, which takes full advantage of the UCLA. According to Figure 4, the coupling leakage of the proposed geometry is much lower than the others, and the DOF is also significantly higher than other arrays, especially those based on SOC design. Due to the optimization of DOF and mutual coupling, the proposed array geometry achieves the best RMSE performance which is superior to CA, NA, ACA, UACA, UCLA, ANAI-1, ANAI-2, MRA, and NA-MIMO-DCSC.

5.2. RMSE Performance Comparison of Different Sparse Arrays versus Snapshots

Figures 7 and 8 depict the RMSE performance of different arrays versus snapshots, where and . As can be seen in Figures 7 and 8 that with the increased number of snapshots, the CRB and DOA performance become better due to the more accurate FOC matrix.

It is also shown clearly in Figures 7 and 8 that the proposed geometry achieves the best DOA estimation performance among all the compared sparse arrays. The 2-DCSC of CA, NA, ACA, UACA, UCLA, ANAI-1, ANAI-2, and MRA are obtained from extending SOC to FOC directly, which perform twice 2-DC on arrays manifolds successively. As a result, lots of redundancy is generated, which means a reduction in DOF, but NA-MIMO-DCSC and the proposed geometry are all based on the solution to GPSP, which reduces redundancy ratio greatly, resulting in the superior DOA estimation and CRB performance to the other sparse arrays.

6. Conclusion

In this paper, a sparse array design method for non-Gaussian signals DOA estimation is presented from the perspective of GPSP, and a sparse array geometry based on UCLA is given to illustrate. For vectorized FOC-based DOA estimation algorithms, we divide the process of obtaining physical sensor location sets into two steps. Specifically, the first step of obtaining the longest possible 2-SC is modeled as a GPSP, whose solutions can also be employed to determine the initial physical location sets without spacing coefficients. Then, the second step is to multiply the physical sensor sets by appropriate coefficients based on the structure of UCLA. Besides, the properties of UCLA in terms of DOF and the location of consecutive lags are exploited. Numerical simulations corroborate the superiority of the proposed geometry in terms of DOF, mutual coupling, CRB, and DOA estimation performance. Considering the relationship between 2-DCSC and physical sensors is quite complicated, the design principle with splitting 2-DCSC into 2-SC and 2-DC will contribute to our future work effectively.

Appendix

Proof of Lemma 4

(a)According to Definition 1, the difference coarray of UCLA is the union of self-difference coarray set and cross-difference coarray set , specifically where . Obviously, , , i.e., Suppose that and are two arbitrary elements in set , where and . If , then where and . Combing that and are coprime integers, equation (A.3) cannot hold. Based on Definition 1, the elements in and are opposite to each other; thus, there are distinct lags in set or .(b)It is necessary to prove that there exists so that contains all consecutive elements in the set , i.e., The condition can be rewritten as Considering (A.4) and (A.5) jointly, we can get the following relationship as which can be simplified as Because of the constraints and , then the integer must satisfy the following condition Combining the result of (A.8) with in (A.5), the continuity of is proved.

Data Availability

The data used to support the findings of this study are available from the corresponding author upon reasonable request.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This work is supported by the China NSF Grants (61971217, 61971218, 61631020), the fund of Sonar technology key laboratory (research on the theory and algorithm of signal processing for two-dimensional underwater acoustics coprime array) and the fund of Sonar technology key laboratory (range estimation and location technology of passive target via multiple array combination), and the Graduate Innovative Base (Laboratory) Open Funding of the Nanjing University of Aeronautics and Astronautics under Grant kfjj20200421.