A recursive algorithm for the design of array antenna in STAP application

As an effective reduced-dimension space time adaptive processing (STAP) approach, subarray technique is widely used in practice. However, it is hard to determine how many subarrays are necessary and what shape should they have. In this paper, a generalized form of STAP processing for arbitrary array is established. Then the subarray technique for STAP is discussed. In order to determine the optimum subarray partition, a recursive algorithm is proposed. Numerical results are presented to verify the effectiveness of the proposed method.