Abstract

In the paper, the method of alternating orthogonal projections is derived for the problem of array pattern synthesis with multiple null constraints. The required complex weight vector is obtained via an iterative algorithm starting from the known ‘look direction’. The projection operators required in the algorithm are shown to be easily computed from the ‘look direction’ vector and the null-constraint vectors. A lower bound on the rate of convergence of the algorithm is also established.

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

Disclaimer: 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.