By Topic

Algebraic methods for deterministic blind beamforming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
van der Veen, A.-J. ; Dept. of Electr. Eng., Delft Univ. of Technol., Netherlands

Deterministic blind beamforming algorithms try to separate superpositions of source signals impinging on a phased antenna array by using the deterministic properties of the signals or the channels such as their constant modulus or directions-of-arrival. Progress in this area has been abundant over the past ten years and has resulted in several powerful algorithms. Unlike optimal or adaptive methods, the algebraic methods discussed in this review act on a fixed block of data and give closed-form expressions for beamformers by focusing on algebraic structures. This typically leads to subspace estimation and generalized eigenvalue problems. After introducing a simple and widely used multipath channel model, the paper provides an anthology of properties that are available, as well as generic algorithms that exploit them

Published in:

Proceedings of the IEEE  (Volume:86 ,  Issue: 10 )