TY - GEN
T1 - On the number of samples needed to identify a mixture of finite alphabet constant modulus sources
AU - Leshem, Amir
AU - Van der Veen, Alle Jan
PY - 2003
Y1 - 2003
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/0141451999
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0141451999
VL - 4
T3 - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing
SP - 329
EP - 332
BT - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing
T2 - 2003 IEEE International Conference on Accoustics, Speech, and Signal Processing
Y2 - 6 April 2003 through 10 April 2003
ER -