Herein, we estimate the direction of arrival (DOA) of non-Gaussian signals for nested arrays (NAs) by implementing the fourth-order difference co-array (FODC) and successive methods. In particular, c...

Direction of arrival (DOA) estimation for non-Gaussian signals using three-level nested array (THL-NA) is investigated in this paper. Motivation from larger consecutive degree of freedom (DOF) and array aperture, the THL-NA is proposed, which can take full advantages of the consecutive coarrays of TL-NA and has the closed-form expression of DOF. Specifically, firstly, the array aperture is expanded by the second order sum coarray (2-SC) of the proposed array, secondly, the nested relationship between subarrays is employed to obtain the difference coarray of 2-SC (2-DCSC), finally, a consecutive virtual array with large array aperture is obtained. Besides, a successive SS-MUSIC algorithm is proposed, which employs the spatial smoothing estimating signal parameter via rotational invariance techniques (SS-ESPRIT) algorithm and partial spectrum searching multiple signal classification (PSS-MUSIC) to obtain initial estimations and fine estimations, respectively, resulting in a better balance between computational complexity and estimation accuracy.

While the two-dimensional (2D) spectral peak search suffers from expensive computational burden in direction of arrival (DOA) estimation, we propose a reduced-dimensional root-MUSIC (RD-Root-MUSIC) algorithm for 2D DOA estimation with coprime planar array (CPA), which is computationally efficient and ambiguity-free. Different from the conventional 2D DOA estimation algorithms based on subarray decomposition, we exploit the received data of the two subarrays jointly by mapping CPA to the full array of the CPA (FCPA), which contributes to the enhanced degrees of freedom (DOFs) and improved estimation performance. In addition, due to the ambiguity-free characteristic of the FCPA, the extra ambiguity elimination operation can be avoided. Furthermore, we convert the 2D spectral search process into 1D polynomial rooting via reduced-dimension transformation, which substantially reduces the computational complexity while preserving the estimation accuracy. Finally, numerical simulations demonstrate the superiority of the proposed algorithm.

In this paper, the low‐complexity tensor completion (LTC) scheme is proposed to improve the efficiency of tensor completion. On one hand, the matrix factorization model is established for complexity reduction, which adopts the matrix factorization into the model of low‐rank tensor completion. On the other hand, we introduce the smoothness by total variation regularization and framelet regularization to guarantee the completion performance. Accordingly, given the proposed smooth matrix factorization (SMF) model, an alternating direction method of multiple‐ (ADMM‐) based solution is further proposed to realize the efficient and effective tensor completion. Additionally, we employ a novel tensor initialization approach to accelerate convergence speed. Finally, simulation results are presented to confirm the system gain of the proposed LTC scheme in both efficiency and effectiveness.

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.

In this paper, we investigate the problem of sparse array design for the direction of the arrival (DOA) of non-Gaussian signals and exploit the unfolded coprime linear array with three subarrays (UCLATS) to obtain physical sensors location. With the motivation from the large consecutive degree of freedom (DOF), we optimize the process of obtaining physical sensors location from two steps. Specifically, the first is to model the process of obtaining the longest consecutive virtual sum co-array from a given number of physical array elements into a global postage-stamp problem (GPSP), whose solution can be employed to determine the locations of the longest possible consecutive sum co-array (2-SC) and initial physical array. The second step is to multiply the location of the virtual sum co-array by appropriate coprime coefficients to generate UCLATS and then multiply the initial physical array position by the same corresponding coefficients to obtain physical sensors location. Besides, an algorithm is proposed to obtain DOA estimates, which employs the discrete Fourier transform (DFT) method and partial spectrum searching multiple signal classification (PSS-MUSIC) algorithm to obtain initial estimates and fine estimates, respectively, termed as the DFT-MUSIC method. Compared with the traditional total spectrum searching MUSIC (TSS-MUSIC) algorithm, the DFT-MUSIC method performs the same asymptotical performance of DOA estimation with less than 10% complex multiplication times, which can be verified by numerical simulations under the same condition.