A Preprocessing Algorithm Applicable to the Multiuser Detection Problem

In this paper a preprocessing algorithm for binary quadratic programming problems is presented. For some types of binary quadratic programming problems, the algorithm can compute the optimal value ...

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[3]  John E. Beasley,et al.  Heuristic algorithms for the unconstrained binary quadratic programming problem , 1998 .

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

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

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

[7]  Lars K. Rasmussen,et al.  An asynchronous multiuser CDMA detector based on the Kalman filter , 1998, IEEE J. Sel. Areas Commun..

[8]  Alex J. Grant,et al.  Polynomial complexity optimal detection of certain multiple-access systems , 2000, IEEE Trans. Inf. Theory.

[9]  Kengo Katayama,et al.  Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem , 2001, Eur. J. Oper. Res..

[10]  P. Willett,et al.  Speed and accuracy comparison of techniques to solve a binary quadratic programming problem with applications to synchronous CDMA , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[11]  Yumin Lee,et al.  A novel low-complexity near-ML multiuser detector for DS-CDMA and MC-CDMA systems , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[12]  Bernd Freisleben,et al.  Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming , 2002, J. Heuristics.

[13]  Fred W. Glover,et al.  One-pass heuristics for large-scale unconstrained binary quadratic problems , 2002, Eur. J. Oper. Res..

[14]  Krishna R. Pattipati,et al.  Fast optimal and suboptimal any-time algorithms for CDMA multiuser detection based on branch and bound , 2004, IEEE Transactions on Communications.

[15]  Daniel Axehill,et al.  A preprocessing algorithm for MIQP solvers with applications to MPC , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).