Adaptive separation of independent sources: a deflation approach
ICASSP '94 Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04
A multi-user Kurtosis algorithm for blind source separation
ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05
Blind adaptive equalizer for broadband MIMO time reversal STBC based on PDF fitting
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Globally convergent blind source separation based on a multiuser kurtosis maximization criterion
IEEE Transactions on Signal Processing
Closed-form blind MIMO channel estimation for orthogonal space-time block codes
IEEE Transactions on Signal Processing
A blind signal separation method for multiuser communications
IEEE Transactions on Signal Processing
Blind and semi-blind equalization for generalized space-time block codes
IEEE Transactions on Signal Processing
Channel estimation for space-time orthogonal block codes
IEEE Transactions on Signal Processing
An analysis of constant modulus receivers
IEEE Transactions on Signal Processing
Blind ML detection of orthogonal space-time block codes: efficient high-performance implementations
IEEE Transactions on Signal Processing
Blind Channel Estimation for STBC Systems Using Higher-Order Statistics
IEEE Transactions on Wireless Communications
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
Hi-index | 0.08 |
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.