ALGEBRAIC METHODS FOR DETERMINISTIC BLIND BEAMFORMING

Deterministic blind beamforming algorithms try to separate superpositi ons of soul ce signals impinging on a phased antenna array by using de terministic properties of the signals or the channels such as their co nstant modulus or directions-of-arrival. Progress in this area has bee n abundant over the past ten years and has resulted in several powerfu l algorithms. Unlike optimal or adaptive methods, the algebraic method s discussed in this review act on a fixed block of data and give close d-form expressions for beamformers by focusing on algebraic structures . This typically leads to subspace estimation and generalized eigenval ue problems. After introducing a simple and widely used multipath chan nel model, the paper provides an anthology of properties that are avai lable, as well as generic algorithms that exploit them.