Efficient Computation of Array Patterns
Abstract
The impact of a symmetrical array geometry, the use of quantized stored cosine function, the exploitation of digital Fourier transform algorithms, and the application of trigonometric interpolation in the computation of array patterns is discussed. Careful selection of parameters permits sampling the array pattern only 6% above the theoretical Nyquist limit. Reconstruction of array patterns showing -20, -30, and -40 -dB relative interpolation errors are presented. A saving of 8000:1 in computation time over direct 'brute-force' array-pattern computation is illustrated for a hypothetical array.
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 30, 1976
- Accession Number
- ADA041548
Entities
People
- Victor C. Anderson
Organizations
- Scripps Institution of Oceanography