An analytical constant modulus algorithm

Iterative constant modulus algorithms such as Godard (1980) and CMA have been used to blindly separate a superposition of cochannel constant modulus (CM) signals impinging on an antenna array. These algorithms have certain deficiencies in the context of convergence to local minima and the retrieval...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on signal processing Jg. 44; H. 5; S. 1136 - 1155
Hauptverfasser: van der Veen, A.-J., Paulraj, A.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.05.1996
Institute of Electrical and Electronics Engineers
Schlagworte:
ISSN:1053-587X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Iterative constant modulus algorithms such as Godard (1980) and CMA have been used to blindly separate a superposition of cochannel constant modulus (CM) signals impinging on an antenna array. These algorithms have certain deficiencies in the context of convergence to local minima and the retrieval of all individual CM signals that are present in the channel. We show that the underlying constant modulus factorization problem is, in fact, a generalized eigenvalue problem, and may be solved via a simultaneous diagonalization of a set of matrices. With this new analytical approach, it is possible to detect the number of CM signals present in the channel, and to retrieve all of them exactly, rejecting other, non-CM signals. Only a modest amount of samples is required. The algorithm is robust in the presence of noise and is tested on measured data collected from an experimental set-up.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1053-587X
DOI:10.1109/78.502327