J4

• Original Articles • Previous Articles     Next Articles

A semidefinite programming multiuser detector with pretreatment

MU Xue-wen(1);LIU San-yang(1);ZHANG Ya-ling(2)

  

  1. (1) School of Science, Xidian Univ., Xi′an 710071, China
    (2) Dept. of Computer Science, Xi′an Science and Technology Univ., Xi′an 710054, China
  • Received:1900-01-01 Revised:1900-01-01 Online:2006-02-20 Published:2006-02-20

Abstract: Based on the quadratic integral programming model of the multiuser detection problem, a detection strategy by the semidefinite programming method with pretreatment is presented. A pretreatment method is used to obtain an equivalent quadratic integral model with a lesser scale. Then, we give the semidefinite programming relaxation for the equivalent quadratic integral model. Coupled with the randomized method, we obtain the suboptimal solution to the multiuser detection problem. Compared with the semidefinite programming method, our method has the advantages of lower bit error rate and lesser CPU time, which simulations have proved.

Key words: multiuser detection, semidefinite programming relaxation, quadratic integral programming, randomized method, bit error

CLC Number: 

  • O221.4