{"title":"Recursive blind source separation for BPSK signals","authors":"G. Leus, D. Gesbert","doi":"10.1109/SPAWC.1999.783070","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":365086,"journal":{"name":"1999 2nd IEEE Workshop on Signal Processing Advances in Wireless Communications (Cat. No.99EX304)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 2nd IEEE Workshop on Signal Processing Advances in Wireless Communications (Cat. No.99EX304)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.1999.783070","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
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.