arXiv:2209.04577
Synthesis of Sparse Linear Arrays via Low-Rank Hankel Matrix Completion
원문 초록
In the process of realizing the synthesis of the antenna array synthesis, it is of practical significance to arrange the nonuniform array and reduce the number of elements. According to the Matrix Pencil Method (MPM), we proposed an improved nonuniform array algorithm for reducing the number of array elements. We design the Hankel matrix by low-rank completion via log-det heuristic, and impose relatively loose constraints on the pattern, which may increase the degree of freedom of the radar array, so as to achieve the purpose of antenna array synthesis and non-uniform array.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation
N$^2$: A Unified Python Package and Test Bench for Nearest Neighbor-Based Matrix Completion
An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU function
Interference-Aware Edge Runtime Prediction with Conformal Matrix Completion
Robust Matrix Completion for Discrete Rating-Scale Data
Efficient and Robust Freeway Traffic Speed Estimation under Oblique Grid using Vehicle Trajectory Data
토론
이 논문과 연결된 포럼 글이 아직 없습니다.