Abstract
A technique of synthesizing an antenna array pattern with prescribed broad nulls is presented. The array pattern synthesis problem is formulated as a least-square null constrained optimization problem. Numerical techniques based on the matrix factorization method are developed for reducing the computational complexity of determining the optimal weight vector. Subsequently, a set of eigenvector constraints are used to approximate the effect of the quadratic constraint. Numerical results are presented to illustrate the performance achievable. >
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.
