Answers are grounded in this paper and cite their sources.
Two online implementations of the sample matrix inversion minimum variance distortionless response (SMI-MVDR) antenna array beamformer, based on recursive updating of the diagonal loading triangular matrix decomposition, are presented. The first proposed beamformer uses the Cholesky factorization recursive updating of the matrix whose dimension is increasing. The second beamformer uses the Householder transform (HT) recursive updating of the modified input data matrix. The proposed implementations consist primarily of vector operations, that is, they are suitable for parallel implementations with FPGAs or DSPs. The computational cost of the proposed beamforming algorithms isO(Nk), whereNis the number of antenna array elements, andkis the number of processing snapshots. The proposed implementations are especially useful for large antenna array applications, where the number of available snapshots does not exceed the number of the array antenna elements. The simulation result shows that the numerical performance of the proposed beamformers is superior, relative to the conventional recursive MVDR beamformer implementation.
No takes yet. Share an insight, caveat, or question.
Zaharov et al. (2008) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: