NYNa Yang

Na Yang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Na Yang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Weighted STAP Algorithm Based on the Greedy Block Coordinate Descent Method

    by Zhiqi Gao, Na Yang, Zhixia Wu, Wei Xu, Weixian Tan

    Space–time adaptive processing (STAP) based on sparse recovery (SR-STAP) has demonstrated remarkable clutter suppression performance under insufficient sample conditions. However, the main aim of sparse recovery is to solve the norm minimization problem. To this end, this study proposes a weighted STAP algorithm based on a greedy block coordinate descent method to address the problems of slow convergence speed and insufficient estimation accuracy in the existing l2,1-norm minimization methods. First, the weights are estimated using the multiple signal classification (MUSIC) algorithm. Then, a greedy block selection rule that favors sparsity is used, prioritizing the update of the weighted block that has the greatest impact on sparsity. Although the proposed algorithm in this paper is greedy in nature, it is globally convergent. Finally, the accuracy of clutter covariance matrix estimation and the convergence speed of the SR-STAP algorithm are enhanced by reasonably estimating the noise power and selecting appropriate regularization parameters. The results of simulation experiments indicate that the proposed algorithm can effectively suppress clutter ridge expansion, achieving excellent clutter suppression and target detection performance compared with the existing methods, as well as satisfactory convergence properties.


  • Open Access

    Self-Calibrating STAP Algorithm for Dictionary Dimensionality Reduction Based on Sparse Bayesian Learning

    by Zhiqi Gao, Na Yang, Pingping Huang, Wei Xu, Weixian Tan, Zhixia Wu

    Sparse recovery space–time adaptive processing (STAP) has an off-grid feature and high computational complexity. To address these shortcomings, this study proposes a self-calibrating STAP algorithm based on sparse Bayesian learning (SBL). The proposed algorithm constructs a dimensionality reduction dictionary by selecting the steering vectors corresponding to atoms with high power values. Then, a small-scale auxiliary dictionary is constructed with a stepwise search approach to calibrate the uniformly discretized dictionary. In this way, the atoms of the auxiliary dictionary can converge to the clutter ridge adaptively when off-grid occurs. The clutter plus noise covariance matrix is estimated via SBL combined with the updated dictionary. The experimental results demonstrate that the proposed algorithm can effectively suppress the clutter ridge expansion caused by the off-grid problem while reducing the computation burden significantly compared with the existing methods.