Abstract
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. (5 pages)
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.
