On regularity and identifiability of blind source separation under constant-modulus constraints

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

We investigate the information regularity and identifiability of the blind source separation (BSS) problem with constant modulus (CM) constraints on the sources. We establish for this problem the connection between the information regularity [existence of a finite Cramér-Rao bound (CRB)] and local identifiability. Sufficient and necessary conditions for local identifiability are derived. We also study the conditions under which unique (global) identifiability is guaranteed within the inherently unresolvable ambiguities on phase rotation and source permutation. Both sufficient and necessary conditions are obtained.

Original languageEnglish (US)
Pages (from-to)1272-1281
Number of pages10
JournalIEEE Transactions on Signal Processing
Volume53
Issue number4
DOIs
StatePublished - Apr 2005

Bibliographical note

Funding Information:
Manuscript received August 7, 2003; revised April 12, 2004. This work was prepared through collaborative participation in the Communications and Networks Consortium sponsored by the U.S. Army Research Laboratory under the Collaborative Technology Alliance Program under Cooperative Agreement DAAD19-01-2-0011. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation thereon. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Carlos H. Muravchik.

Keywords

  • Blind source separation (BSS)
  • Constant modulus (CM)
  • Cramér-Rao bound (CRB)
  • Identifiability
  • Information regularity

Fingerprint

Dive into the research topics of 'On regularity and identifiability of blind source separation under constant-modulus constraints'. Together they form a unique fingerprint.

Cite this