Article thumbnail

Finite sample identifiability of multiple constant modulus sources

By A. Leshem, Nicolas Petrochilos and A. Van Der Veen


International audienceWe prove that mixtures of continuous alphabet constant modulus sources can be identified with probability 1 with a finite number of samples (under noise-free conditions). This strengthens earlier results which only considered an infinite number of samples. The proof is based on the linearization technique of the analytical constant modulus algorithm (ACMA), together with a simple inductive argument. We then study the finite-alphabet case. In this case, we provide a subexponentially decaying upper bound on the probability of nonidentifiability for a finite number of samples. We show that under practical assumptions, this upper bound is tighter than the currently known bound. We then provide an improved exponentialy decaying upper bound for the case of-PSK signals (is even)

Topics: phase-shift keying (PSK)., identifiability, large deviations, Blind source separation, Chernoff bound, constant modulus signals, finite sample analysis, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
Publisher: Institute of Electrical and Electronics Engineers
Year: 2003
DOI identifier: 10.1109/TIT.2003.815791
OAI identifier: oai:HAL:hal-01693662v1
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • (external link)
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.