Data-aided and blind stochastic gradient algorithms for widely linear MMSE MAI suppression for DS-CDMA
In this paper, three novel stochastic gradient algorithms for adjustment of the widely linear (WL) minimum mean-squared error (MMSE) filter for multiple access interference (MAI) suppression for direct-sequence code-division multiple access (DS-CDMA) are introduced and analyzed. In particular, we de...
Uložené v:
| Vydané v: | IEEE transactions on signal processing Ročník 52; číslo 3; s. 746 - 756 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York, NY
IEEE
01.03.2004
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Predmet: | |
| ISSN: | 1053-587X, 1941-0476 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | In this paper, three novel stochastic gradient algorithms for adjustment of the widely linear (WL) minimum mean-squared error (MMSE) filter for multiple access interference (MAI) suppression for direct-sequence code-division multiple access (DS-CDMA) are introduced and analyzed. In particular, we derive a data-aided WL least-mean-square (LMS) algorithm, a blind WL minimum-output-energy (MOE) algorithm, and a WL blind LMS (BLMS) algorithm. We give analytical expressions for the steady-state signal-to-interference-plus-noise ratios (SINRs) of the proposed WL algorithms, and we also investigate their speed of convergence. Wherever possible, comparisons with the corresponding linear adaptive algorithms are made. Both analytical considerations and simulations show, in good agreement, the superiority of the novel WL adaptive algorithms. Nevertheless, all proposed WL algorithms require a slightly lower computational complexity than their linear counterparts. |
|---|---|
| Bibliografia: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 content type line 23 |
| ISSN: | 1053-587X 1941-0476 |
| DOI: | 10.1109/TSP.2003.822359 |