A recursive algorithm for robust wideband adaptive beamforming
Bindu K. Mathai, Sarath Gopi, R. Pradeepa
Abstract
Bindu K. Mathai, Sarath Gopi, R. Pradeepa
Abstract
A novel computationally efficient wideband adaptive beamformer, robust against look direction errors, is proposed in this paper. The problem is formulated as Linearly Constrained Minimum Variance Beamformer (LCMV), with the addition of frequency invariance and derivative constraints. The frequency invariance constraint leads to consistent beamforming performance for a wideband of signals whereas derivative constraints ensure the robustness against steering vector mismatch. The gradient descent formulation is used to provide a recursive solution to this convex optimization problem. This results in a robust broadband adaptive beamforming algorithm with low computational complexity compared to the existing robust wide-band adaptive beamforming algorithms. Computer simulations demonstrate comparable performance of proposed algorithm as against traditional LCMV adaptive beamforming algorithm across a wide band of operation, with improved robustness to steering vector mismatches.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A novel computationally efficient wideband adaptive beamformer, robust against look direction errors, is proposed in this paper. The problem is formulated as Linearly Constrained Minimum Variance Beamformer (LCMV), with the addition of frequency invariance and derivative constraints. The frequency invariance constraint leads to consistent beamforming performance for a wideband of signals whereas derivative constraints ensure the robustness against steering vector mismatch. The gradient descent formulation is used to provide a recursive solution to this convex optimization problem. This results in a robust broadband adaptive beamforming algorithm with low computational complexity compared to the existing robust wide-band adaptive beamforming algorithms. Computer simulations demonstrate comparable performance of proposed algorithm as against traditional LCMV adaptive beamforming algorithm across a wide band of operation, with improved robustness to steering vector mismatches.
Key concepts: Adaptive beamformer, Robustness (evolution), Beamforming, Wideband, Computer science, Algorithm, Computational complexity theory, Mathematical optimization