Abstract
The impact of a symmetrical array geometry, the use of a 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
