Tracking and interference suppression performance for the minimal computational complexity non-Eigen decomposition beamformer
Garret T. Okamoto, Chih‐Wei Chen · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2010
This paper evaluates tracking and interference suppression performance for the ultra low computational complexity Non- Eigen Decomposition (NED) blind beamforming algorithm. Current blind beamforming algorithms require computational complexity too high for many target applications. NED does not rely on the eignenvalues and eigenvectors used by conventional algorithms and requires significantly less computations, with a total computational load of O(4M-4) per snapshot for a system with M receiving antennas by approximating the cross correlation vector of the received signals in the reference and other antennas. This technique requires neither a training sequence nor an assumption of incoherency among impinging signals. Simulations show that NED achieves comparable performance as conventional blind beamforming algorithms in tracking, interference suppression, and misadjustment.