On the convexity of the LCCM cost function for DS-CDMA blind multiuser detection

The linearly constrained constant modulus algorithm (LCCMA) applied to blind DS-CDMA multiuser detection was widely considered in the last few years. In some papers, global convergence of the linearly constrained constant modulus (LCCM) algorithm was incorrectly claimed, after which corrections were...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE communications letters Ročník 8; číslo 6; s. 351 - 353
Hlavní autoři: de Villiers, J.P., Linde, L.P.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.06.2004
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:1089-7798, 1558-2558
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The linearly constrained constant modulus algorithm (LCCMA) applied to blind DS-CDMA multiuser detection was widely considered in the last few years. In some papers, global convergence of the linearly constrained constant modulus (LCCM) algorithm was incorrectly claimed, after which corrections were published by other authors (see the Introduction section for references). In this letter, analysis of the LCCM criterion is extended to prove convexity of the LCCM cost function between any point and the global minimum, subject to certain conditions, by using the definition of a continuous convex function.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2004.831325