HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
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).
Document type :
Journal articles
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download

Contributor : Nicolas Petrochilos Connect in order to contact the contributor
Submitted on : Saturday, December 7, 2019 - 4:40:37 PM
Last modification on : Thursday, October 14, 2021 - 1:10:09 PM
Long-term archiving on: : Sunday, March 8, 2020 - 1:26:50 PM


Publisher files allowed on an open archive




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⟩



Record views


Files downloads