A New Algorithm for Optimum Multiuser Detection in Synchronous CDMA Systems

Summary Optimum multiuser detection for Code Division Multiple Access (CDMA) systems requires the solution of an NP-hard combinatorial optimization problem. It is well known that the computational complexity of the optimum multiuser detector is exponential with the number of active users in the system. In order to reduce the complexity of the optimum multiuser detection, we propose a Reduced Complexity Maximum Likelihood (RCML) algorithm that includes a set of novel certain boundary rules and characteristics. We investigate the performance and complexity tradeoffs for the RCML algorithm by conducting a set of simulations; Maximum Likelihood (ML) detection as a reference for performance comparisons, and relaxation based Semidefinite Programming (SDPB) algorithm as a reference for complexity comparisons. We show that the RCML algorithm is a promising algorithm for its computational savings over relaxation based algorithms in lightly-to-moderately loaded CDMA systems, and for its optimality in highly loaded CDMA systems.

[1]  Leslie R. Welch.  Lower bounds on the maximum correlation of signals , 1974 .

[2]  Qiang Wang,et al.  New suboptimal multiuser detectors for synchronous CDMA systems , 1996, IEEE Trans. Commun..

[3]  Evaggelos Geraniotis,et al.  Iterative multiuser detection for coded CDMA signals in AWGN and fading channels , 2000, IEEE Journal on Selected Areas in Communications.

[4]  Alexandra Duel-Hallen,et al.  Decorrelating decision-feedback multiuser detector for synchronous code-division multiple-access channel , 1993, IEEE Trans. Commun..

[5]  Johannes B. Huber.  Iterated Soft-Decision Interfer-ence Cancellation for CDMA , 1998 .

[6]  Sergio Verdu,et al.  Multiuser Detection , 1998 .

[7]  Sergio Verdú,et al.  Computational complexity of optimum multiuser detection , 1989, Algorithmica.

[8]  Branimir R. Vojcic,et al.  Turbo greedy multiuser detection , 2001, IEEE J. Sel. Areas Commun..

[9]  Yi Sun,et al.  Local Maximum Likelihood Multiuser Detection , 2003 .

[10]  C. Sankaran,et al.  Optimum multiuser detection with polynomial complexity , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[11]  Peter F. Driessen,et al.  A new multistage detector for synchronous CDMA communications , 1996, IEEE Trans. Commun..

[12]  Alex C. Kot,et al.  Decorrelator-based neighbour-searching multiuser detector in CDMA systems , 1996 .

[13]  Branimir R. Vojcic,et al.  Soft interference cancellation in multiuser communications , 1996, Wirel. Pers. Commun..

[14]  Anthony Ephremides,et al.  Solving a Class of Optimum Multiuser Detection Problems with Polynomial Complexity , 1998, IEEE Trans. Inf. Theory.

[15]  Panos M. Pardalos,et al.  Construction of test problems in quadratic bivalent programming , 1991, TOMS.

[16]  Lloyd R. Welch,et al.  Lower bounds on the maximum cross correlation of signals (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[17]  Michael W. Carter,et al.  The indefinite zero-one quadratic problem , 1984, Discret. Appl. Math..

[18]  Lars K. Rasmussen,et al.  A near ideal noise whitening filter for an asynchronous time-varying CDMA system , 1996, IEEE Trans. Commun..

[19]  P. Pardalos,et al.  Parallel branch and bound algorithms for quadratic zero–one programs on the hypercube architecture , 1990 .

[20]  John E. Mitchell,et al.  An improved branch and bound algorithm for mixed integer nonlinear programs , 1994, Comput. Oper. Res..

[21]  Branimir R. Vojcic,et al.  A new approach to greedy multiuser detection , 2002, IEEE Trans. Commun..

[22]  Panos M. Pardalos,et al.  Computational aspects of a branch and bound algorithm for quadratic zero-one programming , 1990, Computing.

[23]  Roy D. Yates,et al.  Optimum multiuser detection is tractable for synchronous CDMA systems using m-sequences , 1998, IEEE Communications Letters.

[24]  Lars K. Rasmussen,et al.  Near optimum tree-search detection schemes for bit-synchronous multiuser CDMA systems over Gaussian and two-path Rayleigh-fading channels , 1997, IEEE Trans. Commun..

[25]  Lars K. Rasmussen,et al.  Constrained maximum-likelihood detection in CDMA , 2001, IEEE Trans. Commun..

[26]  Craig K. Rushforth,et al.  Joint signal detection and parameter estimation in multiuser communications , 1993, IEEE Trans. Commun..

[27]  Yi Sun.  Eliminating-highest-error and fastest-metric-descent criteria and iterative algorithms for bit-synchronous CDMA multiuser detection , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[28]  Yi Sun.  Search algorithms based on eliminating-highest-error and fastest-metric-descent criteria for bit-synchronous CDMA multiuser detection , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[29]  S.K. Wilson,et al.  A low complexity threshold detector making MLSD decisions in a multiuser environment , 1998, VTC '98. 48th IEEE Vehicular Technology Conference. Pathway to Global Wireless Revolution (Cat. No.98CH36151).

[30]  Michael Jünger,et al.  Experiments in quadratic 0–1 programming , 1989, Math. Program..

[31]  Lars K. Rasmussen,et al.  Breadth-first maximum likelihood detection in multiuser CDMA , 1997, IEEE Trans. Commun..

[32]  Craig K. Rushforth,et al.  Multiuser signal detection using sequential decoding , 1990, IEEE Trans. Commun..

[33]  A. K. Mittal,et al.  Unconstrained quadratic bivalent programming problem , 1984 .

[34]  Yi Sun.  A family of linear complexity likelihood ascent search multiuser detectors for CDMA communications , 2000, Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154).

[35]  Dariush Divsalar,et al.  Improved parallel interference cancellation for CDMA , 1998, IEEE Trans. Commun..

[36]  Lei Wei,et al.  Synchronous DS-SSMA with improved decorrelating decision-feedback multiuser detection , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.