基于改进子空间平均算法的信源数估计

    Source number estimation based on improved subspace averaging algorithm

    • 摘要: 为了解决在大型天线阵列环境下,信源数估计中遇到的小快拍数问题,本文提出了一种采用托普利茨(Toeplitz)优化处理的子空间平均算法。针对传统子空间平均算法仅采用前向平滑获取子协方差矩阵的局限性,提出通过Toeplitz优化对前后向平滑子协方差矩阵进行修正。首先引入前/后向平滑算法获取前/后向平滑子协方差矩阵,并对前/后向平滑子协方差矩阵进行Toeplitz优化后求和,并得到作为提取出多个子空间的子协方差矩阵。其次基于特征分解生成离散概率分布,设计无放回随机抽样机制构建子空间集合。实验表明,在小快拍、低信噪比条件下,改进算法较传统方法具有显著优势,且在大规模阵列场景下性能提升尤为明显,在较小规模阵列中仍保持稳健估计能力。

       

      Abstract: In order to solve the problem of limited snapshots in the estimation of source number in the case of large antenna array, a subspace averaging algorithm based on Toeplitz optimization is proposed in this paper. To address the inherent limitations of conventional subspace averaging algorithms that solely rely on forward smoothing for sub-covariance matrix acquisition, this paper proposes a Toeplitz-constrained structural refinement framework for forward-backward smoothed sub-covariance matrices. Firstly, the forward /backward smoothing algorithm is introduced to obtain the forward/backward smoothing sub-covariance matrix. The bidirectional smoothing sub-covariance matrix is summed after Toeplitz optimization, and is used as the sub-covariance matrix of multiple subspaces. Secondary, the discrete probability distribution is established through eigenvalue decomposition, where the subspace ensemble is constructed via a non-replacement stochastic sampling mechanism. Experimental results demonstrate that the enhanced algorithm achieves superior performance compared to conventional approaches under limited snapshots and low signal-to-noise ratio (SNR) conditions. Notably, the performance gain becomes particularly pronounced in large-scale array configurations, while maintaining robust estimation capabilities in moderate-scale array scenarios.
       

       

    /

    返回文章
    返回