.png){kind=icon}
.png){kind=icon}
Return
Probability-Based Complex-Valued Fast Iterative Shrinkage-Thresholding Algorithm for Deconvolution Beamforming
.png){kind=icon}
PRE
AI
DOI：10.1109/JOE.2023.3339800.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Conventional beamforming is widely used in sonars and radars owing to its robustness and low complexity; however, it suffers from low beam resolution and high-intensity sidelobes. Various imaging deblurring methods have been used in deconvolution beamforming to improve the beam resolution. A considerable limitation of these intensity-based methods is that the real-valued model mismatches the signals in practice and ignores the coherent information of the received signals. This study proposes a probability-based complex-valued fast iterative shrinkage-thresholding algorithm (CFISTA) to extend deconvolution beamforming to the complex domain. In this novel algorithm, the complex gradient descent and complex probability mapping are combined. Fast Fourier transform acceleration and clustering prior constraints are used on the targets to improve the efficiency and accuracy of the model. Simulation results of planar arrays show that the proposed method has superior beam resolution, sidelobe suppression, running time, and noise immunity compared with those of intensity-based methods.
Keywords:
Array signal processing
beam resolution
complex-valued fast iterative shrinkage-thresholding algorithm (CFISTA)
deconvolution beamforming
sidelobe suppression
Journal
IF:
5.3
Papers:
2.6K
Citations:
7.4K