Dissemin is shutting down on January 1st, 2025

Published in

2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).

DOI: 10.1109/icassp.2003.1202543

Links

Tools

Export citation

Search in Google Scholar

A bootstrap multi-user detector for CDMA based on Tikhonov regularization

Journal article published in 2003 by Fletcher Pn, Rj J. Piechocki ORCID, C. Kasparis, Pn N. Fletcher, Ar R. Nix
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

A novel multi-user detection (MUD) technique for CDMA systems is introduced. The new method is well suited for cases in which the code cross correlation matrix is ill-conditioned. In practice, this case coincides with having code lengths approximately equal to the number of users - a desirable condition in terms of bandwidth efficiency. Our approach employs an iterative formulation of a well-known regularization method for linear inverse problems, which is suited to the MUD problem. The technique allows knowledge of the finite set in which the solution belongs to be exploited in a computationally efficient manner in order to improve the quality of the estimate iteratively.