2013•Unpublished venueRequires access

A recursive algorithm for robust wideband adaptive beamforming

Bindu K. Mathai, Sarath Gopi, R. Pradeepa

Open publisher page 2 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Adaptive beamformer, Robustness (evolution), Beamforming, Wideband, Computer science, Algorithm, Computational complexity theory, Mathematical optimization

Related papers

Back to paper searchBrowse research topicsOriginal source
A recursive algorithm for robust wideband adaptive beamforming — Research Paper | ScholarLens