Abstract
An algorithm is presented which computes optimal weights for arbitrary linear arrays. The application of this algorithm to in situ optimal reshading of arrays with failed elements is discussed. It is shown that optimal reshading can often regain the original sidelobe level by slightly increasing the mainlobe beamwidth. Three examples are presented to illustrate the algorithm's effectiveness. Hardware and software issues are discussed. Execution time for a 25-element array is typically between 1 and 2 min on an HP9836C microcomputer.
Full Text
Submitted Version (
Free)
Published Version
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 call