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).
Document type :
Journal articles
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.univ-reims.fr/hal-01693662
Contributor : Nicolas Petrochilos <>
Submitted on : Saturday, December 7, 2019 - 4:40:37 PM
Last modification on : Tuesday, December 10, 2019 - 2:51:06 PM

File

leshem_IT03_cmafinsam.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

A. Leshem, Nicolas Petrochilos, A. van der Veen. Finite sample identifiability of multiple constant modulus sources. IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2003, 49 (9), pp.2314 - 2319. ⟨10.1109/TIT.2003.815791⟩. ⟨hal-01693662⟩

Share

Metrics

Record views

82

Files downloads

1