 |
Journal articles
Finite sample identifiability of multiple constant modulus sources
Abstract : We 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).
Cited literature [12 references]
https://hal.univ-reims.fr/hal-01693662
Contributor : Nicolas Petrochilos <>
Submitted on : Saturday, December 7, 2019 - 4:40:37 PM
Last modification on : Monday, May 17, 2021 - 2:52:18 PM
Long-term archiving on: : Sunday, March 8, 2020 - 1:26:50 PM
Contributor : Nicolas Petrochilos <>
Submitted on : Saturday, December 7, 2019 - 4:40:37 PM
Last modification on : Monday, May 17, 2021 - 2:52:18 PM
Long-term archiving on: : Sunday, March 8, 2020 - 1:26:50 PM
File
leshem_IT03_cmafinsam.pdf
Publisher files allowed on an open archive