scholarly journals A Priori-Based Subarray Selection Algorithm for DOA Estimation

Sensors ◽  
2020 ◽  
Vol 20 (16) ◽  
pp. 4626
Author(s):  
Linghao Zeng ◽  
Guanghua Zhang ◽  
Chongzhao Han

A finer direction-of-arrival (DOA) estimation result needs a large and dense array; it may, however, encounter the mutual coupling effect, which degrades the performance of DOA estimation. There is a new approach to mitigating this effect by using a nonuniform array to achieve DOA estimation. In this paper, we consider a priori DOA estimation, which is easily obtained from tracking results. The a priori DOA requires us to pay close attention to the high possibility of where the DOA will appear; then, a weight according to the prior probability distribution of DOA is added to each direction, which leads the sensing matrix of DOA estimation to be near low-rank. Thus, according to the low-rank matrix approximation theory, an optimal low-rank approximate matrix is obtained and an algorithm is proposed to select the elements of the original array according to right singular vectors of the approximate matrix. After that, the impacts of different weights are analyzed, and a mixed weight is presented which has flexibility for common use. Finally, a number of numerical simulations are carried out, and the results verify the effectiveness of the proposed methods.

2013 ◽  
Vol 756-759 ◽  
pp. 3977-3981 ◽  
Author(s):  
Hua Xing Yu ◽  
Xiao Fei Zhang ◽  
Jian Feng Li ◽  
De Ben

In this paper, we address the angle estimation problem in linear array with some ill sensors (partially-well sensors), which only work well randomly. The output of the array will miss some values, and this can be regarded as a low-rank matrix completion problem due to the property that the number of sources is smaller than the number of the total sensors. The output of the array, which is corrupted by the missing values and the noise, can be complete via the Optspace method, and then the angles can be estimated according to the complete output. The proposed algorithm works well for the array with some ill sensors; moreover, it is suitable for non-uniform linear array. Simulation results illustrate performance of the algorithm.


Author(s):  
Junming Shao ◽  
Zhong Zhang ◽  
Zhongjing Yu ◽  
Jun Wang ◽  
Yi Zhao ◽  
...  

Community detection and link prediction are highly dependent since knowing cluster structure as a priori will help identify missing links, and in return, clustering on networks with supplemented missing links will improve community detection performance. In this paper, we propose a Cluster-driven Low-rank Matrix Completion (CLMC), for performing community detection and link prediction simultaneously in a unified framework. To this end, CLMC decomposes the adjacent matrix of a target network as three additive matrices: clustering matrix, noise matrix and supplement matrix. The community-structure and low-rank constraints are imposed on the clustering matrix, such that the noisy edges between communities are removed and the resulting matrix is an ideal block-diagonal matrix. Missing edges are further learned via low-rank matrix completion. Extensive experiments show that CLMC achieves state-of-the-art performance.


Author(s):  
Daniel Povey ◽  
Gaofeng Cheng ◽  
Yiming Wang ◽  
Ke Li ◽  
Hainan Xu ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document