A complex gradient projection optimal bounding ellipsoid algorithm for adaptive beamforming

Thrassos Thrasyvoulou, Andreas Spanias, Konstantinos Tsakalis, Ashwin Natarajan, Leon Iasemdes

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

This short paper examines the application of the complex gradient-projection-optimal bounding ellipsoid algorithm (C-GrPrOBE) to adaptive beamforrning. The analysis and simulation results presented show that the C-GrPrOBE compares well the NLMS and the recursive least squares (RLS) algorithms. Specifically, it is shown that the CGrPrOBE algorithm exhibits an ability to maintain good nulls at the direction of the signals of no interest (SNOIs) and to correctly focus the radiation pattern towards the signal of interest (SOI) even under low signal excitation.

Original languageEnglish (US)
Title of host publicationProceedings of the IASTED International Conference on Modelling, Identification and Control
EditorsM.H. Hamza
Pages546
Number of pages1
Volume23
StatePublished - 2004
EventProceedings of the 23rd IASTED International Conference on Modelling, Identification, and Control - Grindelwald, Switzerland
Duration: Feb 23 2004Feb 25 2004

Other

OtherProceedings of the 23rd IASTED International Conference on Modelling, Identification, and Control
CountrySwitzerland
CityGrindelwald
Period2/23/042/25/04

Keywords

  • Adaptive beamforrning

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'A complex gradient projection optimal bounding ellipsoid algorithm for adaptive beamforming'. Together they form a unique fingerprint.

  • Cite this

    Thrasyvoulou, T., Spanias, A., Tsakalis, K., Natarajan, A., & Iasemdes, L. (2004). A complex gradient projection optimal bounding ellipsoid algorithm for adaptive beamforming. In M. H. Hamza (Ed.), Proceedings of the IASTED International Conference on Modelling, Identification and Control (Vol. 23, pp. 546). [412-193]