Abstract
In this paper, we develop a general approach for reducing the computational complexity of any direction finding method implemented with forward/backward (FB) averaging. We develop simplified FB data matrices in a manner paralleling previous work related to centrohermitian (correlation) matrices. Based on these simplified data matrices, efficient construction and updating of the FB correlation matrix is developed. In addition, efficient FB FFT, FB beamspace, FB EVD updating, FB SVD, and FB SVD updating methods are derived. In most cases, FB-based direction-finding methods can be simplified so that the computational complexity is reduced below that of an analogous forward only implementation. Thus, effectively twice the amount of data is processed with less total computation. >
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.
