TY - JOUR

T1 - Blind separation of linear mixtures of digital signals using successive interference cancellation iterative least squares

AU - Li, Tao

AU - Sidiropoulos, Nicholas D.

PY - 1999

Y1 - 1999

N2 - We consider blind separation of linear mixtures of digital communication signals in noise. When little or nothing can be assumed about the mixing matrix, signal separation may be achieved by exploiting structural properties of the transmitted signals. ILSP and ILSE are two iterative least squares (ILS) separation algorithms that exploit the finite-alphabet property. ILSE is monotonically convergent and performs very well, but its complexity is exponential in the number of signals; ILSP is computationally cheaper, but is not guaranteed to converge monotonically, and leaves much to be desired in terms of BER-SNR performance relative to ILSE. We propose two computationally efficient and provably monotonically convergent ILS blind separation algorithms based on an optimal scaling Lemma. The signal estimation step of both algorithms is reminiscent of Successive Interference Cancellation (SIC) ideas. For well-conditioned data and moderate SNR, the proposed algorithms attain the performance of ILSE at the complexity cost of ILSP.

AB - We consider blind separation of linear mixtures of digital communication signals in noise. When little or nothing can be assumed about the mixing matrix, signal separation may be achieved by exploiting structural properties of the transmitted signals. ILSP and ILSE are two iterative least squares (ILS) separation algorithms that exploit the finite-alphabet property. ILSE is monotonically convergent and performs very well, but its complexity is exponential in the number of signals; ILSP is computationally cheaper, but is not guaranteed to converge monotonically, and leaves much to be desired in terms of BER-SNR performance relative to ILSE. We propose two computationally efficient and provably monotonically convergent ILS blind separation algorithms based on an optimal scaling Lemma. The signal estimation step of both algorithms is reminiscent of Successive Interference Cancellation (SIC) ideas. For well-conditioned data and moderate SNR, the proposed algorithms attain the performance of ILSE at the complexity cost of ILSP.

UR - http://www.scopus.com/inward/record.url?scp=0032653653&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032653653&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0032653653

SN - 0736-7791

VL - 5

SP - 2703

EP - 2706

JO - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

JF - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

T2 - Proceedings of the 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP-99)

Y2 - 15 March 1999 through 19 March 1999

ER -