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

Document Type

Conference Proceeding

Publication Date

9-12-2008

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. ©2008 IEEE.

Identifier

51249121117 (Scopus)

ISBN

[9781424420742]

Publication Title

IEEE International Conference on Communications

External Full Text Location

https://doi.org/10.1109/ICC.2008.170

ISSN

05361486

First Page

866

Last Page

870

This document is currently not available here.

Share

COinS