Spreading codes enabling warp converging Wiener filters for multiuser detection in CDMA systems

Xiaoli Wang, Hongya Ge

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

It has been shown in our previous work [1][2] that for signal modes with a specially structured data covariance matrix, a warp (stable and predictable early) convergence can be achieved using the reduced-rank conjugate gradient (RRCG) Wiener filter (WF) for multiuser detection (MUD) in code division multiple access (CDMA) communication systems. In this work, we study various commonly used spreading codes that enable warp converging of the RRCG-WF. By analyzing the eigen-structure of the code set Grammian, we provide the exact number of convergence steps for different code sets. It turns out that this number varies from 1 to 4 based on different spreading sequences, implying greatly reduced computational complexity of the RRCG-WF for MUD in CDMA systems.

Original languageEnglish (US)
Title of host publicationICC 2008 - IEEE International Conference on Communications, Proceedings
Pages866-870
Number of pages5
DOIs
StatePublished - Sep 12 2008
EventIEEE International Conference on Communications, ICC 2008 - Beijing, China
Duration: May 19 2008May 23 2008

Publication series

NameIEEE International Conference on Communications
ISSN (Print)0536-1486

Other

OtherIEEE International Conference on Communications, ICC 2008
CountryChina
CityBeijing
Period5/19/085/23/08

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Spreading codes enabling warp converging Wiener filters for multiuser detection in CDMA systems'. Together they form a unique fingerprint.

Cite this