A fast beamforming algorithm for large arrays
Abstract
In this algorithm for array radars, the number of array elements is very large in comparison with the number of jammers (L) the radar is designed to suppress. Five useful properties of the algorithm are distinguished. The first is the simplicity of its design and of the programming. The second is that it requires only about L samples of the noise environment to construct the weighting coefficients. The third is its low computation requirements, and the fourth is its effectiveness in suppressing many types of jammers. The fifth is that it can be used in other applications, such as the location of a target inside the main beam and the artificial placement of nulls in the radar beam pattern.
- Publication:
-
Radar-82
- Pub Date:
- 1982
- Bibcode:
- 1982rpi..conf...92H
- Keywords:
-
- Algorithms;
- Antenna Arrays;
- Antenna Radiation Patterns;
- Radar Antennas;
- Computerized Simulation;
- Jamming;
- Radar Receivers;
- White Noise;
- Communications and Radar