Null-matching for the design of linear aperiodic arrays

In this paper the design of linear aperiodic arrays is solved imposing that the nulls of the array factor match those of a Dolph-Chebyschev reference array. With respect to a previous work published by Haupt [R.L. Haupt, 1995], the present technique permits to design aperiodic arrays with an arbitrary number of elements. The maximum sidelobe level achievable with an assigned number of array elements is identified.