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 language | English (US) |
---|---|
Title of host publication | Proceedings of the IASTED International Conference on Modelling, Identification and Control |
Editors | M.H. Hamza |
Pages | 546 |
Number of pages | 1 |
Volume | 23 |
State | Published - 2004 |
Event | Proceedings of the 23rd IASTED International Conference on Modelling, Identification, and Control - Grindelwald, Switzerland Duration: Feb 23 2004 → Feb 25 2004 |
Other
Other | Proceedings of the 23rd IASTED International Conference on Modelling, Identification, and Control |
---|---|
Country/Territory | Switzerland |
City | Grindelwald |
Period | 2/23/04 → 2/25/04 |
Keywords
- Adaptive beamforrning
ASJC Scopus subject areas
- Engineering(all)