Abstract
Synthesis of sum and difference patterns of a planar array is introduced in this article by means of a clustering algorithm. The whole array aperture is divided into several sub-arrays, which will reduce the cost and complexity of manufacturing the array antenna. The sub-array configurations and the corresponding sub-array weights are defined to minimize the maximum level of the side-lobes of the corresponding sum and difference patterns. Two kinds of arrays are considered here: in the first, the whole aperture is divided into several sub-arrays to get sum and difference patterns; in the other, the compromise difference pattern is obtained. Some numerical experiments are given to assess the feasibility and effectiveness of the proposed method.
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.
