Share Email Print
cover

Proceedings Paper

Tracking and interference suppression performance for the minimal computational complexity non-Eigen decomposition beamformer
Author(s): Garret Okamoto; Chih-Wei Chen
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 28 April 2010
PDF: 10 pages
Proc. SPIE 7706, Wireless Sensing, Localization, and Processing V, 77060Y (28 April 2010); doi: 10.1117/12.859736
Show Author Affiliations
Garret Okamoto, Adaptive Communications Research, Inc. (United States)
Chih-Wei Chen, Adaptive Communications Research, Inc. (United States)


Published in SPIE Proceedings Vol. 7706:
Wireless Sensing, Localization, and Processing V
Sohail A. Dianat; Michael D. Zoltowski, Editor(s)

© SPIE. Terms of Use
Back to Top