Globally Convergent Deflationary Instantaneous Blind Source Separation Algorithm for Digital Communication Signals

Recently an instantaneous blind source separation (BSS) approach that exploits the bounded magnitude structure of digital communications signals has been introduced. In this paper, we introduce a deflationary adaptive algorithm based on this criterion and provide its convergence analysis. We show th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on signal processing 2007-05, Vol.55 (5), p.2182-2192
1. Verfasser: Erdogan, A.T.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Recently an instantaneous blind source separation (BSS) approach that exploits the bounded magnitude structure of digital communications signals has been introduced. In this paper, we introduce a deflationary adaptive algorithm based on this criterion and provide its convergence analysis. We show that the resulting algorithm is convergent to one of the globally optimal points that correspond to perfect separation. The simulation examples related to the separation of digital communication signals are provided to illustrate the convergence and the performance of the algorithm
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2007.893214