• DocumentCode
    2750150
  • Title

    Adaptive beamforming using affine projection algorithms

  • Author

    Zheng, Yahong R. ; Goubran, Rafik A.

  • Author_Institution
    Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada
  • Volume
    3
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    1929
  • 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
  • Keywords
    array signal processing; computational complexity; convergence of numerical methods; decorrelation; least mean squares methods; NLMS algorithm; adaptive LCMV beamformer; adaptive beamforming; convergence speed; decorrelation; fast affine projection algorithm; linear constrained minimum variance; low convergence rate; normalized LMS algorithm; spatial smoothing algorithm; Array signal processing; Convergence; Decorrelation; Financial advantage program; Interference; Least squares approximation; Phased arrays; Projection algorithms; Resonance light scattering; Systems engineering and theory;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing Proceedings, 2000. WCCC-ICSP 2000. 5th International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    0-7803-5747-7
  • Type

    conf

  • DOI
    10.1109/ICOSP.2000.893482
  • Filename
    893482