CoFAR Clutter Estimation Using Covariance-Free Bayesian Learning

被引:0
作者
Rajput, Kunwar Pritiraj [1 ]
Shankar, M. R. Bhavani [1 ]
Mishra, Kumar Vijay [2 ]
Rangaswamy, Muralidhar [3 ]
Ottersten, Bjorn [1 ]
机构
[1] Univ Luxembourg, Interdisciplinary Ctr Secur Reliabil & Trust SnT, L-1855 Luxembourg, Luxembourg
[2] DEVCOM Army Res Lab, Adelphi, MD 20783 USA
[3] WPAFB, AF Res Lab, Sensors Directorate, Wright patterson Afb, OH 45433 USA
关键词
Estimation; Bayes methods; Radar; Covariance matrices; Clutter; Green's function methods; Vectors; Bayesian Cram & eacute; r-Rao bound (BCRB); clutter map; cognitive fully adaptive radar (CoFAR); RFView; sparse Bayesian learning (SBL); SIMULTANEOUS SPARSE APPROXIMATION; CHANNEL ESTIMATION; ADAPTIVE RADAR; MIMO RADAR; DESIGN;
D O I
10.1109/TAES.2024.3445319
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
A cognitive fully adaptive radar (CoFAR) adapts its behavior on its own within a short period of time in response to changes in the target environment. For the CoFAR to function properly, it is critical to understand its operating environment through estimation of the clutter channel impulse response (CCIR). In general, CCIR is sparse but prior works either ignore it or estimate the CCIR by imposing sparsity as an explicit constraint in their optimization problem. In this article, contrary to these studies, we develop covariance-free Bayesian learning (CoFBL) techniques for estimating sparse CCIR in a CoFAR system. In particular, we consider a multiple measurement vector scenario and estimate a simultaneously sparse (row sparse) CCIR matrix. Our CoFBL framework reduces the complexity of conventional sparse Bayesian learning through the use of the diagonal element estimation rule and conjugate gradient descent algorithm. We show that the framework is applicable to various forms of CCIR sparsity models: group, joint, and joint-cum-group. We evaluate our method through numerical experiments on a dataset generated using RFView, a high-fidelity modeling and simulation tool. We derive Bayesian Cram & eacute;r-Rao bounds for the various considered scenarios to benchmark the performance of our algorithms. Our results demonstrate that the proposed CoFBL-based approaches perform better than the existing popular approaches, such as multiple focal underdetermined system solver and simultaneous orthogonal matching pursuit.
引用
收藏
页码:296 / 313
页数:18
相关论文
共 65 条
[1]   A GAMP-Based Low Complexity Sparse Bayesian Learning Algorithm [J].
Al-Shoukairi, Maher ;
Schniter, Philip ;
Rao, Bhaskar D. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2018, 66 (02) :294-308
[2]  
[Anonymous], [61] [Online]. Available: http://www.iar.com/
[3]  
Babacan SD, 2011, INT CONF ACOUST SPEE, P2188
[4]   A Superimposed Pilot-Based Integrated Radar and Communication System [J].
Bao, Dan ;
Qin, Guodong ;
Dong, Yang-Yang .
IEEE ACCESS, 2020, 8 (08) :11520-11533
[5]   An estimator for the diagonal of a matrix [J].
Bekas, C. ;
Kokiopoulou, E. ;
Saad, Y. .
APPLIED NUMERICAL MATHEMATICS, 2007, 57 (11-12) :1214-1229
[6]  
Bell KL, 2014, IEEE RAD CONF, P309, DOI 10.1109/RADAR.2014.6875605
[7]  
Bell KL, 2014, IEEE RAD CONF, P303, DOI 10.1109/RADAR.2014.6875604
[8]  
Bergin JS, 2015, IEEE RAD CONF, P1666, DOI 10.1109/RADAR.2015.7131266
[9]  
Billingsley J., 2002, Low-angle Radar Land Clutter:Measurements and Empirical Models
[10]  
Bishop C. M., 2000, P P 16 C UNCERTAINTY, P46