Journal Article10.1109/taes.2023.3263153
Coarray Tensor Completion for DOA Estimation
32
TL;DR: In this paper , a coarray tensor completion algorithm for two-dimensional direction-of-arrival (DOA) estimation is proposed, where the coarray statistics can be entirely exploited.
read more
Abstract: Sparse array direction-of-arrival (DOA) estimation using tensor model has been developed to handle multi-dimensional sub-Nyquist sampled signals. Furthermore, augmented virtual arrays can be derived for Nyquist-matched coarray tensor processing. However, the partially augmentable sparse array corresponds to a discontinuous virtual array, whereas the existing methods can only utilize its continuous part. Conventional virtual linear array interpolation techniques complete coarray covariance matrices with dispersed missing elements, but fail to complete the coarray tensor with whole missing slices. In this paper, we propose a coarray tensor completion algorithm for two-dimensional DOA estimation, where the coarray tensor statistics can be entirely exploited. In particular, in order to impose an effective low-rank regularization on the slice-missing coarray tensor, we propose shift dimensional augmenting and coarray tensor reshaping approaches to reformulate a structured coarray tensor with sufficiently dispersed missing elements. Furthermore, the shape of the reformulated coarray tensor is optimized by maximizing the dispersion-to-percentage ratio of missing elements. As such, a coarray tensor nuclear norm minimization problem can be designed to optimize the completed coarray tensor corresponding to a filled virtual array, based on which the closed-form DOA estimation is achieved. Meanwhile, the global convergence of the coarray tensor completion is theoretically proved. Simulation results demonstrate the effectiveness of the proposed algorithm compared to other matrix-based and tensor-based methods.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Adaptive Beamforming for Cascaded Sparse Diversely Polarized Planar Array
Yaxing Yue,Chengwei Zhou,Fangyuan Xing,Kim-Kwang Raymond Choo,Zhiguo Shi +4 more
TL;DR: In this article , an adaptive beamformer based on a cascaded sparse sparse diversely polarized planar array is proposed, which consists of multiple parallel sparse linear subarrays whose difference co-array has no holes.
12
Tensor-Based 2D DOA Estimation for L-Shaped Nested Array
Feng Xu,Hang Zheng,Sergiy A. Vorobyov +2 more
TL;DR: A two-step iterative algorithm is proposed to sequentially estimate and remove the cross term based on the initial estimates obtained from the high-order tensor decomposition, and the 2-D DOA estimation with enhanced estimation accuracy, resolution, and moderate computational complexity is achieved for the L-shaped nested array.
8
Decomposed CNN for Sub-Nyquist Tensor-Based 2-D DOA Estimation
01 Jan 2023
TL;DR: In this article , a convolution kernel decomposition approach is proposed to compress convolution kernels for efficient coarray tensor propagation, which enables the acquisition of canonical polyadic (CP) factors containing compressed parameters.
8
Decomposed CNN for Sub-Nyquist Tensor-Based 2-D DOA Estimation
TL;DR: In this paper , a convolution kernel decomposition approach is proposed to compress convolution kernels for efficient coarray tensor propagation, which enables the acquisition of canonical polyadic (CP) factors containing compressed parameters.
6
Consistent and Asymptotically Efficient Localization From Range- Difference Measurements
Guangyang Zeng,Biqiang Mu,Ling Shi,Jiming Chen,Jian Wu +4 more
TL;DR: The proposed algorithm achieves consistent and asymptotically efficient localization from range-difference measurements by obtaining a preliminary consistent estimate and then performing a one-step Gauss-Newton iteration.
2
References
•Book
Optimum Array Processing
Harry L. Van Trees
- 01 Jan 2002
TL;DR: The present work focuses on the characterization of Space-Time Processes of Array Processing Literature and its applications to Arrays and Spatial Filters and Parameter Estimation of Adaptive Beamformers.
4.5K
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
TL;DR: It is shown that if a certain restricted isometry property holds for the linear transformation defining the constraints, the minimum-rank solution can be recovered by solving a convex optimization problem, namely, the minimization of the nuclear norm over the given affine space.
4.4K
Tensor completion for estimating missing values in visual data
Ji Liu,Przemyslaw Musialski,Peter Wonka,Jieping Ye +3 more
- 01 Sep 2009
TL;DR: The contribution of this paper is to extend the matrix case to the tensor case by proposing the first definition of the trace norm for tensors and building a working algorithm to estimate missing values in tensors of visual data.
Nested Arrays: A Novel Approach to Array Processing With Enhanced Degrees of Freedom
Piya Pal,P.P. Vaidyanathan +1 more
TL;DR: A new array geometry, which is capable of significantly increasing the degrees of freedom of linear arrays, is proposed and a novel spatial smoothing based approach to DOA estimation is also proposed, which does not require the inherent assumptions of the traditional techniques based on fourth-order cumulants or quasi stationary signals.
Sparse Sensing With Co-Prime Samplers and Arrays
P.P. Vaidyanathan,Piya Pal +1 more
TL;DR: This paper considers the sampling of temporal or spatial wide sense stationary (WSS) signals using a co-prime pair of sparse samplers and shows that the co-array based method for estimating sinusoids in noise offers many advantages over methods based on the use of Chinese remainder theorem and its extensions.
1.6K