A Preprocessing Algorithm Applicable to the Multiuser Detection Problem
2005 (English)Report (Other academic)
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 for some or all integer variables without approximations in polynomial time. When the optimal multiuser detection problem is formulated as a maximum likelihood problem, a binary quadratic programming problem has to be solved. Fortunately, the low correlation between different users in the multiuser detection problem enables the use of the preprocessing algorithm. Simulations show that the preprocessing algorithm is able to compute almost all variables in the problem, even though the system is heavily loaded and affected by noise.
Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2005. , 10 p.
LiTH-ISY-R, ISSN 1400-3902 ; 2716
CDMA, Gold sequences, Multiuser detection, Polynomial complexity, Binary quadratic programming
IdentifiersURN: urn:nbn:se:liu:diva-56045ISRN: LiTH-ISY-R-2716OAI: oai:DiVA.org:liu-56045DiVA: diva2:316895