Adaptive beamforming using affine projection algorithms

Abstract

The dynamic adaptive linear constrained minimum variance (LCMV) beamformer generally uses the normalized LMS (NLMS) algorithm for its robustness and simplicity, but it suffers from a low convergence rate. This paper proposes an alternative beamformer incorporating a simplified fast affine projection (FAP) algorithm, which provides fast convergence speed and low computational complexity. The family of affine projection (AP) algorithms improves its convergence speed significantly due to its decorrelation property. We compare the decorrelation properly of the AP algorithms to that of the spatial smoothing algorithm. The fundamental difference between the two decorrelation properties is clarified

Department(s)

Electrical and Computer Engineering

Keywords and Phrases

NLMS Algorithm; Adaptive LCMV Beamformer; Adaptive Beamforming; Array Signal Processing; Computational Complexity; Convergence of Numerical Methods; Convergence Speed; Decorrelation; Fast Affine Projection Algorithm; Least Mean Squares Methods; Linear Constrained Minimum Variance; Low Convergence Rate; Normalized LMS Algorithm; Spatial Smoothing Algorithm

Document Type

Article - Conference proceedings

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2000 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.

Publication Date

01 Jan 2000

Share

 
COinS