Maximum likelihood estimation of constellation vectors for blind separation of co-channel BPSK signals and its performance analysis
- 1 July 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 45 (7), 1736-1741
- https://doi.org/10.1109/78.599943
Abstract
In this paper, we present a method for blind separation of co-channel BPSK signals arriving at an antenna array. This method consists of two parts: the maximum likelihood constellation estimation and assignment. We show that at high SNR, the maximum likelihood constellation estimation is well approximated by the smallest distance clustering algorithm, which we proposed earlier on heuristic grounds. We observe that both these methods for estimating the constellation vectors perform very well at high SNR and nearly attain Cramer-Rao bounds. Using this fact and noting that the assignment algorithm causes negligible error at high SNR, we derive upper bounds on the probability of bit error for the above method at high SNR. These upper bounds fall very rapidly with increasing SNR, showing that our constellation estimation-assignment approach is very efficient. Simulation results are given to demonstrate the usefulness of the boundsKeywords
This publication has 5 references indexed in Scilit:
- Blind separation of multiple co-channel BPSK signals arriving at an antenna arrayIEEE Signal Processing Letters, 1995
- Blind estimation of multiple co-channel digital signals using an antenna arrayIEEE Signal Processing Letters, 1994
- A complex gradient operator and its application in adaptive array theoryIEE Proceedings H Microwaves, Optics and Antennas, 1983
- Note on the Consistency of the Maximum Likelihood Estimate for Nonidentifiable DistributionsThe Annals of Statistics, 1981
- An Iterative Procedure for Obtaining Maximum-Likelihood Estimates of the Parameters for a Mixture of Normal DistributionsSIAM Journal on Applied Mathematics, 1978