IHT-INSPIRED NEURAL NETWORK FOR SINGLE-SNAPSHOT DOA ESTIMATION WITH SPARSE LINEAR ARRAYS

被引:1
作者
Hu, Yunqiao [1 ]
Sun, Shunqiao [1 ]
机构
[1] Univ Alabama, Dept Elect & Comp Engn, Tuscaloosa, AL 35401 USA
来源
2024 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP 2024) | 2024年
基金
美国国家科学基金会;
关键词
Sparse linear array; matrix completion; iterative hard thresholding; deep neural networks; single snapshot; direction-of-arrival estimation; MATRIX; RADAR;
D O I
10.1109/ICASSP48485.2024.10446723
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
Single-snapshot direction-of-arrival (DOA) estimation using sparse linear arrays (SLAs) has gained significant attention in the field of automotive MIMO radars. This is due to the dynamic nature of automotive settings, where multiple snapshots aren't accessible, and the importance of minimizing hardware costs. Low-rank Hankel matrix completion has been proposed to interpolate the missing elements in SLAs. However, the solvers of matrix completion, such as iterative hard thresholding (IHT), heavily rely on expert knowledge of hyperparameter tuning and lack task-specificity. Besides, IHT involves truncated-singular value decomposition (t-SVD), which has a high computational cost in each iteration. In this paper, we propose an IHT-inspired neural network for single-snapshot DOA estimation with SLAs, termed IHT-Net. We utilize a recurrent neural network structure to parameterize the IHT algorithm. Additionally, we integrate shallow-layer autoencoders to replace t-SVD, reducing computational overhead while generating a novel optimizer through supervised learning. IHT-Net maintains strong interpretability as its network layer operations align with the iterations of the IHT algorithm. The learned optimizer exhibits fast convergence and higher accuracy in the full array signal reconstruction followed by single-snapshot DOA estimation. Numerical results validate the effectiveness of the proposed method.
引用
收藏
页码:13081 / 13085
页数:5
相关论文
共 24 条
[1]   Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion [J].
Cai, Jian-Feng ;
Wang, Tianming ;
Wei, Ke .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2019, 46 (01) :94-121
[2]   A SINGULAR VALUE THRESHOLDING ALGORITHM FOR MATRIX COMPLETION [J].
Cai, Jian-Feng ;
Candes, Emmanuel J. ;
Shen, Zuowei .
SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (04) :1956-1982
[3]  
Candes E, 2007, ANN STAT, V35, P2313, DOI 10.1214/009053606000001523
[4]  
Correas-Serrano A., 2018, 2018 16th International Conference on Intelligent Transportation Systems Telecommunications, P1, DOI DOI 10.1109/ITST.2018.8566961
[5]   Deep learning based matrix completion [J].
Fan, Jicong ;
Chow, Tommy .
NEUROCOMPUTING, 2017, 266 :540-549
[6]   Masked Autoencoders Are Scalable Vision Learners [J].
He, Kaiming ;
Chen, Xinlei ;
Xie, Saining ;
Li, Yanghao ;
Dollar, Piotr ;
Girshick, Ross .
2022 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2022), 2022, :15979-15988
[7]   Fast algorithms for Toeplitz and Hankel matrices [J].
Heinig, Georg ;
Rost, Karla .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2011, 435 (01) :1-59
[8]  
Jing L., 2020, Adv. Neural Inf. Process. Syst, V33, P14736
[9]  
King DB, 2015, ACS SYM SER, V1214, P1, DOI 10.1021/bk-2015-1214.ch001
[10]   MUSIC for single-snapshot spectral estimation: Stability and super-resolution [J].
Liao, Wenjing ;
Fannjiang, Albert .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2016, 40 (01) :33-67