Abstract
We address the problem of sparse planar array design. Based on the theory of minimum redundancy arrays, we recently proposed an iterative algorithm that is capable to design highly thinned arrays with a low side-lobe level while retaining the half-power-beam-width of uniform arrays. In this paper, we analyze the effect of kernel bandwidth and compare the approach to a recent paper by Kopilovich which is based on the family of Hadamard difference sets. The results show that the proposed method achieves similar performance with a substantially lower amount of array elements. Side-Lobe-Levels are comparable to the ones from uniform arrays and only slightly higher than for Hadamard-based arrays.
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.
