Finite sample identifiability of multiple constant modulus sources

DOI10.1109/TIT.2003.815791zbMATH Open1301.94033OpenAlexW2152618140MaRDI QIDQ3547233FDOQ3547233

Authors: Amir Leshem, Nicolas Petrochilos, Alle-Jan van der Veen 

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2003.815791

Recommendations

• Indeterminacy and identifiability of blind identification
• Separation of digital communication mixtures with the CMA: case of unknown symbol rates
• scientific article; zbMATH DE number 6892979
• A clustering approach for the blind separation of multiple finite alphabet sequences from a single linear mixture
• Blind identification of under-determined mixtures based on the characteristic function

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13)

Cited In (2)

• Finite alphabet source recovery in polynomial systems.
• Mode identification with finite statistics (Corresp.)

This page was built for publication: Finite sample identifiability of multiple constant modulus sources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547233)