Fast subspace decomposition null extension for two-dimensional array antenna

A multiple null algorithm that can adjust the number, width and depth of multiple nulls in accordance with the environment requirements is proposed for the improvement of the interference cancellation capability of two-dimensional array antennas. The Fast Subspace Decomposition (FSD) and cyclic-Jacobi algorithms are employed to robustly simplify the computation of inverse interference covariance matrix and to determine the optimal weighting matrix of the multiple null digital beam former (DBF). Finally, the numerical simulations of the multiple null DBF are used to demonstrate its anti-jamming capability for the two-dimensional array antennas. The number of multipliers for computing the inverse of interference covariance matrix between FSD algorithm and Eigen value decomposition (EVD) algorithm is also compared.