Abstract

Blind algorithms are interesting in communications interception context, particularly blind source separation (BSS) algorithms, for multiple input multiple output (MIMO) systems, and allow to estimate transmitted symbols by using few information on the transmitted data. But they introduce an arbitrary rotation on each separated output flow and possible permutations between these flows. Here we suppose that an Alamouti coding is used at emission. Without precaution the structure of the code is not found again in the BSS output because of arbitrary phases and possible rows permutation. If the code structure is lost, the redundancy introduced by the Alamouti code cannot be exploited to decrease both the bit error rate (BER) and the mean square errors (MSE). In order to recover the code structure in the BSS output, we propose a new criterion, associated with a BSS criterion, which exploits the Alamouti redundancy. This criterion allows to reestablish the Alamouti code structure and to obtain the same phase indeterminacy on each row of the separated data, so this proposed algorithm enables to decrease the ambiguities number inherent in the traditional BSS algorithms and like this, finally, to decrease the BER and the MSE.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.