| Hi-index | 35.68 |
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