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.
|Translated title of the contribution||A bootstrap multi-user detector for CDMA based on Tikhonov regularization|
|Pages (from-to)||69 - 72|
|Number of pages||3|
|Journal||IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003 (ICASSP '03)|
|Publication status||Published - Apr 2003|
|Event||2003 IEEE International Conference on Acoustics, Speech, and Signal Processing - Hong Kong Exhibition and Convention Centre , Hong Kong, China|
Duration: 6 Apr 2003 → 10 Apr 2003
Bibliographical notePublisher: Institute of Electrical and Electronics Engineers (IEEE)
Name and Venue of Conference: International Conference on Acoustics, Speech, and Signal Processing, 2003 (ICASSP '03)
Rose publication type: Conference contribution
Sponsorship: C Kasparis would like to thank QinetiQ Ltd. and
EPSRC for funding his research at the University of Bristol.
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
- Multi-User Detection (MUD)