By Topic

Finite sample identifiability of multiple constant modulus sources

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
A. Leshem ; Dept. ITS, Delft Univ. of Technol., Netherlands ; N. Petrochilos ; A. -J. van der Veen

We prove that mixtures of continuous 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, together with a simple inductive argument. We then study the finite alphabet case. In this case we provide an upper bound on the probability of non-identifiability for finite sample of sources. We show that under practical assumptions, this upper bound is tighter than the currently known bound.

Published in:

Sensor Array and Multichannel Signal Processing Workshop Proceedings, 2002

Date of Conference:

4-6 Aug. 2002