Abstract
Compressive beamforming has been successfully applied to direction-of-arrival estimation with sensor arrays. The results demonstrated that this technique achieves superior performance when compared with traditional high-resolution beamforming methods. The existing compressive beamforming methods use classical iterative optimization algorithms in their compressive sensing theories. However, the computational complexity of the existing compressive beamforming methods tend to be excessively high, which has limited the use of compressive beamforming in applications with limited computing resources. To address this issue, this paper proposes a fast compressive beamforming method which combines the shift-invariance of the array beam patterns with a fast iterative shrinkage-thresholding algorithm. The evaluation shows that the proposed fast compressive beamforming method successfully reduces the number of floating-point operations by 3 orders of magnitude when compared with the existing methods. In addition, both the simulations and experiments demonstrate that the resolution limit for discerning closely spaced sources of the introduced fast method is comparable to those of the existing compressive beamforming methods, which use classical iterative optimization algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.