Deep Learning-Enabled One-Bit DoA Estimation (2405.09712v1)
Abstract: Unrolled deep neural networks have attracted significant attention for their success in various practical applications. In this paper, we explore an application of deep unrolling in the direction of arrival (DoA) estimation problem when coarse quantization is applied to the measurements. We present a compressed sensing formulation for DoA estimation from one-bit data in which estimating target DoAs requires recovering a sparse signal from a limited number of severely quantized linear measurements. In particular, we exploit covariance recovery from one-bit dither samples. To recover the covariance of transmitted signal, the learned iterative shrinkage and thresholding algorithm (LISTA) is employed fed by one-bit data. We demonstrate that the upper bound of estimation performance is governed by the recovery error of the transmitted signal covariance matrix. Through numerical experiments, we demonstrate the proposed LISTA-based algorithm's capability in estimating target locations. The code employed in this study is available online.
- A. Barthelme and W. Utschick, “DoA estimation using neural network-based covariance matrix reconstruction,” IEEE Signal Processing Letters, vol. 28, pp. 783–787, 2021.
- D. K. W. Ho and B. D. Rao, “Antithetic dithered 1-bit massive MIMO architecture: Efficient channel estimation via parameter expansion and PML,” IEEE Transactions on Signal Processing, vol. 67, no. 9, pp. 2291–2303, 2019.
- T. Kugelstadt, “Active filter design techniques,” in Op Amps for Everyone Literature Number SLOD006A, R. Mancini, Ed. Texas Instruments, 2002.
- A. Mezghani and A. Swindlehurst, “Blind estimation of sparse broadband massive MIMO channels with ideal and one-bit ADCs,” IEEE Transactions on Signal Processing, vol. 66, no. 11, pp. 2972–2983, 2018.
- A. Eamaz, F. Yeganegi, and M. Soltanalian, “Modified arcsine law for one-bit sampled stationary signals with time-varying thresholds,” in IEEE International Conference on Acoustics, Speech and Signal Processing, 2021, pp. 5459–5463.
- T. Yang, J. Maly, S. Dirksen, and G. Caire, “Plug-in channel estimation with dithered quantized signals in spatially non-stationary massive MIMO systems,” IEEE Transactions on Communications, vol. 72, no. 1, pp. 387–402, 2024.
- C.-L. Liu and P. Vaidyanathan, “One-bit sparse array DoA estimation,” in IEEE International Conference on Acoustics, Speech and Signal Processing, 2017, pp. 3126–3130.
- S. Sedighi, M. Soltanalian, and B. Ottersten, “On the performance of one-bit DoA estimation via sparse linear arrays,” IEEE Transactions on Signal Processing, vol. 69, pp. 6165–6182, 2021.
- X. Huang and B. Liao, “One-bit music,” IEEE Signal Processing Letters, vol. 26, no. 7, pp. 961–965, 2019.
- K. Yu, Y. D. Zhang, M. Bao, Y.-H. Hu, and Z. Wang, “DoA estimation from one-bit compressed array data via joint sparse representation,” IEEE Signal Processing Letters, vol. 23, no. 9, pp. 1279–1283, 2016.
- C. Zhou, Y. Gu, Z. Shi, and M. Haardt, “Direction-of-arrival estimation for coprime arrays via coarray correlation reconstruction: A one-bit perspective,” in IEEE Sensor Array and Multichannel Signal Processing Workshop. IEEE, 2020, pp. 1–4.
- A. Eamaz, F. Yeganegi, and M. Soltanalian , “Covariance recovery for one-bit sampled non-stationary signals with time-varying sampling thresholds,” IEEE Transactions on Signal Processing, 2022.
- A. Eamaz, F. Yeganegi, and M. Soltanalian, “Covariance recovery for one-bit sampled stationary signals with time-varying sampling thresholds,” Signal Processing, vol. 206, p. 108899, 2023.
- S. Dirksen, J. Maly, and H. Rauhut, “Covariance estimation under one-bit quantization,” The Annals of Statistics, vol. 50, no. 6, pp. 3538–3562, 2022.
- S. Dirksen and J. Maly, “Tuning-free one-bit covariance estimation using data-driven dithering,” IEEE Transactions on Information Theory, 2024.
- Y. Xiao, L. Huang, D. Ramírez, C. Qian, and H. So, “Covariance matrix recovery from one-bit data with non-zero quantization thresholds: Algorithm and performance analysis,” IEEE Transactions on Signal Processing, vol. 71, pp. 4060–4076, 2023.
- K. Gregor and Y. LeCun, “Learning fast approximations of sparse coding,” in Proceedings of the 27th international conference on international conference on machine learning, 2010, pp. 399–406.
- X. Chen, Z. Liu, J.and Wang, and W. Yin, “Theoretical linear convergence of unfolded ISTA and its practical weights and thresholds,” Advances in Neural Information Processing Systems, vol. 31, 2018.
- V. Monga, Y. Li, and Y. Eldar, “Algorithm unrolling: Interpretable, efficient deep learning for signal and image processing,” IEEE Signal Processing Magazine, vol. 38, no. 2, pp. 18–44, 2021.
- Z. Esmaeilbeig and M. Soltanalian, “Deep learning meets adaptive filtering: A Stein’s unbiased risk estimator approach,” in Annual Allerton Conference on Communication, Control, and Computing. IEEE, 2023, pp. 1–6.
- Y. Hu and S. Sun, “IHT-inspired neural network for single-snapshot DOA estimation with sparse linear arrays,” in IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 2024, pp. 13 081–13 085.
- R. Zheng, S. Sun, H. Liu, H. Chen, M. Soltanalian, and J. Li, “Antenna failure resilience: Deep learning-enabled robust DoA estimation with single snapshot sparse arrays,” arXiv preprint arXiv:2405.02788, 2024.
- P. Xiao, B. Liao, and N. Deligiannis, “Deepfpc: A deep unfolded network for sparse signal recovery from 1-bit measurements with application to DoA estimation,” Signal Processing, vol. 176, p. 107699, 2020.
- S. Khobahi and M. Soltanalian, “Model-based deep learning for one-bit compressive sensing,” IEEE Transactions on Signal Processing, vol. 68, pp. 5292–5307, 2020.
- X. Su, Z. Liu, J. Shi, P. Hu, T. Liu, and X. Li, “Real-valued deep unfolded networks for off-grid DoA estimation via nested array,” IEEE Transactions on Aerospace and Electronic Systems, 2023.
- L. Wu, Z. Liu, and J. Liao, “DoA estimation using an unfolded deep network in the presence of array imperfections,” in International Conference on Signal and Image Processing, 2022, pp. 182–187.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.