矩阵的特征分解
子空间拓扑
干扰(通信)
算法
计算机科学
预处理器
基质(化学分析)
连贯性(哲学赌博策略)
稀疏矩阵
特征向量
计算复杂性理论
基本追求
基础(线性代数)
数学
降级(电信)
数学优化
功率(物理)
凸优化
模式识别(心理学)
幂迭代
正多边形
稳健性(进化)
人工智能
控制理论(社会学)
降维
矩阵分解
协方差矩阵
作者
Can Tang,Duo Zhai,B. Zhang,F. R. Zhu,Fenghua Li
摘要
Super-resolution methods based on sparse recovery often suffer significant performance degradation under strong near-field interference. Existing approaches typically involve either incorporating near-field steering vectors into the dictionary or applying pre-filtering techniques. However, the former approach introduces a severe basis coherence problem, which may lead to reconstruction failure. The latter may distort the target signal, especially when the interference subspace is high-dimensional. This paper proposes a preprocessing method based on generalized eigenvalue decomposition. Inspired by the concept of matrix filtering, the method aims to maximize the output power ratio between the subspace spanned by the desired steering vectors and the interference subspace. Formally, the proposed method can be viewed as a generalized extension of the optimal beamformer to a matrix filtering framework. Unlike zero-forcing methods, it offers a balanced trade-off between interference suppression and target preservation. Moreover, the computational efficiency is significantly lower than that of conventional matrix filtering approaches that rely on convex optimization. When combined with subsequent sparse recovery algorithms, the proposed method enables super-resolution direction-of-arrival estimation even under conditions of limited snapshots and low signal-to-noise ratios. Simulation and experimental results demonstrate the effectiveness of the proposed method in handling real-world strong near-field interference while maintaining better real-time performance.
科研通智能强力驱动
Strongly Powered by AbleSci AI