By Topic

Recursive blind source separation for BPSK signals

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

2 Author(s)
Leus, G. ; ESAT, Katholieke Univ., Leuven, Heverlee, Belgium ; Gesbert, D.

This paper addresses the important problem of separating and estimating the contributions of multiple users (sources) signals impinging on an antenna array in a wireless communication system. The proposed approach has key advantages over existing ones, which are listed below: (i) the structure of estimation is recursive, therefore it estimates the incoming bits on the fly as they reach the receive array instead of estimating a separating matrix. (ii) it exploits the finite alphabet property (here, BPSK) of the communication signals in an explicit manner, through the use of a finite-state trellis. (iii) perfect decisions are obtained in the absence of noise upon certain mild conditions on the transmitted signals (excitation conditions). Therefore (local) convergence is not an issue here

Published in:

Signal Processing Advances in Wireless Communications, 1999. SPAWC '99. 1999 2nd IEEE Workshop on

Date of Conference:

1999