Paper
28 April 2010 Tracking and interference suppression performance for the minimal computational complexity non-Eigen decomposition beamformer
Garret Okamoto, Chih-Wei Chen
Author Affiliations +
Abstract
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.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Garret Okamoto and Chih-Wei Chen "Tracking and interference suppression performance for the minimal computational complexity non-Eigen decomposition beamformer", Proc. SPIE 7706, Wireless Sensing, Localization, and Processing V, 77060Y (28 April 2010); https://doi.org/10.1117/12.859736
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Field emission displays

Antennas

Signal to noise ratio

Detection and tracking algorithms

Receivers

Phased arrays

Algorithms

RELATED CONTENT


Back to Top