Search

In this paper, we design a low-complexity direction-of-arrival (DOA) estimation algorithm based on the unitary approximate message passing (UAMP) and Bernoulli-Gaussian (BG) prior. We first show that the estimation of DOA can be transferred into a sparse signal recovery problem, where we turn to UAMP with damping technique to solve this problem. Furthermore, we assume the BG prior on the sparse vector to be estimated, resulting in the fast estimation of the positions of non-zero elements. Moreover, expectation maximum (EM) is leveraged to automatically learn the BG parameters. Compared to the state-of-the-art UAMP-based algorithm with sparse Bayesian learning (SBL), the proposed approach can achieve the same DOA mean square error (MSE) performance with a much faster convergence speed. [ABSTRACT FROM AUTHOR]

In this paper, we study the regularization l p -norm minimization problem to recover the sparse signals. We first prove that every global optimal solution to the regularization l p -norm minimization problem also solves the l 0 -norm minimization problem if the certain conditions are satisfied, and then generate a truncated approximated difference algorithm to recover the sparse signals. At last, we provide some numerical simulations to test the performance of the truncated approximated difference algorithm, and the numerical results show that the proposed algorithm performs effectively in recovering the sparse signals compared with some state-of-art methods. [ABSTRACT FROM AUTHOR]

In underwater acoustics, compressive sensing was applied to the separation of multiple raypaths based on direction of arrival (DOA) estimation. While it is impossible to separate raypaths directly without eliminating the interference between raypaths. This paper proposes a subspace-based higher-order compressive sensing algorithm, which enables separating raypaths interrupted by colored noise. In the algorithm, a trispectrum matrix is first calculated from the signal received on the reception array. To improve the robustness against noise, the trispectrum matrix is decomposed into signal and noise subspaces using an eigenvalue decomposition. Then, a subspace-based higher-order convex optimization problem is designed based on the signal subspace. The separation of raypaths is cast as the optimization problem solved in a greedy strategy approximation. The results obtained in both simulations and experiments show that the present method not only achieves the more precise separation of raypaths, but it also provides better suppression of noise as compared to the other algorithms. [ABSTRACT FROM AUTHOR]

• The proposed approach satisfies the need for precise focusing of spatial energy and, at the same time, meets spectral compatibility requirements. • The approach with a strict convergence and low computational complexity is proposed to solve the joint optimization problem. • A new update method for similarity constraint is proposed to utilize the freedom degree of signal space better. This paper aims to design multiple-input multiple-output (MIMO) radar transmit waveform that is able to focus energy on the target space-frequency domains while avoiding specific space-frequency domains for communicational devices. Specifically, the waveform design is recast as a joint optimization problem wherein the interference-to-signal energy ratio cost function turns out to be non-convex and non-smooth. In order to solve such an optimization problem, in this paper, an iterative optimization algorithm is proposed, wherein each iteration the majorization minimization (MM) scaling is firstly performed to the logarithmic cost function, and then the best alternative performance waveform vector is analytically achieved. As a result, the proposed algorithm can form a deep radiation energy null in the space-frequency domain where the communicational devices are expected to be located, and at the same time develop a higher radiation energy gain in specific target areas. The computational complexity of the proposed approach is quadratic to the number of array elements and snapshots, which shows potential for practical applications. Finally, the performance of the proposed algorithm has been verified via simulation experiments. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel imaging and Doppler parameter estimation algorithm for ground maneuvering targets. Since the cross-track acceleration will induce the quadratic chirp rate (third-order phase) in the phase history, it may cause the maneuvering target severely smeared in the Doppler domain. To obtain a well-focused target imaging result, the quadratic chirp rate must be estimated accurately. Though cubic phase function (CPF) is efficient in estimating the parameters of a single maneuvering target, it may suffer from the identifiability problem when dealing with multiple maneuvering targets. To address these issues, an axis mapping (AM) based coherently integrated cubic phase function (CICPF) algorithm is proposed. This algorithm consists of two stages. Firstly, the linear chirp rate migration (i.e. quadratic chirp rate) of target in the time and chirp-rate domain is corrected by AM. After that, a dechirping technique is utilized to coherently integrate the auto-terms, and suppress the cross-terms and spurious peaks. Compared with several existing quadratic chirp rate estimation approaches, AM based CICPF (AMCICPF) algorithm can acquire lower signal-to-noise ratio threshold and estimate the centroid frequency, chirp rate and quadratic chirp rate of maneuvering target simultaneously. By compensating the chirp rate and quadratic chirp rate, a finely focused maneuvering target imaging can be obtained. Both simulated and real data processing results show that the AMCICPF algorithm serves as a good candidate for maneuvering target Doppler parameter estimation and imaging. [ABSTRACT FROM AUTHOR]

Location awareness is now becoming a vital requirement for many practical applications. In this paper, we consider passive localization of multiple targets with one transmitter and several receivers based on time of arrival (TOA) measurements. Existing studies assume that positions of receivers are perfectly known. However, in practice, receivers' positions might be inaccurate, which leads to localization error of targets. We propose factor graph (FG)-based belief propagation (BP) algorithms to locate the passive targets and improve the position accuracy of receivers simultaneously. Due to the nonlinearity of the likelihood function, messages on the FG cannot be derived in closed form. We propose both sample-based and parametric methods to solve this problem. In the sample-based BP algorithm, particle swarm optimization is employed to reduce the number of particles required to represent messages. In parametric BP algorithm, the nonlinear terms in messages are linearized, which results in closed-form Gaussian message passing on FG. The Bayesian Cramér–Rao bound (BCRB) for passive targets localization with inaccurate receivers is derived to evaluate the performance of the proposed algorithms. Simulation results show that both the sample-based and parametric BP algorithms outperform the conventional method and attain the proposed BCRB. Receivers' positions can also be improved via the proposed BP algorithms. Although the parametric BP algorithm performs slightly worse than the sample-based BP method, it could be more attractive in practical applications due to the significantly lower computational complexity. [ABSTRACT FROM AUTHOR]

Abstract: This paper focuses on the identification problem of nonlinear discrete-time systems using Volterra filter series model. Generally, to update the kernels of Volterra model, the most commonly used method is the gradient adaptive algorithm. However, this method probably traps at the local minimum for searching parameter solutions. In this study, a new intelligence swarm computation of the global search is considered. We utilize an improved particle swarm optimization (IPSO) algorithm to design the Volterra kernel parameters. It is somewhat different from the original algorithm due to modifying its velocity updating formula and this can promote the algorithmʼs searching ability for solving the optimization problem. Using the IPSO algorithm to minimize the mean square error (MSE) between the actual output and model output, the identification problem for nonlinear discrete-time systems can be fulfilled. Finally, two different kinds of examples are provided to demonstrate the efficiency of the proposed method. Moreover, some examinations including the Volterra model memory size and algorithm initial condition are further considered. [Copyright &y& Elsevier]

This paper considers the waveform design for colocated MIMO radar to improve target detectability embedded in signal-dependent interferences, and maximize the SINR (signal-to-interference-plus-noise ratio). Due to constant modulus constraint, the problem is indeed non-convex and NP-hard. To address the challenge of this intractable problem, we propose a novel optimization framework for solving the problem based on convex relaxation. In the proposed algorithm, the original optimization problem is reformulated heuristically by introducing an auxiliary variable. Then it can be relaxed to a convex optimization problem and efficiently solved by alternative optimizing. Numerical results show that the proposed algorithm improves the beampattern performance significantly by generating much deeper notches at the interference directions, then obtains higher SINR over the state-of-the-art method. [ABSTRACT FROM AUTHOR]