Abstract

For impulsive noise environment, the adaptive beamformers based on second-order statistics often degrade severely. In this paper, a robust minimum geometric power distortionless response beamforming with sparse constraint is presented for arbitrary algebraically tailed impulsive signal of unknown statistics. The impulsive signal does not have finite second-order and higher order moments due to its property of heavy tails. Unlike the majority of the existing beamformers based on the second-order statistics, the proposed beamforming method minimizes a constrained mixed geometric power and $l_{1}$ -norm optimization problem. The geometric power effectively characterizes the process strength of the algebraically tailed distribution, while the $l_{1}$ -norm regularized term enforces the sparsity of the beam pattern. Therefore, the proposed algorithm can provide the potential for improved beamforming capability in the presence of impulse signals. Moreover, two adaptive algorithms, namely, the stochastic gradient (LMS)-based and the recursive least-squares (RLS)-based algorithms, are derived to solve the formulated optimization problem. Additionally, computational complexity analysis is conducted and shows that a comparable complexity between the proposed algorithms and the existing tailed impulsive beamformers. Simulation cases without and with mutual coupling are considered to illustrate that the proposed algorithms are more robust than other popular adaptive beamformers for impulsive signals.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.