On the number of samples needed to identify a mixture of finite alphabet constant modulus sources

Amir Leshem*, Alle Jan Van der Veen

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations

Abstract

Constant-modulus algorithms try to separate linear mixtures of sources with modulus 1. We study the identifiability of this problem: how many samples are needed to ensure that in the noiseless case we have a unique solution? For finite-alphabet (L-PSK) sources, finite sample identifiability can hold only with a probability close to but not equal to 1. In a previous paper, we provided a sub-exponentialy decaying upper bound on the probability of non-identifiability. Here, we provide an improved exponentialy decaying upper bound, based on Chernoff bounds. We show that under practical assumptions, this upper bound is much tighter than previously known bounds.

Original languageAmerican English
Pages (from-to)329-332
Number of pages4
JournalProceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing
Volume4
StatePublished - 2003
Externally publishedYes
Event2003 IEEE International Conference on Accoustics, Speech, and Signal Processing - Hong Kong, Hong Kong
Duration: 6 Apr 200310 Apr 2003

Fingerprint

Dive into the research topics of 'On the number of samples needed to identify a mixture of finite alphabet constant modulus sources'. Together they form a unique fingerprint.

Cite this